Interval Set Cluster Analysis: A Re-formulation

Authors:
Yiyu Yao;Pawan Lingras;Ruizhi Wang;Duoqian Miao
Affiliations:
Department of Computer Science, University of Regina, Regina, Canada S4S 0A2;Department of Mathematics and Computing Science, Saint Mary's University, Halifax, Canada B3H 3C3;Department of Computer Science and Technology, The Key Laboratory of Embedded System and Service Computing, Tongji University, Shanghai, P.R. China 201804;Department of Computer Science and Technology, The Key Laboratory of Embedded System and Service Computing, Tongji University, Shanghai, P.R. China 201804
Venue:
RSFDGrC '09 Proceedings of the 12th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
Year:
2009

Citing 7
Cited 1

A decision theoretic framework for approximating concepts

International Journal of Man-Machine Studies
Contributions to the theory of rough sets

Fundamenta Informaticae
Interval-Set Algebra for Qualitative Knowledge Representation

ICCI '93 Proceedings of the Fifth International Conference on Computing and Information
Interval Set Clustering of Web Users with Rough K-Means

Journal of Intelligent Information Systems
Interval set clustering of web users using modified Kohonen self-organizing maps based on the properties of rough sets

Web Intelligence and Agent Systems
Probabilistic rough set approximations

International Journal of Approximate Reasoning
Temporal analysis of clusters of supermarket customers: conventional versus interval set approach

Information Sciences: an International Journal

Qualitative and quantitative combinations of crisp and rough clustering schemes using dominance relations

International Journal of Approximate Reasoning

Quantified Score

Hi-index	0.02

Visualization

Abstract

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.