A new clustering strategy is proposed based on interval sets, which is an alternative formulation different from the ones used in the existing studies. Instead of using a single set as the representation of a cluster, each cluster is represented by an interval set that is defined by a pair of sets called the lower and upper bounds. Elements in the lower bound are typical elements of the cluster and elements between the upper and lower bounds are fringe elements of the cluster. A cluster is therefore more realistically characterized by a set of core elements and a set of boundary elements. Two types of interval set clusterings are proposed, one is non-overlapping lower bound interval set clustering and the other is overlapping lower bound interval set clusterings, corresponding to the standard partition based and covering based clusterings. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Yao, Y., Lingras, P., Wang, R., & Miao, D. (2009). Interval set cluster analysis: A re-formulation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5908 LNAI, pp. 398–405). https://doi.org/10.1007/978-3-642-10646-0_48
Mendeley helps you to discover research relevant for your work.