On exploring complex relationships of correlation clusters

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

Volumn , Issue , 2007, Pages

  Achtert, Elke ^a   Böhm, Christian ^a   Kriegel, Hans Peter ^a   Kroger, Peer ^a   Zimek, Arthur ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; CLUSTERING ALGORITHMS; COMPETITION; DATABASE SYSTEMS; MANAGEMENT INFORMATION SYSTEMS; STATISTICAL METHODS; STATISTICS;

COMPLEX HIERARCHY; COMPLEX RELATIONSHIPS; CORRELATION CLUSTERING; DATABASE MANAGEMENT; EXPERIMENTAL EVALUATIONS; FEATURE SPACES; GENERAL (CO); GRAPH-BASED REPRESENTATIONS; HIGH-DIMENSIONAL DATA; INFORMATION GAIN (IG); INTERNATIONAL CONFERENCES; MULTIPLE INCLUSIONS;

CORRELATION METHODS;

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

References (22)

1. E. Achtert, C. Böhm, H.-P. Kriegel, P. Kroger, I. Müller-Gorman, and A. Zimek. Finding hierarchies of subspace clusters. In Proc. PKDD, 2006.
2. E. Achtert, C. Böhm, H.-P. Kriegel, P. Kroger, I. Müller-Gorman, and A. Zimek. Detection and visualization of subspace cluster hierarchies. In Proc. DASFAA, 2007.
3. E. Achtert, C. Böhm, H.-P. Kriegel, P. Kroger, and A. Zimek. Robust, complete, and efficient correlation clustering. In Proc. SDM, 2007.
4. E. Achtert, C. Böhm, P. Kroger, and A. Zimek. Mining hierarchies of correlation clusters. In Proc. SSDBM, 2006.
5. 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.
6. C. C. Aggarwal and P. S. Yu. Finding generalized projected clusters in high dimensional space. In Proc. SIGMOD, 2000.
7. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In Proc. SIGMOD, 1998.
8. M. Ankerst, M. M. Breunig, H.-P. Kriegel, and J. Sander. OPTICS: Ordering points to identify the clustering structure. In Proc. SIGMOD, 1999.
9. C. Böhm, K. Kailing, H.-P. Kriegel, and P. Kroger. Density connected clustering with local subspace preferences. In Proc. ICDM, 2004.
10. C. Böhm, K. Kailing, P. Kroger, and A. Zimek. Computing clusters of correlation connected objects. In Proc. SIGMOD, 2004.
11. K. Chakrabarti and S. Mehrotra. Local dimensionality reduction: A new approach to indexing high dimensional spaces. In Proc. VLDB, 2000.
12. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, Series B, 39(1): 1-31, 1977.
13. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A densitybased algorithm for discovering clusters in large spatial databases with noise. In Proc. KDD, 1996.
14. A. Gionis, A. Hinneburg, S. Papadimitriou, and P. Tsaparas. Dimension induced clustering. In Proc. KDD, 2005.
15. J. A. Hartigan. Direct clustering of a data matrix. JASA, 67(337): 123-129, 1972.
16. K. Kailing, H.-P. Kriegel, and P. Kroger. Density-connected subspace clustering for high-dimensional data. In Proc. SDM, 2004.
17. J. Liu and W. Wang. OP-Cluster: Clustering by tendency in high dimensional spaces. In Proc. ICDM, 2003.
18. 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.
19. C. M. Procopiuc, M. Jones, P. K. Agarwal, and T. M. Murali. A Monte Carlo algorithm for fast projective clustering. In Proc. SIGMOD, 2002.
20. A. K. H. Tung, X. Xu, and C. B. Ooi. CURLER: Finding and visualizing nonlinear correlated clusters. In Proc. SIGMOD, 2005.
21. H. Wang, W. Wang, J. Yang, and P. S. Yu. Clustering by pattern similarity in large data sets. In Proc. SIGMOD, 2002.
22. J. Yang, W. Wang, H. Wang, and P. S. Yu. Delta-Clusters: Capturing subspace correlation in a large data set. In Proc. ICDE, 2002.