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.
CITATION STYLE
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
Mendeley helps you to discover research relevant for your work.