2008
DOI: 10.1007/978-3-540-85930-7_66
|View full text |Cite
|
Sign up to set email alerts
|

Minimization of the Disagreements in Clustering Aggregation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2010
2010
2017
2017

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…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%
See 1 more Smart Citation
“…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%