International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 1 A Mathematical Model of Similarity and Clustering Las Vegas, Nevada April 05-April 07 ISBN: 0-7695-2108-8
This paper introduces an abstract model of data similarity and clustering. A similarity on a space Ω is formulated explicitly by a reflexive and symmetric binary relation, called a tolerance relation, for which we introduce three types of coverings of Ω. Given a covering U, a clustering is defined to be minimal sub-covering. To search for an optimal clustering is to minimize the number of clusters, which is intractable in general. This paper proposes a heuristic method to search for sub-optimal clusterings for a given tolerance relation.
Citation:
Fu-Shing Sun, Chun-Hung Tzeng, "A Mathematical Model of Similarity and Clustering," itcc, vol. 1, pp.460, International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 1, 2004 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb