By Topic

Cluster validation for subspace clustering on high dimensional data

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

3 Author(s)
Lifei Chen ; School of Mathematics and Computer Science, Fujian Normal University, Fuzhou, 350007, China ; Qingshan Jiang ; Shengrui Wang

As an important issue in cluster analysis, cluster validation is the process of evaluating performance of clustering algorithms under varying input conditions. Many existing methods address clustering results of low-dimensional data. This paper presents new solution to the problem of cluster validation for subspace clustering on high dimensional data. We first propose two new measurements for the intra-cluster compactness and inter-cluster separation of subspace clusters. Based on these measurements and the conventional indices, three new cluster validity indices that can be applied to subspace clustering are presented. Combining with a soft subspace clustering algorithm, the new indices are used to determine the number of clusters in high dimensional data. The experimental results on synthetic and real world datasets have shown their effectiveness.

Published in:

Circuits and Systems, 2008. APCCAS 2008. IEEE Asia Pacific Conference on

Date of Conference:

Nov. 30 2008-Dec. 3 2008