Relevant overlapping subspace clusters on categorical data
暂无分享,去创建一个
[1] Ira Assent,et al. CLICKS: an effective algorithm for mining subspace clusters in categorical datasets , 2005, KDD '05.
[2] Vivekanand Gopalkrishnan,et al. Towards efficient mining of proportional fault-tolerant frequent itemsets , 2009, KDD.
[3] Jilles Vreeken,et al. Tell me what i need to know: succinctly summarizing data with itemsets , 2011, KDD.
[4] Renée J. Miller,et al. LIMBO: Scalable Clustering of Categorical Data , 2004, EDBT.
[5] Jorma Rissanen,et al. Information and Complexity in Statistical Modeling , 2006, ITW.
[6] Tijl De Bie,et al. An Information-Theoretic Approach to Finding Informative Noisy Tiles in Binary Databases , 2010, SDM.
[7] Bart Goethals,et al. Tiling Databases , 2004, Discovery Science.
[8] Elke Achtert,et al. ELKI: A Software System for Evaluation of Subspace Clustering Algorithms , 2008, SSDBM.
[9] Qiang Fu,et al. Bayesian Overlapping Subspace Clustering , 2009, 2009 Ninth IEEE International Conference on Data Mining.
[10] Yang Xiang,et al. Summarizing transactional databases with overlapped hyperrectangles , 2011, Data Mining and Knowledge Discovery.
[11] Ira Assent,et al. Relevant Subspace Clustering: Mining the Most Interesting Non-redundant Concepts in High Dimensional Data , 2009, 2009 Ninth IEEE International Conference on Data Mining.
[12] Vipin Kumar,et al. Similarity Measures for Categorical Data: A Comparative Evaluation , 2008, SDM.
[13] Johannes Gehrke,et al. CACTUS—clustering categorical data using summaries , 1999, KDD '99.
[14] Joydeep Ghosh,et al. Model-based overlapping clustering , 2005, KDD '05.
[15] Hans-Peter Kriegel,et al. Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering , 2009, TKDD.
[16] Tengke Xiong,et al. A New MCA-Based Divisive Hierarchical Algorithm for Clustering Categorical Data , 2009, 2009 Ninth IEEE International Conference on Data Mining.
[17] Jianhong Wu,et al. Subspace clustering for high dimensional categorical data , 2004, SKDD.
[18] Carsten Lund,et al. On the hardness of approximating minimization problems , 1994, JACM.
[19] Yi Li,et al. COOLCAT: an entropy-based algorithm for categorical clustering , 2002, CIKM '02.
[20] Eugenio Cesario,et al. Top-Down Parameter-Free Clustering of High-Dimensional Categorical Data , 2007, IEEE Transactions on Knowledge and Data Engineering.
[21] Joshua Zhexue Huang,et al. A Fast Clustering Algorithm to Cluster Very Large Categorical Data Sets in Data Mining , 1997, DMKD.
[22] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[23] Sudipto Guha,et al. ROCK: a robust clustering algorithm for categorical attributes , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).
[24] Jilles Vreeken,et al. Krimp: mining itemsets that compress , 2011, Data Mining and Knowledge Discovery.
[25] Dimitrios Gunopulos,et al. Automatic subspace clustering of high dimensional data for data mining applications , 1998, SIGMOD '98.
[26] Jörg Sander,et al. Finding non-redundant, statistically significant regions in high dimensional data: a novel approach to projected and subspace clustering , 2008, KDD.