论文信息 - Bimean clustering

Bimean clustering

An algorithm is presented which finds the best-fitting pair of constants, in the least squares sense, to a set of scalar data; we call this pair of constants the 'bimean' of the data. The relationship of the bimean clustering to the ISODATA clustering algorithm, and its application to image thresholding, are also discussed.

[1] Walter D. Fisher. On Grouping for Maximum Homogeneity , 1958 .

[2] J. A. Hartigan,et al. A k-means clustering algorithm , 1979 .

[3] Flavio R. Dias Velasco,et al. Thresholding Using the Isodata Clustering Algorithm , 1979 .

[4] J. Hartigan,et al. Percentage Points of a Test for Clusters , 1969 .

[5] D. Pollard. Strong Consistency of $K$-Means Clustering , 1981 .

[6] Richard O. Duda,et al. Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[7] Maurice K. Wong,et al. Algorithm AS136: A k-means clustering algorithm. , 1979 .