SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Automatic subspace clustering of high dimensional data for data mining applications
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Fast algorithms for projected clustering
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Finding generalized projected clusters in high dimensional spaces
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
ROCK: a robust clustering algorithm for categorical attributes
Information Systems
A Monte Carlo algorithm for fast projective clustering
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
When Is ''Nearest Neighbor'' Meaningful?
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Iterative Projected Clustering by Subspace Mining
IEEE Transactions on Knowledge and Data Engineering
ExAnte: A Preprocessing Method for Frequent-Pattern Mining
IEEE Intelligent Systems
Projective clustering using itemset discovery for multi-dimensional data analysis
MS'06 Proceedings of the 17th IASTED international conference on Modelling and simulation
Soft constraint based pattern mining
Data & Knowledge Engineering
ACM Transactions on Knowledge Discovery from Data (TKDD)
Evaluating clustering in subspace projections of high dimensional data
Proceedings of the VLDB Endowment
Proceedings of the 14th International Conference on Extending Database Technology
Tracing evolving clusters by subspace and value similarity
PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part II
An extension of the PMML standard to subspace clustering models
Proceedings of the 2011 workshop on Predictive markup language modeling
Efficient selectivity estimation by histogram construction based on subspace clustering
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Scalable density-based subspace clustering
Proceedings of the 20th ACM international conference on Information and knowledge management
External evaluation measures for subspace clustering
Proceedings of the 20th ACM international conference on Information and knowledge management
Tracing Evolving Subspace Clusters in Temporal Climate Data
Data Mining and Knowledge Discovery
Pushing constraints to detect local patterns
LPD'04 Proceedings of the 2004 international conference on Local Pattern Detection
A relational query primitive for constraint-based pattern mining
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
Mining of temporal coherent subspace clusters in multivariate time series databases
PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I
Sensitivity of self-tuning histograms: query order affecting accuracy and robustness
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
| Hi-index | 0.00 |
Irrelevant attributes add noise to high dimensional clustersand make traditional clustering techniques inappropriate.Projected clustering algorithms have been proposed to findthe clusters in hidden subspaces. We realize the analogy betweenmining frequent itemsets and discovering the relevantsubspace for a given cluster. We propose a methodology forfinding projected clusters by mining frequent itemsets andpresent heuristics that improve its quality. Our techniquesare evaluated with synthetic and real data; they are scalableand discover projected clusters accurately.