Synonyms
Definition
In Consensus Clustering we are given a set of n objects V, and a set of m clusterings {C1, C2, …, C m } of the objects in V. The aim is to find a single clustering C that disagrees least with the input clusterings, that is, C minimizes
for some metric d on clusterings of V. Meilă (2003) proposed the principled variation of information metric on clusterings, but it has been difficult to analyze theoretically. The Mirkin metric is the most widely used, in which d(C, C′) is the number of pairs of objects (u, v) that are clustered together in C and apart in C′, or vice versa; it can be calculated in time O(mn).
We can interpret each of the clusterings C i in Consensus Clustering as evidence that pairs ought be put together or separated. That is, w uv i is the number of C i in which C i [u] = C i [v] and w uv − is the number of C...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Science+Business Media New York
About this entry
Cite this entry
(2017). Consensus Clustering. In: Sammut, C., Webb, G.I. (eds) Encyclopedia of Machine Learning and Data Mining. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-7687-1_162
Download citation
DOI: https://doi.org/10.1007/978-1-4899-7687-1_162
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4899-7685-7
Online ISBN: 978-1-4899-7687-1
eBook Packages: Computer ScienceReference Module Computer Science and Engineering