DocumentCode
2488893
Title
Active query selection for semi-supervised clustering
Author
Mallapragada, P.K. ; Jin, Rong ; Jain, Anil K.
Author_Institution
Dept. of Comput. Sci. & Eng., Michigan State Univ., East Lansing, MI
fYear
2008
fDate
8-11 Dec. 2008
Firstpage
1
Lastpage
4
Abstract
Semi-supervised clustering allows a user to specify available prior knowledge about the data to improve the clustering performance. A common way to express this information is in the form of pair-wise constraints. A number of studies have shown that, in general, these constraints improve the resulting data partition. However, the choice of constraints is critical since improperly chosen constraints might actually degrade the clustering performance. We focus on constraint (also known as query) selection for improving the performance of semi-supervised clustering algorithms. We present an active query selection mechanism, where the queries are selected using a min-max criterion. Experimental results on a variety of datasets, using MPCK-means as the underlying semi-clustering algorithm, demonstrate the superior performance of the proposed query selection procedure.
Keywords
learning (artificial intelligence); minimax techniques; pattern clustering; query processing; active query selection mechanism; min-max criterion; pair-wise constraint; semi-supervised clustering algorithm; Clustering algorithms; Computer science; Data engineering; Degradation; Knowledge engineering; Partitioning algorithms; Semisupervised learning; Skeleton; Terminology; Unsupervised learning;
fLanguage
English
Publisher
ieee
Conference_Titel
Pattern Recognition, 2008. ICPR 2008. 19th International Conference on
Conference_Location
Tampa, FL
ISSN
1051-4651
Print_ISBN
978-1-4244-2174-9
Electronic_ISBN
1051-4651
Type
conf
DOI
10.1109/ICPR.2008.4761792
Filename
4761792
Link To Document