Mining hierarchies of correlation clusters

Proceedings of the International Conference on Scientific and Statistical Database Management, SSDBM

Volumn , Issue , 2006, Pages 119-128

  Achtert, Elke ^a   Böhm, Christian ^a   Kröger, Peer ^a   Zimek, Arthur ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; BOOLEAN FUNCTIONS; CLUSTER ANALYSIS; CLUSTERING ALGORITHMS; DATABASE SYSTEMS; DECISION SUPPORT SYSTEMS; FLOW OF SOLIDS; GRAPHIC METHODS; INFORMATION MANAGEMENT; KNOWLEDGE MANAGEMENT; MANAGEMENT INFORMATION SYSTEMS; MINING; SEARCH ENGINES; SET THEORY; STATISTICAL METHODS; STATISTICS;

COMPARATIVE EXPERIMENTS; CORRELATION CLUSTERING; CORRELATION DIAGRAMS; DATA SPACES; DATABASE MANAGEMENT; HIERARCHICAL APPROACH; HIERARCHICAL CLUSTERING APPROACH; HIERARCHICAL STRUCTURING; HIGH-DIMENSIONAL DATA; INTERNATIONAL CONFERENCES; SYNTHETIC AND REAL DATA;

CORRELATION METHODS;

EID: 45149090482     PISSN: 10993371     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SSDBM.2006.35     Document Type: Conference Paper

References (16)

1. C. C. Aggarwal, C. M. Procopiuc, J. L. Wolf, P. S. Yu, and J. S. Park. Fast algorithms for projected clustering. In Proc. SIGMOD, 1999.
2. C. C. Aggarwal and P. S. Yu. Finding generalized projected clusters in high dimensional space. In Proc. SIGMOD, 2000.
3. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In Proc. SIGMOD, 1998.
4. M. Ankerst, M. M. Breunig, H.-P. Kriegel, and J. Sander. OPTICS: Ordering points to identify the clustering structure. In Proc. SIGMOD, 1999.
5. C. Böhm, K. Kailing, H.-P. Kriegel, and P. Kröger. Density connected clustering with local subspace preferences. In Proc. ICDM, 2004.
6. C. Böhm, K. Kailing, P. Kröger, and A. Zimek. Computing clusters of correlation connected objects. In Proc. SIGMOD, 2004.
7. Y. Cheng and G. M. Church. Biclustering of expression data. In Proc. ISMB, 2000.
8. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proc. KDD, 1996.
9. J. A. Hartigan. Direct clustering of a data matrix. JASA, 67(337):123-129, 1972.
10. K. Kailing, H.-P. Kriegel, and P. Kroger. Density-connected subspace clustering for high-dimensional data. In Proc. SDM, 2004.
11. J. Liu and W. Wang. OP-Cluster: Clustering by tendency in high dimensional spaces. In Proc. ICDM, 2003.
12. J. Pei, X. Zhang, M. Cho, H. Wang, and P. S. Yu. MaPle: A fast algorithm for maximal pattern-based clustering. In Proc. ICDM, 2003.
13. C. M. Procopiuc, M. Jones, P. K. Agarwal, and T. M. Murali. A Monte Carlo algorithm for fast projective clustering. In Proc. SIGMOD, 2002.
14. A. K. H. Tung, X. Xu, and C. B. Ooi. CURLER: Finding and visualizing nonlinear correlated clusters. In Proc. SIGMOD, 2005.
15. H. Wang, W. Wang, J. Yang, and P. S. Yu. Clustering by pattern similarity in large data sets. In Proc. SIGMOD, 2002.
16. J. Yang, W. Wang, H. Wang, and P. S. Yu. Delta-Clusters: Capturing subspace correlation in a large data set. In Proc. ICDE, 2002.