By Topic

A novel subspace clustering algorithm with dimensional density

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

3 Author(s)
Wangfei Huang ; Software Sch., Xiamen Univ., Xiamen, China ; Lifei Chen ; Qingshan Jiang

When clustering data of high dimension, most of the existing algorithms cannot reach people's expectation due to the curse of dimensionality. In high-dimensional space, clusters are often hidden in subspaces of the attributes. The distribution of clusters is dense in the subspace and each attribute of the subspace. So objects belonged to the same subspace have similar density on each attribute. Based on this idea a novel subspace clustering algorithm SC2D is proposed. By introducing the definition of dimensional density, SC2D puts objects into the same cluster if they have similar dimensional density. And then clusters are separated from each other if there are more than one cluster in the same subspace. Experiments on both artificial and real-world data have demonstrated that SC2D algorithm can achieve desired results.

Published in:

Future Computer and Communication (ICFCC), 2010 2nd International Conference on  (Volume:3 )

Date of Conference:

21-24 May 2010