Clustering trees with instance level constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4701 LNAI, Issue , 2007, Pages 359-370

  Struyf, Jan ^a   Džeroski, Sašo ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b JO EF STEFAN INSTITUTE   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ANALYSIS; CLUSTERING ALGORITHMS; CONSTRAINT THEORY; HIERARCHICAL SYSTEMS; SET THEORY;

CLUSTERING TREES; DOMAIN KNOWLEDGE; HIERARCHICAL AGGLOMERATIVE CLUSTERING; HOMOGENEOUS CLUSTERS;

DECISION TREES;

EID: 38049185000     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74958-5_34     Document Type: Conference Paper

References (16)

1. Jain, A., Murty, M., Flynn, P.: Data clustering: A review. ACM Computing Surveys 31(3), 264-323 (1999)
2. Wagstaff, K., Cardie, C.: Clustering with instance-level constraints. In: 17th Int'l Conf. on Machine Learning, pp. 1103-1110 (2000)
3. Wagstaff, K., Cardie, C., Rogers, S., Schroedl, S.: Constrained K-means clustering with background knowledge. In: 18th Int'l Conf. on Machine Learning, pp. 577-584 (2001)
4. Bilenko, M., Basu, S., Mooney, R.: Integrating constraints and metric learning in semi-supervised clustering. In: 21st Int'l Conf. on Machine Learning, pp. 81-88 (2004)
5. Basu, S., Bilenko, M., Mooney, R.: A probabilistic framework for semi-supervised clustering. In: 10th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, pp. 59-68. ACM Press, New York (2004)
6. Davidson, I., Ravi, S.: Clustering with constraints: Feasibility issues and the Kmeans algorithm. In: SIAM Int'l Data Mining Conf. (2005)
7. Davidson, I., Ravi, S.: Agglomerative hierarchical clustering with constraints: Theoretical and empirical results. In: 9th European Conf. on Principles and Practice of Knowledge Discovery in Databases, pp. 59-70 (2005)
8. Klein, D., Kamvar, S., Manning, C.: From instance-level constraints to space-level constraints: Making the most of prior knowledge in data clustering. In: 19th Int'l Conf. on Machine Learning, pp. 307-314 (2002)
9. Blocked, H., De Raedt, L., Ramon, J.: Top-down induction of clustering trees. In: 15th Int'l Conf. on Machine Learning, pp. 55-63 (1998)
10. Michalski, R., Stepp, R.: Learning from observation: Conceptual clustering. In: Machine Learning: An Artificial Intelligence Approach, vol. 1, Tioga Publishing Company (1983)
11. Struyf, J., Džeroski, S.: Constraint based induction of multi-objective regression trees. In: 4th Int'l Workshop on Knowledge Discovery in Inductive Databases: Revised Selected and Invited Papers, pp. 222-233 (2006)
12. Quinlan, J.: C4.5: Programs for Machine Learning. Morgan Kaufmann Series in Machine Learning. Morgan Kaufmann, San Francisco (1993)
13. Merz, C., Murphy, P.: UCI repository of machine learning databases, University of California, Department of Information and Computer Science, Irvine, CA (1996), http://www.ics.uci.edu/~mlearn/MLRepository. html
14. Davidson, I., Wagstaff, K., Basu, S.: Measuring constraint-set utility for partitional clustering algorithms. In: 10th European Conf. on Principles and Practice of Knowledge Discovery in Databases, pp. 115-126 (2006)
15. Raileanu, L., Stoffel, K.: Theoretical comparison between the Gini index and information gain criteria. Annals of Mathematics and Artificial Intelligence 41(1), 77-93 (2004)
16. Kocev, D., Struyf, J., Džeroski, S.: Beam search induction and similarity constraints for predictive clustering trees. In: 5th Int'l Workshop on Knowledge Discovery in Inductive Databases: Revised Selected and Invited Papers (to appear, 2007)