CURLER: Finding and visualizing nonlinear correlation clusters

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2005, Pages 467-478

  Tung, Anthony K H ^a   Xu, Xin ^a   Ooi, Beng Chin ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ORIENTATION; HIGH-DIMENSIONAL DATA; NONLINEAR CORRELATION CLUSTERS; SPATIAL PROXIMITY;

CORRELATION METHODS; DATA PROCESSING; DATABASE SYSTEMS; LEARNING ALGORITHMS; MERGING; PROBLEM SOLVING;

NONLINEAR CONTROL SYSTEMS;

EID: 29844449492     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1066157.1066211     Document Type: Conference Paper

References (23)

1. Hinneburg A. and Keim D. Optimal grid-clustering: Towards breaking the curse of dimensionality in high-dimensional clustering. In Proc. of the 25th Int. Conf. on Very Large Data Bases, pages 506-517, 1999.
2. Hinneburg A. and Keim D.A. An efficient approach to cluster in large multimedia databases with noise. In Proc. of the Int. Conf. on Knowledge Discovery and Data Mining, 1998.
3. Yu P. S. Aggarwal C. C. Finding generalized projected clusters in high dimensional spaces. In Proc. of ACM SIGMOD Conf. Proceedings, volume 29, 2000.
4. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In Proc. of ACM-SIGMOD Int. Conf. on Management of Data, pages 94-105, June 1998.
5. M. Ankerst, M. Breunig, H.-P. Kriegel, and J. Sander. Optics: Ordering points to identify the clustering structure. In Proc. 1999 ACM-SIGMOD Int. Conf. on Management of Data, pages 49-60, June 1999.
6. C.L. Blake and C.J. Merz. UCI repository of machine learning databases, 1998.
7. Christian Bohm, Karin Kailing, Peer Kroger, and Arthur Zimek. Computing clusters of correlation connected objects. In Proc. of ACM-SIGMOD Int. Conf. on Management of Data, June 2004.
8. P. Bradley, U. Fayyad, and C. Reina. Scaling clustering algorithms to large databases. In Proc. 1998 Int. Conf. Knowledge Discovery and Data Mining (KDD'98), pages 9-15, Aug. 1998.
9. Agrawal C. C., Procopiuc C., Wolf J. L., Yu P.S., and Park J. S. Fast algorithms for projected clustering. In Proc. of ACM SIGMOD Int. conf. on Management of Data, pages 61-72, 1999.
10. C.H. Cheng, A.C. Fu, and Y. Zhang. Entropy-based subspace clustering for mining numerical data. In Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining, 1996.
11. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases. In Proc. 1996 Int. Conf. Knowledge Discovery and Data Mining (KDD'96), pages 226-231, Portland, Oregon, Aug. 1996.
12. Patrik D Haeseleer, Xiling Wen, Stefanie Fuhrman, and Roland Somogyi. Mining the gene expression matrix: Inferring gene relationships from large scale gene expression data. Information Processing in Cells and Tissues, pages 203-212, 1998.
13. V.R. Iyer, M.B. Eisen, D.T. Ross, G. Schuler, T. Moore, J.C.F. Lee, J.M. Trent, L.M. Staudt, J.Jr Hudson, M.S. Boguski, D. Lashkari, D. Shalon, D. Botstein, and P.O. Brown. The transcriptional program in the response of human fibroblasts to serum. Science, 283:83-87, 1999.
14. Han J. and Kamber M. Data mining concepts and techniques. Morgan Kaufmann, August 2001.
15. Banfield J.D. and Raftery A.E. Model-based gaussian and non-gaussian clustering. Biometrics, 49:803-821, September, 1993.
16. I. T. Jolliffe. Principal Component Analysis. Springer-Verlag, 2002.
17. Kaufman L. and Rousseeuw P. J. Finding Groups in Data: An Introduction to Cluster Analysis. Wiley-Interscience, 1990.
18. C.M. Procopiuc, M. Jones, P.K. Agarwal, and M.T. M. A monte carlo algorithm for fast projective clustering. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 2002.
19. J. Roy. A fast improvement to the em algorithm on its own terms, JRSS(B), 51:127-138, 1989.
20. Joshua B. Tenenbaum, Vin de Silva, and John C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290:2323-2326, 2000.
21. A. K. H. Tung, J. Han, L. V. S. Lakshmanan, and R. T. Ng, Constraint-based clustering in large databases. In Proc. 2001 Int. Conf. on Database Theory, Jan. 2001.
22. A. K. H. Tung, J. Hou, and J. Han. Spatial clustering in the presence of obstacles. In Proc. 2001 Int. Conf. on Data Engineering, Heidelberg, Germany, April 2001.
23. XU X., Ester M., Kriegel H-P., and Sander J. A distributed-based clustering algorithm for mining in large spatial databases. In Proc. 1998 Int. Conf. on Data Engineering, 1998.