A Generic Framework for Efficient Subspace Clustering of High-Dimensional Data
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Deriving quantitative models for correlation clusters
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Pleiades: Subspace Clustering and Evaluation
ECML PKDD '08 Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II
ACM Transactions on Knowledge Discovery from Data (TKDD)
Subspace and projected clustering: experimental evaluation and analysis
Knowledge and Information Systems
Detection and visualization of subspace cluster hierarchies
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Mining representative subspace clusters in high-dimensional data
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 1
Towards subspace clustering on dynamic data: an incremental version of PreDeCon
Proceedings of the First International Workshop on Novel Data Stream Pattern Mining Techniques
Mining relaxed closed subspace clusters
Proceedings of the 48th Annual Southeast Regional Conference
Novel data stream pattern mining report on the StreamKDD'10 workshop
ACM SIGKDD Explorations Newsletter
Advancing data clustering via projective clustering ensembles
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Density based subspace clustering over dynamic data
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Finding hierarchies of subspace clusters
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
A simple feature extraction for high dimensional image representations
SLSFS'05 Proceedings of the 2005 international conference on Subspace, Latent Structure and Feature Selection
Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery
Density-Based projected clustering of data streams
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Projective clustering ensembles
Data Mining and Knowledge Discovery
Interactive data mining with 3D-parallel-coordinate-trees
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Twitter spammer detection using data stream clustering
Information Sciences: an International Journal
| Hi-index | 0.00 |
Many clustering algorithms tend to break down in high-dimensional feature spaces, because the clusters often exist only in specific subspaces (attribute subsets) of the original feature space. Therefore, the task of projected clustering (or subspace clustering) has been defined recently. As a novel solution to tackle this problem, we propose the concept of local subspace preferences, which captures the main directions of high point density. Using this concept we adopt density-based clustering to cope with high-dimensional data. In particular, we achieve the following advantages over existing approaches: Our proposed method has a determinate result, does not depend on the order of processing, is robust against noise, performs only one single scan over the database, and is linear in the number of dimensions. A broad experimental evaluation shows that our approach yields results of significantly better quality than recent work on clustering high-dimensional data.