DocumentCode :
2710126
Title :
INSCY: Indexing Subspace Clusters with In-Process-Removal of Redundancy
Author :
Assent, Ira ; Krieger, Ralph ; Muller, E. ; Seidl, Thomas
Author_Institution :
Data Manage. & Exploration Group, RWTH Aachen Univ., Aachen
fYear :
2008
fDate :
15-19 Dec. 2008
Firstpage :
719
Lastpage :
724
Abstract :
Subspace clustering aims at detecting clusters in any subspace projection of a high dimensional space. As the number of projections is exponential in the number of dimensions, efficiency is crucial. Moreover, the resulting subspace clusters are often highly redundant, i.e. many clusters are detected multiply in several projections. We propose a novel index for efficient subspace clustering in a novel depth-first processing with in-process-removal of redundant clusters for better pruning. Thorough experiments on real and synthetic data show that INSCY yields substantial efficiency and quality improvements.
Keywords :
data mining; database indexing; pattern clustering; tree searching; INSCY mining; depth-first processing; high dimensional space; in-process redundancy removal; subspace cluster indexing; subspace projection; Clustering algorithms; Conference management; Data mining; Databases; Indexing; Kernel; Lattices; Noise reduction; Project management; Runtime; depth-first processing; high dimensional data; redundancy removal; subspace clustering;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Mining, 2008. ICDM '08. Eighth IEEE International Conference on
Conference_Location :
Pisa
ISSN :
1550-4786
Print_ISBN :
978-0-7695-3502-9
Type :
conf
DOI :
10.1109/ICDM.2008.46
Filename :
4781168
Link To Document :
بازگشت