Identifying and generating easy sets of constraints for clustering

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2006, Pages 336-341

  Davidson, Ian ^a   Mavi, S S ^a  

^a STATE UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING; EMPIRICAL RESULTS; PROBLEM INSTANCES;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; GRAPH THEORY; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

CONSTRAINT THEORY;

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

References (8)

1. th SIAM Intl. Conf. on Data Mining.
2. st Intl Conf. on Machine Learning.
3. th SIAM Intl. Conf. on Data Mining.
4. Davidson, I., & Ravi, S. S. (2005b). Hierarchical clustering with constraints: Theory and practice. ECML/PKDD 2005.
5. Irani, S. "Coloring Inductive Graphs Online", Algorithmica. Vol. 11, No. 1, Jan. 1994, pp. 53-72.
6. th Intl. Conf. on Machine Learning.
7. West,D. B. Introduction to Graph Theory, Second Edition, Prentice Hall, Inc., Englewood Cliffs, NJ, 2001.
8. Xing, E. P., Ng, A. Y., Jordan, M. I., & Russell, S. (2003). Distance metric learning, with application to clustering with side-information. NIPS 15.