next up previous contents
Next: Expectation-Maximisation Up: Implemented segmenters Previous: Implemented segmenters   Contents

K-Means

K-Means is a simple algorithm, the pseudocode for which can be found in Figure 4.11. However, initial settings for K-means (e.g. initial cluster membership and number of clusters) are set using problem-specific information. The K-Means algorithm implementation is largely historical, and is of limited practical use in the current version of TClass, its role being largely replaced by the E-M algorithm.

In our implementation, K-Means accepts the following parameters:


next up previous contents
Next: Expectation-Maximisation Up: Implemented segmenters Previous: Implemented segmenters   Contents
Mohammed Waleed Kadous 2002-12-10