A novel multiseed nonhierarchical data clustering technique
Authors:
- D. ChaudhuriDCD. Chaudhuri
- B.B. ChaudhuriBCB.B. Chaudhuri
- 1 September 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
- Vol. 27 (5) , 871-876
Abstract
Clustering techniques such as K-means and Forgy as well as their improved version ISODATA group data around one seed point for each cluster, It is well known that these methods do not work well if the shape of the cluster is elongated or nonconvex. We argue that for a elongated or nonconvex shaped cluster, more than one seed is needed, In this paper a multiseed clustering algorithm is proposed. A density based representative point selection algorithm is used to choose the initial seed points. To assign several seed points to one cluster, a minimal spanning tree guided novel technique is proposed. Also, a border point detection algorithm is proposed for the detection of shape of the cluster. This border in turn signifies whether the cluster is elongated or not, Experimental results show the efficiency of this clustering technique.Keywords
This publication has 13 references indexed in Scilit:
- A data driven procedure for density estimation with some applicationsPattern Recognition, 1996
- Finding a subset of representative points in a data setIEEE Transactions on Systems, Man, and Cybernetics, 1994
- A new split-and-merge clustering techniquePattern Recognition Letters, 1992
- Bootstrap technique in cluster analysisPattern Recognition, 1987
- Representing Points in Many Dimensions by Trees and Castles: RejoinderJournal of the American Statistical Association, 1981
- Clustering Methodologies in Exploratory Data Analysis1980
- Validity studies in clustering methodologiesPattern Recognition, 1979
- A Probability Theory of Cluster AnalysisJournal of the American Statistical Association, 1973
- Graph-Theoretical Methods for Detecting and Describing Gestalt ClustersIEEE Transactions on Computers, 1971
- 256. Note: An Algorithm for Hierarchical Classifications1969