The instance easiness of supervised learning for cluster validity

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

Abstract

"The statistical problem of testing cluster validity is essentially unsolved" [5]. We translate the issue of gaining credibility on the output of un-supervised learning algorithms to the supervised learning case. We introduce a notion of instance easiness to supervised learning and link the validity of a clustering to how its output constitutes an easy instance for supervised learning. Our notion of instance easiness for supervised learning extends the notion of stability to perturbations (used earlier for measuring clusterability in the un-supervised setting). We follow the axiomatic and generic formulations for cluster-quality measures. As a result, we inform the trust we can place in a clustering result using standard validity methods for supervised learning, like cross validation. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Estivill-Castro, V. (2012). The instance easiness of supervised learning for cluster validity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7104 LNAI, pp. 197–208). https://doi.org/10.1007/978-3-642-28320-8_17

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