By Topic

Discovering the Skyline of Subspace Clusters in 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

4 Author(s)
Guanhua Chen ; Sch. of Electron. Eng. & Comput. Sci., Peking Univ., Beijing ; Xiuli Ma ; Dongqing Yang ; Shiwei Tang

Subspace clustering on high-dimensional datasets may often result in an undesirably large set of clusters due to the huge amount of possible subspaces. Such a large set of subspace clusters not only raises the cost of computation, but also weaken the understandability of the results. Both of the two problems reduce the usability of the subspace clustering in the real applications. In this paper, we propose a new approach of applying skyline query into the subspace clustering process, for avoiding redundant subspace clusters by the dominating relationship, which is characterized as mining the skyline of subspace clusters. Two algorithms, SkyClu-CBC and SkyClu-IBC, are proposed. Experiments on real and synthetic datasets are carried out to show the effectiveness and efficiency of the proposed methods.

Published in:

Fuzzy Systems and Knowledge Discovery, 2008. FSKD '08. Fifth International Conference on  (Volume:2 )

Date of Conference:

18-20 Oct. 2008