Distance based subspace clustering with flexible dimension partitioning

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2007, Pages 1250-1254

  Liu, Guimei ^a   Li, Jinyan ^b   Sim, Kelvin ^b   Wong, Limsoon ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ANALYSIS; CLUSTERING ALGORITHMS; COMPUTER SIMULATION; DATA MINING; GRID COMPUTING;

CLUSTERING PERFORMANCE; DIMENSION PARTITIONING; DISTANCE BASED SUBSPACE CLUSTERING; MAXIMAL NCLUSTERS; NCIUSTER;

DISTANCE MEASUREMENT;

EID: 34548723854     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2007.368985     Document Type: Conference Paper

References (20)

1. C. C. Aggarwal, C. M. Procopiuc, J. L. Wolf, P. S. Yu, and J. S. Park. Fast algorithms for projected clustering. In Proc. of the 1999 ACM SICMOD Conference, pages 61-72, 1999.
2. C. C. Aggarwal and P. S. Yu. Finding generalized projected clusters in high dimensional spaces. In Proc. of the 2000 ACM SIGMOD Conference, pages 70-81, 2000.
3. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic sub space clustering of high dimensional data for data mining applications. In Proc. of the 1998 ACM SIGMOD Conference, pages 94-105, 1998.
4. R. Agrawal, T. Imielinski, and A. N. Swami. Mining association rules between sets of items in large databases. In Proc. of the 1993 ACM SIGMOD Conference, pages 207-216, 1993.
5. R. Bellman. Adaptive Control Processes: A Guided Tour. Princeton University Press, 1961.
6. K. S. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is "nearest neighbor" meaningful? In Proc. of the 7th ICDT Conference, pages 217-235, 1999.
7. J.-W. Chang and D.-S. Jin. A new cell-based clustering method for large, high-dimensional data in data mining applications. In Proc. of the 2002 ACM symposium on Applied computing, pages 503-507, 2002.
8. C. H. Cheng, A. W.-C. Fu, and Y. Zhang. Entropy-based subspace clustering for mining numerical data. In Proc. of the 5th ACM SIGKDD Conference, pages 84-93, 1999.
9. Y. Cheng and G. M. Church. Biclustenng of expression data. In Proc. of the 8th International Conference on Intelligent Systems for Molecular Biology, pages 93-103, 2000.
10. T. Golub and et al. Molecular classification of cancer: Class discovery and class prediction by gene expression monitoring. Science, 286:531-537, 1999.
11. H. V. Jagadish, J. Madar, and R. T. Ng. Semantic compression and pattern extraction with fascicles. In Proc. of the 25th VLDB Conference, pages 186-198, 1999.
12. B. Liu, Y. Xia, and P. S. Yu. Clustering through decision tree construction. In Proc. of the 9th CIKM conference, pages 20-29, 2000.
13. H. Nagesh, S. Goil, and A. Choudhary. Mafia: Efficient and scalable subspace clustering for very large data sets. Technical Report 9906-010, Northwestern University, June 1999.
14. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In Proc. of the 7th ICDT Conference, pages 398-416, 1999.
15. J. Pei, X. Zhang, M. Cho, H. Wang, and P. S. Yu. Maple: A fast algorithm for maximal pattern-based clustering. In Proc. of the 3rd ICDM Conference, pages 259-266, 2003.
16. C. M. Procopiuc, M. Jones, P. K. Agarwal, and T. M. Murali. A monte carlo algorithm for fast projective clustering. In Proc. of the 2002 ACM SIGMOD Conference, pages 418-427, 2002.
17. T. Uno, M. Kiyomi, and H. Arimura. Lcm ver. 3: Collaboration of array, bitmap and prefix tree for frequent itemset mining. In Proc. of the ACM SIGKDD OSDM workshop, 2005.
18. H. Wang, W. Wang, J. Yang, and P. S. Yu. Clustering by pattern similarity in large data sets. In Proc. of the 2002 ACM SIGMOD Conference, pages 394-405, 2002.
19. K.-G. Woo, J.-H. Lee, M.-H. Kim, and Y.-J. Lee. Findit: a fast and intelligent subspace clustering algorithm, using dimension voting. Information & Software Technology, 46(4):255-271, 2004.
20. J. Yang, W. Wang, H. Wang, and P. S. Yu. δ-clusters: Capturing subspace correlation in a large data set. In Proc. of the 18th IEEE ICDE Conference, pages 517-528, 2002.