A tolerance concept in data clustering

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

Abstract

This paper introduces the concept of tolerance space as an abstract model of data clustering. The similarity in the model is represented by a relation with both reflexivity and symmetry, called a tolerance relation. Three types of clusterings based on a tolerance relation are introduced: maximal complete similarity clustering, representative clustering, and closure clustering. This paper also discusses experiments on unsupervised learning, in which Hamming distance is used to define a family of tolerance relations. © Springer-Verlag 2003.

Cite

CITATION STYLE

APA

Sun, F. S., & Tzeng, C. H. (2004). A tolerance concept in data clustering. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2690, 345–352. https://doi.org/10.1007/978-3-540-45080-1_45

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