Journal
KNOWLEDGE-BASED SYSTEMS
Volume 23, Issue 8, Pages 883-889Publisher
ELSEVIER
DOI: 10.1016/j.knosys.2010.06.003
Keywords
Constrained clustering; Size constraints; Linear programming; Data mining; Background knowledge
Categories
Funding
- Natural Science Foundation of Fujian Province [2010J01353]
- Ministry of Education of China at Fuzhou University [201001]
Ask authors/readers for more resources
Data clustering is an important and frequently used unsupervised learning method. Recent research has demonstrated that incorporating instance-level background information to traditional clustering algorithms can increase the clustering performance. In this paper, we extend traditional clustering by introducing additional prior knowledge such as the size of each cluster. We propose a heuristic algorithm to transform size constrained clustering problems into integer linear programming problems. Experiments on both synthetic and UCI datasets demonstrate that our proposed approach can utilize cluster size constraints and lead to the improvement of clustering accuracy. (C) 2010 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available