1Institute of Information and Communication Technologies, Mehran University of Engineering and Technology Jamshoro, Sindh, Pakistan
2IETR/INSA de Rennes, 20, Avenue des Buttes de Coësmes, Rennes, 35043, France
*Author for Correspondence. E-mail: bsc_itman@yahoo.com
This paper presents a method called fusion of over-segmentations (FOOS) that gives the optimal or near-optimal clustering solution in just three runs of k-means. The algorithm over-segments the dataset twice. The two over-segmentations fuse together and determine the initial cluster-centres for the third and last run of k-means. FOOS gives a plausible solution even if an approximate number of clusters is known. Theoretical, analytical and experimental results compare FOOS with single-run k-means and k-means with multiple restarts. This technique addresses the issue of data clustering in all the possible areas, including data mining, pattern recognition, machine learning and statistics. The results obtained while segmenting a variety of texture images and non-image datasets are encouraging. The 40% over-segmentation gives the best results.
Data analysis, k-means clustering, Over-segmentation, Image segmentation
