FINDIT: A fast and intelligent subspace clustering algorithm using dimension voting

Information and Software Technology

Volumn 46, Issue 4, 2004, Pages 255-271

  Woo, Kyoung Gu ^a   Lee, Jeong Hoon ^a   Kim, Myoung Ho ^a   Lee, Yoon Joon ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Data clustering; Data mining; High dimension; Subspace clustering

Indexed keywords

ALGORITHMS; HEALTH CARE; ITERATIVE METHODS; OBJECT ORIENTED PROGRAMMING; SPURIOUS SIGNAL NOISE;

DATA CLUSTERING; DATASETS; SUBSPACE CLUSTERING;

DATA MINING;

EID: 0742324835     PISSN: 09505849     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.infsof.2003.07.003     Document Type: Article

References (22)

1. Vitter J.S. Random sampling with a reservoir. in: ACM Transactions on Mathematical Software. 1985.
2. Jain A.K., Dubes R.C. Algorithms for Clustering Data. 1988;Prentice Hall, Englewood Cliff, NJ.
3. Kaufman L., Rousseeuw P.J. Finding Groups in Data: An Introduction to Cluster Analysis. 1990;Wiley, New York.
4. Cutting D.R., Karger D.R., Pedersen J.O., Tukey J.W. Scatter/gather: a cluster-based approach to browsing large document collections. in: The 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Denmark. 1992.
5. Ng R., Han J. Efficient and effective clustering methods for spatial data mining. in: Proceedings of the 20th VLDB Conference, Santiago de Chile, Chile. 1994.
6. Ester M., Kriegel H.-P., Sander J., Xu X. A density-based algorithm for discovering clusters in large spatial databases with noise. in: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Portland, OR. 1996.
7. Zhang T., Ramakrishnan R., Livny M. BIRCH: an efficient data clustering method for large databases. in: Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, Montreal, Que., Canada. 1996.
8. Wang W., Yang J., Muntz R. STING: a statistical information grid approach to spatial data mining. in: Proceedings of the 23rd VLDB Conference, Athens, Greece. 1997.
9. Sheikholeslami G., Chatterjee S., Zhang A. A multi-resolution clustering approach for very large spatial databases. in: Proceedings of the 24th VLDB Conference, New York City. 1998.
10. Agrawal R., Gehrke J., Gunopulos D., Raghavan P. Automatic subspace clustering of high dimensional data for data mining applications. in: Proceedings of the ACM SIGMOD International Conference on Management of Data, Seattle, WA. 1998;1998.
11. Joze-Khajavi N., Salem K. Two-phase clustering of large datasets. Technical Report CS-98-27. 1998;Department of Computer Science, University of Waterloo.
12. Guha S., Rastogi R., Shim K. ROCK: a robust clustering algorithm for categorical attributes. in: Proceedings of the 15th International Conference on Data Engineering, Sydney, Australia. 1999.
13. Aggarwal C.C., Procopiuc C., Wolf J.L., Park J.S. Fast algorithms for projected clustering. in: Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data, Philadelphia, PA. 1999.
14. Cheng C.-H., Fu A., Zhang Y. Entropy-based subspace clustering for mining numerical data. in: Proceedings of the 1999 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego. 1999.
15. Ankerst M., Breunig M.M., Kriegel H.-P., Sander J. OPTICS: ordering points to identify the clustering structure. in: Proceedings of ACM SIGMOD International Conference on Management of Data, Philadelphia, PA. 1999.
16. Karypis G., Han E.H., Kumar V. Chameleon: hierarchical clustering using dynamic modeling. IEEE Computer. 32:1999;68-75.
17. Beyer K. When is nearest neighbor meaningful? in: Proceedings of the Seventh International Conference on Database Theory, Jerusalem, Israel. 1999.
18. Goil S., Nagesh H., Choudhary A. MAFIA: efficient and scalable subspace clustering for very large data sets. Technical Report CPDC-TR-9906-010. 1998;Department of Electrical and Computer Engineering, Northwestern University.
19. Aggarwal C.C., Yu P.S. Finding generalized projected clusters in high dimensional spaces. in: Proceedings of the ACM SIGMOD International Conference on Management of Data, Dallas, Texas. 2000.
20. Liu B., Xia Y., Yu P.S. Clustering through decision tree construction. in: Proceedings of the Ninth International Conference on Information Knowledge Management CIKM, McLean, VA. 2000.
21. Palmer C.R., Faloutsos C. Density biased sampling: an improved method for data mining and clustering. in: Proceedings of the ACM SIGMOD International Conference on Management of Data, Dallas, Texas. 2000.
22. Guha S., Rastogi R., Shim K. CURE: an efficient clustering algorithm for large databases. Information Systems. 26:(1):2001.