2012 IEEE 12th International Conference on Data Mining 2012
DOI: 10.1109/icdm.2012.123
|View full text |Cite
|
Sign up to set email alerts
|

Robust Ensemble Clustering by Matrix Completion

Abstract: Abstract-Data clustering is an important task and has found applications in numerous real-world problems. Since no single clustering algorithm is able to identify all different types of cluster shapes and structures, ensemble clustering was proposed to combine different partitions of the same data generated by multiple clustering algorithms. The key idea of most ensemble clustering algorithms is to find a partition that is consistent with most of the available partitions of the input data. One problem with the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
65
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 67 publications
(65 citation statements)
references
References 31 publications
0
65
0
Order By: Relevance
“…Another strategy is to use a different clustering algorithm for each member [12,45] with a hope that different algorithms may generate more diverse members. Yi et al [45] used some well-known clustering algorithms, such as hierarchical clustering and k-means.…”
Section: Ensemble Member Generationmentioning
confidence: 99%
See 1 more Smart Citation
“…Another strategy is to use a different clustering algorithm for each member [12,45] with a hope that different algorithms may generate more diverse members. Yi et al [45] used some well-known clustering algorithms, such as hierarchical clustering and k-means.…”
Section: Ensemble Member Generationmentioning
confidence: 99%
“…Yi et al [45] used some well-known clustering algorithms, such as hierarchical clustering and k-means. Gionis et al [12] used the single, average, ward and complete linkage methods and k-means to generate ensemble members.…”
Section: Ensemble Member Generationmentioning
confidence: 99%
“…We also performed a paired -test to assess the statistical significance of the results; the significance level was always set to 0.05. We compare the proposed WOEC methods against eight state-of-the-art ensemble clustering algorithms, namely: CSPA [2], MCLA [2], HBGF [16], BCE [19], WCC [21], ECMC [22], WSPA [3], [4] and WBPA [3], [4]. (HGPA [2] was not included in our experiments since it typically performs worse than CSPA and MCLA.…”
Section: Results and Analysismentioning
confidence: 99%
“…More recently, a method called ensemble clustering by matrix completion (ECMC) was proposed [22]. ECMC uses the reliable pair of objects to construct a partially observed co-association matrix, and exploits the matrix completion algorithm to replenish the missing entries of the co-association matrix.…”
Section: Introductionmentioning
confidence: 99%
“…Ensemble clustering is an active machine learning research area (Yi et al 2012). However, the literature shows that few research efforts have used ensemble clustering algorithms in scientometrics to analyze scientific structure.…”
Section: Ensemble Clusteringmentioning
confidence: 99%