K-means with large and noisy constraint sets

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

Volumn 4701 LNAI, Issue , 2007, Pages 674-682

  Pelleg, Dan ^a   Baras, Dorit ^a  

^a IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLUSTER ANALYSIS; COMPUTATIONAL COMPLEXITY; DATA ACQUISITION; PROBLEM SOLVING;

CVQE ALGORITHM; NOISY CONSTRAINT SETS;

CONSTRAINT THEORY;

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

References (13)

1. Wagstaff, K., Cardie, C., Rogers, S., Schroedl, S.: Constrained fc-means clustering with background knowledge. In: Brodley, C., Danyluk, A. (eds.) Proceeding of the 17th International Conference on Machine Learning, Morgan Kaufmann, San Francisco (2001)
2. Lin, W.-H., Hauptmann, A.: Structuring continuous video recordings of everyday life using time-constrained clustering. In: IS&T/SPIE Symposium on Electronic Imaging, San Jose, CA (January 2006)
3. Hertz, T., Shental, N., Bar-Hillel, A., Weinshall, D.: Enhancing image and video retrieval: Learning via equivalence constraints. In: Proc. of IEEE Conference on Computer Vision and Pattern Recognition, IEEE Computer Society Press, Los Alamitos (2003)
4. Davidson, I., Ravi, S.S.: Clustering with constraints: Feasibility issues and the k-means algorithm. In: 5th SIAM Data Mining Conference (2005)
5. Yu, S.X., Shi, J.: Grouping with directed relationships. In: Figueiredo, M., Zerubia, J., Jain, A.K. (eds.) EMMCVPR 2001. LNCS, vol. 2134, Springer, Heidelberg (2001)
6. Cohn, D., Caruana, R., McCallum, A.: Semi-supervised clustering with user feedback. Technical report, Cornell University, TR2003-1892 (2003)
7. Basu, S., Bilenko, M., Mooney, R.J.: A probabilistic framework for semi-supervised clustering. In: Kim, W., Kohavi, R., Gehrke, J., DuMouchel, W. (eds.) Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seattle, WA, pp. 59-68. ACM Press, New York (2004)
8. Basu, S., Davidson, I.: Clustering with constraints: Theory and practice. In: Online Proceedings of a KDD tutorial (2006), http://www.ai.sri.com/~basu/ kdd-tutorial-2006/
9. Davidson, I., Ravi, S.S.: Identifying and generating easy sets of constraints for clustering. In: AAAI, AAAI Press (2006)
10. Davidson, I., Wagstaff, K., Basu, S.: Measuring constraint-set utility for partitional clustering algorithms. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, pp. 115-126. Springer, Heidelberg (2006)
11. Pelleg, D., Baras, D.: k-means with large and noisy constraint sets. Technical Report H-0253, IBM (2007)
12. Bilenko, M., Basu, S., Mooney, R. J.: Integrating constraints and metric learning in semi-supervised clustering. In: Brodley, C.E. (ed.) ICML, ACM, New York (2004)
13. Davidson, I., Ravi, S.S.: Intractability and clustering with constraints. In: ICML (2007)