Scribd
Upload
47 views4 pages

Which Go Into The ?: Data Points

The Kennard-Stone algorithm is described for selecting data points to go into a training set. It involves finding the smallest distance from candidate points to those already selected, then choosing the candidate with the largest distance among the smallest distances to add to the training set. This process is repeated to incrementally build a representative training set.

Uploaded by

Madan Lakshmanan
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
47 views4 pages

Which Go Into The ?: Data Points

The Kennard-Stone algorithm is described for selecting data points to go into a training set. It involves finding the smallest distance from candidate points to those already selected, then choosing the candidate with the largest distance among the smallest distances to add to the training set. This process is repeated to incrementally build a representative training set.

Uploaded by

Madan Lakshmanan
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Which data points go into the training set?

22 September 2006

SCI: Modelling the Properties and Behaviour of Molecules

35

Kennard-Stone Algorithm 1
1

Find smallest distance from candidates to objects already selected

Find largest distance among the smallest distances

The corresponding point goes into the training set


SCI: Modelling the Properties and Behaviour of Molecules 36

22 September 2006

Kennard-Stone Algorithm 2
1

Find smallest distance from candidates to objects already selected

Find largest distance among the smallest distances

The corresponding point goes into the training set


SCI: Modelling the Properties and Behaviour of Molecules 37

22 September 2006

Kennard-Stone Algorithm 3
1

Find smallest distance from candidates to objects already selected

Find largest distance among the smallest distances

The corresponding point goes into the training set


SCI: Modelling the Properties and Behaviour of Molecules 38

22 September 2006

You might also like