By Topic

A multi-prototype clustering algorithm based on minimum spanning tree

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ting Luo ; College of Science and Technology, Ningbo University, China ; Caiming Zhong ; Hong Li ; Xia Sun

Many existing clustering algorithms use a single prototype to represent a cluster. However sometimes it is very difficult to find a suitable prototype for representing a cluster with an arbitrary shape. One possible solution is to employ multi-prototype instead. In this paper, we propose a minimum spanning tree (MST) based multi-prototype clustering algorithm. It is a split and merge scheme. In the split stage, the suitable patterns are determined to be prototypes in terms of their degrees in the corresponding MST. Then the fake prototypes in sparse density regions are recognized and removed. In the merge stage, a two-step merge strategy is designed to group the prototypes. The proposed algorithm can deal with datasets consisting of clusters with different shapes, sizes and densities. The experiment results show the effectiveness on the synthetic and real datasets.

Published in:

Fuzzy Systems and Knowledge Discovery (FSKD), 2010 Seventh International Conference on  (Volume:4 )

Date of Conference:

10-12 Aug. 2010