Mining quantitative frequent itemsets using adaptive density-based subspace clustering
暂无分享,去创建一个
[1] Yi Zhang,et al. Entropy-based subspace clustering for mining numerical data , 1999, KDD '99.
[2] Philip S. Yu,et al. Redefining Clustering for High-Dimensional Applications , 2002, IEEE Trans. Knowl. Data Eng..
[3] Hans-Peter Kriegel,et al. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.
[4] Ramakrishnan Srikant,et al. Mining quantitative association rules in large relational tables , 1996, SIGMOD '96.
[5] Philip S. Yu,et al. Clustering through decision tree construction , 2000, CIKM '00.
[6] Dimitrios Gunopulos,et al. Automatic subspace clustering of high dimensional data for data mining applications , 1998, SIGMOD '98.
[7] T. M. Murali,et al. A Monte Carlo algorithm for fast projective clustering , 2002, SIGMOD '02.
[8] Hans-Peter Kriegel,et al. Density-Connected Subspace Clustering for High-Dimensional Data , 2004, SDM.
[9] Kyuseok Shim,et al. Mining optimized association rules with categorical and numeric attributes , 1998, Proceedings 14th International Conference on Data Engineering.
[10] Ramakrishnan Srikant,et al. Fast algorithms for mining association rules , 1998, VLDB 1998.
[11] Raymond Chi-Wing Wong,et al. Projective clustering by histograms , 2005, IEEE Transactions on Knowledge and Data Engineering.
[12] Ke Wang,et al. Interestingness-Based Interval Merger for Numeric Association Rules , 1998, KDD.
[13] Robert Meersman,et al. On the Complexity of Mining Quantitative Association Rules , 1998, Data Mining and Knowledge Discovery.
[14] Philip S. Yu,et al. Fast algorithms for projected clustering , 1999, SIGMOD '99.
[15] Mohammed J. Zaki,et al. SCHISM: a new approach for interesting subspace mining , 2004, Fourth IEEE International Conference on Data Mining (ICDM'04).