期刊名称：International Journal of Soft Computing & Engineering
电子版ISSN：2231-2307
出版年度：2012
卷号：2
期号：1
页码：212-215
出版社：International Journal of Soft Computing & Engineering
摘要：In order to the find the close association between the density of data points, in the given data set of pixels of an image, clustering provides an easy analysis and proper validation. In this paper various clustering techniques along with some clustering algorithms are described. Further k-means algorithm, its limitations and a new approach of clustering called as M-step clustering that may overcomes these limitations of k-means is included.
