Journal of Software · 2005 · 14 citations · 8 references
ComputingComputer ScienceData ScienceAlgorithmsData MiningMachine LearningData PartitioningOptimization For Machine LearningPattern RecognitionUnsupervised LearningCluster AnalysisClusteringK-means ClusteringRobust Clustering
Abstract: Incorporating instance-level constraints into K-means algorithm can improve the accuracy of clustering. As the partition generated is represented by K centers and a cluster is represented by only one center, the representation model prevents further improvement of the accuracy. Based upon the instance-level constraints, two types of constraints between instance and class are presented, three types of constraints between classes are presented too, and the constrained partition model is presented and analyzed. In this model, based upon the constraints between sub-clusters, more centers are utilized to represent one cluster, which makes the representation of partition flexible and precise. An algorithm CKS (constrained K-means with subsets) is presented to generate the constrained partition. The experiments on three UCI datasets: Glass, Iris and Sonar, suggest that CKS is remarkably superior to COP-K-means in accuracy and robustness, and is better than CCL too. The time for running CKS is neither significantly influenced by the number of constraints compared with COP-K-means, nor remarkably increased when the number of instances is increased compared with CCL. Key words: clustering analysis; constrained clustering; semi-supervised learning; background knowledge; machine
8
UCI Repository of machine learning databases
Catherine Blake · Medical Entomology and Zoology · 1998 · 10.5K citations
Constrained K-means Clustering with Background Knowledge
Kiri L. Wagstaff, Claire Cardie, Seth Rogers et al. · 2001 · 2.4K citations
Semi-supervised Clustering by Seeding
Sugato Basu, Arindam Banerjee, Raymond J. Mooney · 2002 · 806 citations
Maria Halkidi, Yannis Batistakis, Michalis Vazirgiannis · ACM SIGMOD Record · 2002 · 530 citations