Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

Class compactness for data clustering

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
$31 $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

1 Author(s)
Yuqing Song ; Key Lab. of Intell. Inf. Process., Chinese Acad. of Sci., Beijing, China

In this paper we introduce a compactness based clustering algorithm. The compactness of a data class is measured by comparing the inter-subset and intra-subset distances. The class compactness of a subset is defined as the ratio of the two distances. A subset is called an isolated cluster (or icluster) if its class compactness is greater than 1. All iclusters make a containment tree. We introduce monotonic sequences of iclusters to simplify the structure of the icluster tree, based on which a clustering algorithm is designed. The algorithm has the following advantages: it is effective on data sets with clusters nonlinearly separated, of arbitrary shapes, or of different densities. The effectiveness of the algorithm is demonstrated by experiments.

Published in:

Information Reuse and Integration (IRI), 2010 IEEE International Conference on

Date of Conference:

4-6 Aug. 2010