SCHISM: A new approach for interesting subspace mining

Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004

Volumn , Issue , 2004, Pages 186-193

  Sequeira, Karlton ^a   Zaki, Mohammed ^a  

^a Rensselaer Polytechnic Institute   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BACKTRACKING; CLUSTERING; HIGH DIMENSIONAL DATA; INTRUSION DETECTION;

ALGORITHMS; CODES (SYMBOLS); DATABASE SYSTEMS; FUNCTIONS; HEURISTIC METHODS; KNOWLEDGE ENGINEERING;

DATA MINING;

EID: 19544389465     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2004.10099     Document Type: Conference Paper

References (21)

1. C. Aggarwal. Towards systematic design of distance functions for data mining applications. In SIGKDD Conf, 2003.
2. C. Aggarwal, C. Procopiuc, J. Wolf, P. Yu, and J. Park. A framework for finding projected clusters in high dimensional spaces. In SIGMOD Conf, 1999.
3. C. Aggarwal and P. Yu. Finding generalized projected clusters in high-dimensional spaces. In SIGMOD Conf, 2000.
4. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In SIGMOD Conf, 1998.
5. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets ofitems in large databases. In SIGMOD Conf, 1993.
6. F. Alimoglu and E. Alpaydin. Methods of combining multiple classifiers based on different representations for penbased handwriting recognition. In Turkish AI and Neural Networks Symp, 1996.
7. K. Beyer, J. Goldstein, R. Ramakrishnan, U. Shaft. When is nearest neighbors meaningful? ICDT Conf, 1999.
8. M. Brusco and J. Cradit. A variable selection heuristic for k-means clustering. Psychometrika, 66:249-270, 2001.
9. K. Chakrabarti and S. Mehrotra. Local dimensionality reduction: A new approach to indexing high dimensional spaces. In VLDB Conf, 2000.
10. C. Cheng, A. Fu, Y. Zhang. Entropy-based subspace clustering for mining numerical data. In SIGKDD Conf, 1999.
11. H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Math. Statistics, 23:493-509, 1952.
12. C. Ding, X. He, H. Zha, and H. Simon. Adaptive dimension reduction for clustering high-dimensional data. In ICDM Conf, 2002.
13. K. Gouda and M. Zaki. Efficiently mining maximal frequent itemsets. In ICDM Conf, 2001.
14. J. Han and M. Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann, San Francisco, CA, 2001.
15. A. Hinneburg and D. Keim. Optimal grid-clustering: Towards breaking the curse of dimensionality in high-dimensional clustering. In VLDB Conf, 1999.
16. W. Hoeffding. Probability inequalities for sums of bounded random variables. J. American Statistical Association, 58:13-30, 1963.
17. K. Kailing, H. Kriegel, and P. Kroger. Density-connected subspace clustering for high-dimensional data. In SIAM Data Mining Conf, 2004.
18. K. Railing, H. Kriegel, P. Kroger, and S. Wanka. Ranking interesting subspaces for clustering high-dimensional data. In European PKDD Conf, 2003.
19. H. Nagesh, S. Goil, and A. Choudhary. Adaptive grids for clustering massive data sets. In SIAM Data Mining Conf, 2001.
20. C. Procopiuc, M. Jones, P. Agarwal, and T. Murali. A montecarlo algorithm for fast projective clustering. In SIGMOD Conf, 2002.
21. P. Tan, V. Kumar, and J. Srivastava. Selecting the right interestingness measure for association patterns. In SIGKDD Conf, 2002.