Name
Abstract | ||
|---|---|---|
Semi-supervised clustering algorithms partition a given data set using limited supervision from the user. In this paper, we propose a clustering algorithmthat uses supervision in terms of relative comparisons, viz., is closer to than to . The success of a clustering algorithm also depends on the kind of dissimilarity measure. The proposed clustering algorithm learns the underlying dissimilarity measure while finding compact clusters in the given data set. Through our experimental studies on high-dimensional textual data sets, we demonstrate that the proposed algorithm achieves higher accuracy than the algorithms using pairwise constraints for supervision. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/ICDM.2005.128 | ICDM |
Keywords | Field | DocType |
semi-supervised clustering,compact cluster,relative comparisons,proposed clustering algorithm,high-dimensional textual data set,proposed algorithm,underlying dissimilarity measure,limited supervision,dissimilarity measure,semi-supervised clustering algorithm,clustering algorithm,clustering algorithmthat,metric learning,learning artificial intelligence | Fuzzy clustering,Data mining,CURE data clustering algorithm,Computer science,Artificial intelligence,Cluster analysis,Single-linkage clustering,Canopy clustering algorithm,Data stream clustering,Pattern recognition,Correlation clustering,Determining the number of clusters in a data set,Machine learning | Conference |
ISBN | Citations | PageRank |
0-7695-2278-5 | 14 | 0.79 |
References | Authors | |
10 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nimit Kumar | 1 | 79 | 4.33 |
| Krishna Kummamuru | 2 | 353 | 20.78 |
| Deepa Paranjpe | 3 | 160 | 9.39 |