Efficient mining of distance-based subspace clusters

Statistical Analysis and Data Mining

Volumn 2, Issue 5-6, 2009, Pages 427-444

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

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

^c NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Biclustering; Distance based clustering; Subspace clustering

Indexed keywords

GENE EXPRESSION;

BASED CLUSTERING; BICLUSTERING; DISTANCE-BASED; DISTANCE-BASED CLUSTERING; GRID-BASED APPROACH; HIGH-DIMENSIONAL DATASET; SIMILARITY MEASUREMENTS; SLIDING WINDOW; SUBSPACE CLUSTERING; SUBSPACE CLUSTERS;

CLUSTERING ALGORITHMS;

EID: 77950250511     PISSN: 19321872     EISSN: 19321864     Source Type: Journal    
DOI: 10.1002/sam.10062     Document Type: Article

References (42)

1. K. S. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft, When is "nearest neighbor" meaningful? In Proceedings of the 7th ICDT Conference, Jerusalem, Israel, 1999, 217-235.
2. A. Hinneburg, C. C. Aggarwal, and D. A. Keim, What is the nearest neighbor in high dimensional spaces? In Proceedings of the 26th VLDB Conference, Cairo, Egypt, 2000, 506-515.
3. C. C. Aggarwal, A. Hinneburg, and D. A. Keim, On the surprising behavior of distance metrics in high dimensional spaces, In Proceedings of the 8th ICDT Conference, London, UK, 2001, 420-434.
4. Lance Parsons, Ehtesham Haque, and Huan Liu, Subspace clustering for high dimensional data: a review. SIGKDD Explor Newslett 6(1) (2004), 90-105.
5. Hans-Peter Kriegel, Peer Kr̈oger, and Arthur Zimek, Clustering high-dimensional data: a survey on subspace clustering, pattern-based clustering, and correlation clustering. ACM Trans Knowl Dis Data Min 3(1) (2009), 1-58.
6. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan, Automatic subspace clustering of high dimensional data for data mining applications, In Proceedings of the 1998 ACM SIGMOD Conference, Seattle, Washington, 1998, 94-105.
7. C. H. Cheng, A. W.-C. Fu, and Yi Zhang, Entropybased subspace clustering for mining numerical data, In Proceedings of the 5th ACM SIGKDD Conference, San Diego, California, USA, 1999, 84-93.
8. Harsha Nagesh, Sanjay Goil, and Alok Choudhar, Adaptive grids for clustering massive data sets, In Proceedings of the 2nd SIAM International Conference on Data Mining, Chicago, IL, USA, 2001
9. J.-W. Chang and D.-S. Jin, A new cell-based clustering method for large, high-dimensional data in data mining applications, In Proceedings of the 2002 ACM Symposium on Applied Computing, Madrid, Spain, 2002, 503-507.
10. B. Liu, Y. Xia, and P. S. Yu, Clustering through decision tree construction, In Proceedings of the 9th CIKM Conference, McLean, VA, USA, 2000, 20-29.
11. G. Liu, J. Li, K. Sim, and L. Wong, Distance based subspace clustering with flexible dimension partitioning, In Proceedings of the 23rd ICDE Conference, Istanbul, Turkey, 2007, 1250-1254.
12. H. Wang, W. Wang, J. Yang, and P. S. Yu, Clustering by pattern similarity in large data sets, In Proceedings of the 2002 ACM SIGMOD Conference, Madison, Wisconsin, USA, 2002, 394-405.
13. R. Agrawal, T. Imielinski, and A. N. Swami, Mining association rules between sets of items in large databases, In Proceedings of the 1993 ACM SIGMOD Conference, Washington, D.C., USA, 1993, 207-216.
14. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, Discovering frequent closed itemsets for association rules, In Proceedings of the 7th ICDT Conference, Jerusalem, Israel, 1999, 398-416.
15. T. Uno, M. Kiyomi, and H. Arimura, Lcm ver. 3: collaboration of array, bitmap and prefix tree for frequent itemset mining, In Proceedings of the ACM SIGKDD OSDM Workshop, Chicago, Illinois, USA, 2005.
16. J. Han, J. Pei, and Y. Yin, Mining frequent patterns without candidate generation, In Proceedings of the 2000 ACM SIGMOD Conference, Dallas, Texas, USA, 2000, 1-12.
17. R. Rymon, Search through systematic set enumeration, In Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, Massachusetts, USA, 1992.
18. T. R. Hughes, M. J. Marton, A. R. Jones, C. J. Roberts, R. Stoughton, C. D. Armour, H. A. Bennett, E. Coffey, H. Dai, Y. D. He, M. J. Kidd, A. M. King, M. R. Meyer, D. Slade, P. Y. Lum, S. B. Stepaniants, D. D. Shoemaker, D. Gachotte, K. Chakraburtty, J. Simon, M. Bard, and S. H. Friend, Functional discovery via a compendium of expression profiles, Cell 102 (2000), 109-126.
19. M. L. Yiu and N. Mamoulis, Iterative projected clustering by subspace mining, IEEE Trans Knowl Data Eng, 17(2) (2005), 176-189.
20. G. Moise and J. Sander, Finding non-redundant, statistically significant regions in high dimensional data: a novel approach to projected and subspace clustering, In Proceedings of the 14th ACM SIGKDD Conference, Las Vegas, Nevada, USA, 2008, 533-541.
21. E. I. Boyle, S. Weng, J. Gollub, H. Jin, D. Botstein, J. M. Cherry, and G. Sherlock, Go: termfinder-open source software for accessing gene ontology information and finding significantly enriched gene ontology terms associated with a list of genes, Bioinformatics 20(18) (2004), 3710-3715.
22. Y. Cheng and G. M. Church, Biclustering of expression data, In Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology, San Diego, CA, USA, 2000, 93-103.
23. C. C. Aggarwal, Re-designing distance functions and distance-based applications for high dimensional data, SIGMOD Record 30(1) (2001), 13-18.
24. S. C. Madeira and A. L. Oliveira, Biclustering algorithms for biological data analysis: a survey, IEE/ACM Trans Comput Biol Bioinform 01(1) (2004), 24-45.
25. C. C. Aggarwal, C. M. Procopiuc, J. L. Wolf, P. S. Yu, and J. S. Park, Fast algorithms for projected clustering, In Proceedings of the 1999 ACM SIGMOD Conference, Philadelphia, Pennsylvania, USA, 1999, 61-72.
26. C. C. Aggarwal and P. S. Yu, Finding generalized projected clusters in high dimensional spaces, In Proceedings of the 2000 ACM SIGMOD Conference, Dallas, Texas, USA, 2000, 70-81.
27. K.-Gu Woo, J.-H. Lee, M.-H. Kim, and Y.-J. Lee, Findit: a fast and intelligent subspace clustering algorithm using dimension voting, Inf Soft Tech, 46(4) (2004), 255-271.
28. C. M. Procopiuc, M. Jones, P. K. Agarwal, and T. M. Murali, A monte carlo algorithm for fast projective clustering, In Proceedings of the 2002 ACM SIGMOD Conference, Madison, Wisconsin, 2002, 418-427.
29. K. Kailing, H.-P. Kriegel, and P. Kr̈oger, Densityconnected subspace clustering for high-dimensional data, In Proceedings of the 4th SIAM International Conference on Data Mining, Orlando, Florida, USA, 2004.
30. J. Yang, W. Wang, H. Wang, and P. S. Yu, δ-clusters: capturing subspace correlation in a large data set, In Proceedings of the 18th IEEE ICDE Conference, San Jose, California, USA, 2002, 517-528.
31. J. Pei, X. Zhang, M. Cho, H. Wang, and P. S. Yu, MaPle: a fast algorithm for maximal pattern-based clustering, In Proceedings of the 3rd ICDM Conference, Melbourne, Florida, USA, 2003, 259-266.
32. X. Xu, Y. Lu, A. K. H. Tung, and W. Wang, Mining shiftingand-scaling co-regulation patterns on gene expression profiles, In Proceedings of the 22nd ICDE Conference, Atlanta, Georgia, USA, 2006.
33. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu, A density-based algorithm for discovering clusters in large spatial databases with noise, In Proceedings of the 2nd ACM SIGKDD Conference, Portland, Oregon, USA, 1996, 226-231.
34. K. Sequeira and M. J. Zaki, Schism: a new approach for interesting subspace mining, In Proceedings of the 4th IEEE International Conference on Data Mining, Brighton, UK, 2004, 186-193.
35. I. Assent, R. Krieger, E. M̈uller, and T. Seidl, Dusc: dimensionality unbiased subspace clustering, In Proceedings of the 7th ICDM Conference, Omaha, Nebraska, USA, 2007, 409-414.
36. H.-P. Kriegel, P. Kr̈oger, M. Renz, and S. Wurst, A generic framework for efficient subspace clustering of high-dimensional data, In Proceedings of the 5th IEEE International Conference on Data Mining, Houston, Texas, USA, 2005, 250-257.
37. E. Achtert, C. B̈ohm, H.-P. Kriegel, P. Kr̈oger, I. M̈uller-Gorman, and A. Zimek, Detection and visualization of subspace cluster hierarchies, In Proceedings of the 12th DASFAA Conference, Bangkok, Thailand, 2007, 152-163.
38. K. Y. Yip, D. W. Cheung, and M. K. Ng, Harp: a practical projected clustering algorithm, IEEE Trans Knowl Data Eng, 16(11) (2004), 1387-1397.
39. K. Y. Yip, D. W. Cheung, and M. K. Ng, On discovery of extremely low-dimensional clusters using semi-supervised projected clustering, In Proceedings of the 21st ICDE Conference, Tokyo, Japan, 2005, 329-340.
40. C. B̈ohm, K. Kailing, H.-P. Kriegel, and P. Kr̈oger, Density connected clustering with local subspace preferences, In Proceedings of the 4th IEEE International Conference on Data Mining, Brighton, UK, 2004, 27-34.
41. E. K. K. Ng, A. W.-C. Fu, and R. C.-W. Wong, Projective clustering by histograms, IEEE Trans Knowl Data Eng 17(3) (2005), 369-383.
42. G. Moise, J. Sander, and M. Ester, P3c: a robust projected clustering algorithm, In Proceedings of the 6th IEEE International Conference on Data Mining, Hong Kong, China, 2006, 414-425.