Constraint-based subspace clustering

Society for Industrial and Applied Mathematics - 9th SIAM International Conference on Data Mining 2009, Proceedings in Applied Mathematics

Volumn 1, Issue , 2009, Pages 25-36

  Fromont, Elisa ^a   Prado, Adriana ^b   Robardet, Céline ^c  

^a UNIVERSITÉ DE LYON   (France)

^b UNIVERSITY OF ANTWERP   (Belgium)

^c UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ANALYSIS; DATA MINING; EFFICIENCY;

BACK-GROUND KNOWLEDGE; CLUSTERING PROCESS; CONSTRAINT-BASED; HIGH DIMENSIONAL DATA; HIGH DIMENSIONAL SPACES; SIMILARITY CRITERIA; SUB-SPACE CLUSTERING; TRADITIONAL CLUSTERING;

CLUSTERING ALGORITHMS;

EID: 72949086267     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. C. C. Aggarwal, A. Hinneburg, and D.A. Keim. On the surprising behavior of distance metrics in high dimensional spaces. In Proc. ICDT, 420-434, 2001.
2. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In Proc. ACM SIGMOD, pages 94-105, 1998.
3. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. VLDB, pages 487-499, 1994.
4. S. Basu, M. Bilenko, and R. J. Mooney. A probabilistic framework for semi-supervised clustering. In KDD, pages 59-68, 2004.
5. I. Assent, R. Krieger, E. Muller, and T. Seidl. Dusc: Dimensionality unbiased subspace clustering. In Proc. IEEE ICDM, pages 409-414, 2007.
6. J. Besson, C. Robardet, J-F. Boulicaut, and S. Rome. Constraint-based concept mining and its application to microarray data analysis. Intell. Data Anal, 9(1):59-82, 2005.
7. M. Bilenko, S. Basu, and R. J. Mooney. Integrating constraints and metric learning in semi-supervised clustering. In Proc. ICML, page 11, 2004.
8. H. Blockeel, T. Calders, E. Fromont, B. Goethals, and A Prado. Mining views: Database views for data mining. In Proc. IEEE ICDE, pages 1608-1611, 2008.
9. C. Böhm and C. Plant. Hissclu: a hierarchical density-based method for semi-supervised clustering. In Proc. EDBT, pages 440-451, 2008.
10. F. Bonchi, F. Giannotti, A. Mazzanti, and D. Pedreschi. Adaptive constraint pushing in frequent pattern mining. In Proc. PKDD, pages 47-58, 2003.
11. Z. Bozdech, M. Llinás, B. Lee Pulliam, E.D. Wong, J. Zhu, and J.L. DeRisi. The transcriptome of the intraerythrocytic developmental cycle of Plasmodium falciparum. PLoS Biology, 1(1): 1-16, 2003.
12. C-H. Cheng, A. W.Fu, and Y. Zhang. Entropy-based subspace clustering for mining numerical data. In Proc. KDD, pages 84-93, 1999.
13. I. Davidson and S. S. Ravi. Clustering with constraints: Feasibility issues and the k-means algorithm. In Proc. SDM, 2005.
14. A. Gély. A generic algorithm for generating closed sets of a binary relation. In Proc. ICFCA, pages 223-234, 2005.
15. J. Han and M. Kamber. Data Mining: Concepts and Techniques, 2nd ed. Morgan Kaufmann Publishers Inc., 2006.
16. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. ACM SIGMOD, pages 1-12, 2000.
17. B. Jeudy and J-F Boulicaut. Optimization of association rule mining queries. Intell. Data Anal., 6(4):341-357, 2002.
18. L. Jing, M. K. Ng, J. Xu, and J. Z. Huang. Subspace clustering of text documents with feature weighting -means algorithm. In Proc. PAKDD, pages 802-812, 2005.
19. K. Railing, H. P. Kriegel, and P. Krger. Density-connected subspace clustering for high-dimensional data. In Proc. SDM, pages 246-257, 2004.
20. E. Keogh, L. Wei, X. Xi, S-H Lee, and M. Vlachos. Lb-keogh supports exact indexing of shapes under rotation invariance with arbitrary representations and distance measures. In Proc. VLDB, pages 882-893, 2006.
21. D. Klein, S. D. Kamvar, and C. D. Manning. From instance-level constraints to space-level constraints: Making the most of prior knowledge in data clustering. In Proc. ICML, pages 307-314, 2002.
22. G. Liu, J. Li, K. Sim, and L. Wong. Distance based subspace clustering with flexible dimension partitioning. In Proc. IEEE ICDE, pages 1250-1254, 2007.
23. H. Nagesh, S. Goil, and A. Choudhary. Mafia: Efficient and scalable subspace clustering for very large data sets. Tech. Rep. CPDC-TR-9906-010, Northwestern University, 1999.
24. DJ. Newman, S. Hettich, C.L. Blake, and C.J. Merz. UCI repository of machine learning databases, 1998.
25. L. Parsons, E. Haque, and H. Liu. Subspace clustering for high dimensional data: a review. SIGKDD Explor. Newsl., 6(1):90-105, 2004.
26. C. Ruiz, M. Spiliopoulou, and E. M. Ruiz. C-dbscan: Density-based clustering with constraints. In RSFDGrC, volume 4482, pages 216-223, 2007.
27. K. Sequeira and M. J. Zaki. Schism: A new approach for interesting subspace mining. In Proc. IEEE ICDM, pages 186-193, 2004.
28. J. Struyf and S. Dzeroski. Clustering trees with instance level constraints. In ECML, pages 359-370, 2007.
29. T Uno, M. Kiyomi, and H. Arimura. Lcm ver.3 In Proc. ACM OSDM workshop, pages 77-86, 2005.
30. K. Wagstaff, C. Cardie, S. Rogers, and S. Schroedl. Constrained k-means clustering with background knowledge. In Proc. ICML, pages 577-584, 2001.
31. M. J. Zaki. Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering, 12(3): 372-390, 2000.