2011
DOI: 10.1016/j.patcog.2010.09.008
|View full text |Cite
|
Sign up to set email alerts
|

Combining multiple clusterings using similarity graph

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
30
0

Year Published

2012
2012
2018
2018

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 75 publications
(30 citation statements)
references
References 11 publications
0
30
0
Order By: Relevance
“…The CA matrix is a classical and widely used tool for dealing with the ensemble clustering problem [20], [24], [28], [49]. Despite the significant success, one limitation of the CA matrix is that it treats all clusters and all base clusterings in the ensemble equally and lack the ability to evaluate and weight the ensemble members w.r.t.…”
Section: Refining Co-association Matrix By Local Weightingmentioning
confidence: 99%
“…The CA matrix is a classical and widely used tool for dealing with the ensemble clustering problem [20], [24], [28], [49]. Despite the significant success, one limitation of the CA matrix is that it treats all clusters and all base clusterings in the ensemble equally and lack the ability to evaluate and weight the ensemble members w.r.t.…”
Section: Refining Co-association Matrix By Local Weightingmentioning
confidence: 99%
“…This problem has been studied by many researchers in data mining and many contributions have been developed to¯nd MCDA Clustering Approach Based on Clustering Ensemble 819 consensus clustering such as: hyper graph partitioning, 7 voting approach, [38][39][40][41][42][43][44][45][46][47][48][49] quadratic mutual information algorithm 5 and distance-based methods. 38 Optimization techniques have been also explored to solve the problem of clustering ensemble; Hornik and B€ ohm.…”
Section: Related Work In Clustering Ensemblementioning
confidence: 99%
“…This work has been extended to de¯ne relations between the clusters. [40][41][42][43][44][45][46][47][48][49][50] The problem of de¯ning relations between clusters has been also tackled in Ref. 34 where a formalization of the problem has been proposed using the preference relations.…”
Section: Introductionmentioning
confidence: 99%
“…Similarity Within Cluster (SWC), or compactness, is the measure of how similar the objects inside a cluster [2]. Similarity Within Cluster Ci, which is pictured in Fig.4, is calculated as shown in …”
Section: Swc (Similarity Within Cluster)mentioning
confidence: 99%