By Topic

High dimensional data Clustering Algorithm Based on Sparse Feature Vector for Categorical Attributes

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

2 Author(s)
Sen Wu ; Sch. of Econ. & Manage., Univ. of Sci. & Technol. Beijing, Beijing, China ; Guiying Wei

An algorithm is proposed to cluster high dimensional data named as Clustering Algorithm Based On Sparse Feature Vector for Categorical Attributes (CABOSFV_C). It compresses data effectively by using `Sparse Feature Vector of a Set for Categorical Data' without losing the information necessary for making clustering decisions, and can get the clustering result with once data scan by defining `Sparse Feature Dissimilarity of a Set for Categorical Data' as distance measure. Because of the data reduction and once data scan strategy the algorithm has almost linear computation complexity and handles noise effectively. In addition, CABOSFV_C is suitable not only for sparse data but also for complete data, which is illustrated by two numeric examples at the end of the paper as well as other salient features of the algorithm.

Published in:

Logistics Systems and Intelligent Management, 2010 International Conference on  (Volume:2 )

Date of Conference:

9-10 Jan. 2010