| Genetic-guided semi-supervised clustering algorithm with instance-level constraints |
| Full text |
Pdf
(473 KB)
|
Source
|
Genetic And Evolutionary Computation Conference
archive
Proceedings of the 10th annual conference on Genetic and evolutionary computation
table of contents
Atlanta, GA, USA
SESSION: Genetics-based machine learning and learning classifier systems papers
table of contents
Pages 1381-1388
Year of Publication: 2008
ISBN:978-1-60558-130-9
|
|
Authors
|
|
Yi Hong
|
City University of Hong Kong, Hong Kong
|
|
Sam Kwong
|
City University of Hong Kong, Hong Kong
|
|
Hui Xiong
|
Rutgers University, NJ, USA
|
|
Qingsheng Ren
|
Shanghai Jiao Tong University, Shanghai, China
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 12, Downloads (12 Months): 117, Citation Count: 0
|
|
|
ABSTRACT
Semi-supervised clustering with instance-level constraints is one of the most active research topics in the areas of pattern recognition, machine learning and data mining. Several recent studies have shown that instance-level constraints can significantly increase accuracies of a variety of clustering algorithms. However, instance-level constraints may split the search space of the optimal clustering solution into pieces, thus significantly compound the difficulty of the search task. This paper explores a genetic approach to solve the problem of semi-supervised clustering with instance-level constraints. In particular, a novel semi-supervised clustering algorithm with instance-level constraints, termed as the hybrid genetic-guided semi-supervised clustering algorithm with instance-level constraints (Cop-HGA), is proposed. Cop-HGA uses a hybrid genetic algorithm to perform the search task of a high quality clustering solution that is able to draw a good balance between predefined clustering criterion and available instance-level background knowledge. The effectiveness of Cop-HGA is confirmed by experimental results on several real data sets with artificial instance-level constraints.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
K. Wagstaff. Intelligent Clustering with Instance-Level Constraints. Department of Computer Science and Engineering, Cornell University, 2002.
|
| |
3
|
M. Law. Clustering, Dimensionality Reduction, and Side Information. Department of Computer Science and Engineering, Michigan State University, 2006.
|
| |
4
|
|
| |
5
|
|
| |
6
|
|
| |
7
|
Z. Lu and T.K. Leen. Semi-supervised learning with penalized probabilistic clustering. In Advances in Neural Information Processing Systems, 2005.
|
 |
8
|
|
| |
9
|
E.P. Xing, A. Y. Ng, M.I. Jordan, and S. Russell. Distance metrix learning with application to clustering with side-information. In Advances in Neural Information Processing Systems, pages 505--512, 2002.
|
| |
10
|
S. Basu and I. Davidson. Clustering with constraints: Theory and practice. In ACM KDD2006 Tutorials, 2006.
|
| |
11
|
Y. Hong and S. Kwong. Learning assignment order of instances for constrained k-means clustering algorithm. IEEE Transactions on System, Man and Cybernetics, Part B, Under Review.
|
 |
12
|
Yi Hong , Sam Kwong , Hui Xiong , Qingsheng Ren, Data clustering using virtual population based incremental learning algorithm with similarity matrix encoding strategy, Proceedings of the 10th annual conference on Genetic and evolutionary computation, July 12-16, 2008, Atlanta, GA, USA
[doi> 10.1145/1389095.1389183]
|
| |
13
|
C. Blake and C. Merz. UCI Machine Learning Repository. http://www.ics.uci.edu/mlearn/MLRepository.html, 1998.
|
| |
14
|
W.M. Rand. Objective criterion for the evaluation of clustering methods. Journal of Americal Statistical Association, 66:846--850, 1970.
|
| |
15
|
K. Krishna and M. Murty. Genetic k-means algorithm. IEEE Transactions on System, Man, and Cybernetics-Part B, 29:433--439, 1999.
|
|