Clustering Ensemble Algorithm

From GM-RKB
(Redirected from Clustering Ensembles)
Jump to navigation Jump to search

A Clustering Ensemble Algorithm is a clustering algorithm that is an ensembling algorithm (which produces a clustering ensemble).



References

2011

2005

2004

  • (Topchy et al., 2004) ⇒ Alexander Topchy, Behrouz Minaei-Bidgoli, Anil K. Jain, and William F. Punch. (2004). “Adaptive Clustering Ensembles.” In: Proceedings of the 17th International Conference on Pattern Recognition, (ICPR 2004).
    • Exploratory data analysis and, in particularly, data clustering can significantly benefit from combining multiple data partitions. Clustering ensembles can offer better solutions in terms of robustness, novelty and stability [1, 2, 3]. Moreover, their parallelization capabilities can be naturally used in distributed data mining.

2003

  • (Topchy et al., 2003) ⇒ A. Topchy, A.K. Jain, and W. Punch. (2003). “Combining Multiple Weak Clusterings.” In: Proceedings3d IEEE Intl. Conference on Data Mining.

2002