Kennard and Stone algorithm

I had mentioned Kennard and Stone algorithm when I was doing the reviews on the various machine learning software. So what exactly is the Kennard and Stone algorithm? In a nutshell, the following is the procedure for the algorithm: Two compounds with the largest Euclidean distance apart were initially selected for the training set. The remaining compounds for the training set were selected by maximizing the minimum distances between the compounds in the training set and the rest of the compounds in the dataset. This selection process continues until the desired number of compounds was selected for the training set. The remaining compounds in the dataset will be used as the validation set (Kennard et al. 1969).

References

  • Kennard RW and Stone L (1969). Computer aided design of experiments. Technometrics 11: 137-148.
Share This

One Response to “Kennard and Stone algorithm”

  1. Anonymous Says:

    the explanation is not very clear.
    please provide examples for better understanding of the algorithm.

Leave a Reply


Close
E-mail It