Deriving quantitative models for correlation clusters

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn 2006, Issue , 2006, Pages 4-13

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

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

Cluster description; Cluster model; Clustering; Correlation clustering; Data mining

Indexed keywords

ALGORITHMS; DATA MINING; DATA REDUCTION; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS;

CLUSTER DESCRIPTION; CLUSTER MODEL; CLUSTERING; CORRELATION CLUSTERING;

CORRELATION METHODS;

EID: 33749545528     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1150402.1150408     Document Type: Conference Paper

References (25)

1. E. Achtert, G. Böhm, H.-P. Kriegel, P. Kröger, and A. Zimek. Robust, complete, and efficient correlation clustering, submitted.
2. G. G. Aggarwal, G. M. Procopiuc, J. L. Wolf, P. S. Yu, and J. S. Park. Fast algorithms for projected clustering. In Proceedings of the SIGMOD Conference, Philadelphia, PA, 1999.
3. C. C. Aggarwal and P. S. Yu. Finding generalized projected clusters in high dimensional space. In Proceedings of the SIGMOD Conference, Dallas, TX, 2000.
4. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In Proceedings of the SIGMOD Conference, Seattle, WA, 1998.
5. C. Böhm, K. Kailing, H.-P. Kriegel, and P. Kröger. Density connected clustering with local subspace preferences. In Proceedings of the 4th International Conference on Data Mining (ICDM), Brighton, U.K., 2004.
6. C. Böhm, K. Kailing, P. Kröger, and A. Zimek. Computing clusters of correlation connected objects. In Proceedings of the SIGMOD Conference, Paris, Prance, 2004.
7. Y. Cheng and G. M. Church. Biclustering of expression data. In Proceedings of the 8th International Conference Intelligent Systems for Molecular Biology (ISMB), San Diego, CA, 2000.
8. 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.
9. 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 International Conference on Knowledge Discovery and Data Mining (KDD), Portland, OR, 1996.
10. E. Georgii, L. Richter, U. Rückert, and S. Kramer. Analyzing microarray data using quantitative association rules. Bioinformatics, 21(Suppl. 2):ii1-ii8, 2005.
11. J. Han and M. Kamber. Data Mining: Concepts and Techniques. Academic Press, 2001.
12. J. A. Hartigan. Direct clustering of a data matrix. Journal of the American Statistical Association, 67(337):123-129, 1972.
13. D. Husmeier. Sensitivity and specificity of inferring genetic regulatory interactions from microarray experiments with dynamic Bayesian networks. Bioinformatics, 19(17):2271-2282, 2003.
14. K. Kailing, H.-.P. Kriegel, and P. Kröger. Density-connected subspace clustering for high-dimensional data. In Proceedings of the 4th SIAM International Conference on Data Mining (SDM), Orlando, FL, 2004.
15. J. Liu and W. Wang. OP-Cluster: Clustering by tendency in high dimensional spaces. In Proceedings of the 3th International Conference on Data Mining (ICDM), Melbourne, FL, 2003.
16. 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 3th International Conference on Data Mining (ICDM), Melbourne, FL, 2003.
17. C. M. Procopiuc, M. Jones, P. K. Agarwal, and T. M. Murali. A Monte Carlo algorithm for fast projective clustering. In Proceedings of the SIGMOD Conference, Madison, WI, 2002.
18. U. Rückert, L. Richter, and S. Kramer. Quantitative association rules based on half-spaces: an optimization approach. In Proceedings of the 4th International Conference on Data Mining (ICDM), Brighton, U.K., pages 507-510, 2004.
19. R. Srikant and R. Agrawal. Mining quantitative association rules in large relational tables. In Proceedings of the SIGMOD Conference, Montreal, Canada, pages 1-12, 1996.
20. A. K. H. Tung, X. Xu, and C. B. Ooi. CURLER: Finding and visualizing nonlinear correlated clusters. In Proceedings of the SIGMOD Conference, Baltimore, ML, 2005.
21. H. Wang, W. Wang, J. Yang, and P. S. Yu. Clustering by pattern similarity in large data sets. In Proceedings of the SIGMOD Conference, Madison, WI, 2002.
22. G. I. Webb. Discovering associations with numeric variables. In Proceedings of the 7th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), San Francisco, CA, pages 383-388, 2001.
23. I. H. Witten and E. Frank. Data Mining: Practical machine learning tools and techniques. Morgan Kaufmann, San Francisco, 2nd edition, 2005.
24. J. Yang, W. Wang, H. Wang, and P. S. Yu. Delta-Clusters: Capturing subspace correlation in a large data set. In Proceedings of the 18th International Conference on Data Engineering (ICDE), San Jose, CA, 2002.
25. T. Yuster. The reduced row echelon form of a matrix is unique: A simple proof. Mathematics Magazine, 57(2):93-94, 1984.