Sample (Kennard-Stone)


Synopsis

Creates a sample from an example set using the Kennard-Stone algorithm.


Description

This operator performs a Kennard-Stone Sampling. This sampling Algorithm works as follows: First find the two points most separated in the training set. For each candidate point, find the smallest distance to any object already selected. Select that point for the training set which has the largest of these smallest distances As described above, this algorithm always gives the same result, due to the two starting points which are always the same. This implementation reduces number of iterations by holding a list with candidates of the largest smallest distances. The parameters controll the number of examples in the sample


Input


Output


Parameters


ExampleProcess