A projective clustering algorithm based on significant local dense areas

Yu, Z, Xu, G, Jin, P, Yi, X, Chen, E and Wu, Z 2012, 'A projective clustering algorithm based on significant local dense areas', in 2012 Annual International Joint Conference on Neural Networks, IJCNN 2012, Brisbane, Australia, 10 - 15 June 2012, pp. 1-8.


Document type: Conference Paper
Collection: Conference Papers

Title A projective clustering algorithm based on significant local dense areas
Author(s) Yu, Z
Xu, G
Jin, P
Yi, X
Chen, E
Wu, Z
Year 2012
Conference name 2012 Annual International Joint Conference on Neural Networks, IJCNN 2012
Conference location Brisbane, Australia
Conference dates 10 - 15 June 2012
Proceedings title 2012 Annual International Joint Conference on Neural Networks, IJCNN 2012
Publisher IEEE
Place of publication United States
Start page 1
End page 8
Total pages 8
Abstract High dimensional clustering is often encountered in real application and projective clustering is an effective way to deal with high dimensional clustering problems aiming to capture the dense areas embedded in subsets of attributes/subspaces. Most projective clustering algorithms use equal or varying width hyper-rectangle structure to identify the dense areas and their locations. Therefore, it is a crucial task to decide the widths of these hyper-rectangle structures in projective clustering. Naturally, making use of the real data distribution directly to determine the widths of the dense structures is a promising and feasible approach. In this paper, we propose a projective clustering algorithm based on hyper-rectangle structure, whose width is estimated from the kernel distribution of real data. In particular, we first define a structure called Significant Local Dense Area (SLDA) structure by using an efficient kernel density estimator, Rodeo; and then design a greedy search method to find the whole SLDAs covered the data distribution in the high-dimensional space; eventually, we run a single-linkage clustering algorithm on the SLDAs to form the final clusters and identify the outliers. The main strength of the proposed algorithm is validated by the experiments on synthetic and real world data sets.
Keyword(s) Data distribution
Dense structures
Greedy search methods
High dimensional spaces
High-dimensional clustering
Kernel density estimators
Kernel distribution
Projective clustering
Real applications
Real world data
DOI - identifier 10.1109/IJCNN.2012.6252668
Copyright notice © 2012 IEEE
ISSN 2161-4393
Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 1 times in Scopus Article | Citations
Altmetric details:
Access Statistics: 98 Abstract Views  -  Detailed Statistics
Created: Thu, 15 Jan 2015, 08:26:00 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us