Condorcet’s jury theorem for consensus clustering

2Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Condorcet’s Jury Theorem has been invoked for ensemble classifiers to indicate that the combination of many classifiers can have better predictive performance than a single classifier. Such a theoretical underpinning is unknown for consensus clustering. This article extends Condorcet’s Jury Theorem to the mean partition approach under the additional assumptions that a unique but unknown ground-truth partition exists and sample partitions are drawn from a sufficiently small ball containing the ground-truth.

Cite

CITATION STYLE

APA

Jain, B. (2018). Condorcet’s jury theorem for consensus clustering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11117 LNAI, pp. 155–168). Springer Verlag. https://doi.org/10.1007/978-3-030-00111-7_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free