BoostCluster: Boosting clustering by pairwise constraints

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

Volumn , Issue , 2007, Pages 450-459

  Liu, Yi ^a   Jin, Rong ^a   Jain, Anil K ^a  

^a Michigan State University   (United States)

Author keywords

Boosting; Data clustering; Pairwise constraints; Semi supervised learning

Indexed keywords

CONSTRAINT THEORY; DATA MINING; INFORMATION RETRIEVAL; SUPERVISED LEARNING;

BOOSTING; PAIRWISE CONSTRAINTS; SEMI-SUPERVISED LEARNING;

CLUSTERING ALGORITHMS;

EID: 36849031309     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1281192.1281242     Document Type: Conference Paper

References (32)

1. M. R. Anderberg. Cluster Analysis for Applications. Academic Press, Inc., New York, NY, 1973.
2. S. Basu. Semi-supervised Clustering: Probabilistic Models, Algorithms and Experiments. PhD thesis, The University of Texas at Austin, 2005.
3. S. Basu, A. Banerjee, and R. J. Mooney. Active semi-supervision for pairwise constrained clustering. In ICDM '04, 2004.
4. S. Basu, M. Bilenko, and R. J. Mooney. A probabilistic framework for semi-supervised clustering. In SIGKDD '04, 2004.
5. R. Bekkerman and M. Sahami. Semi-supervised clustering using combinatorial MRFs. In ICML-06 Workshop on Learning in Structured Output Spaces, 2006.
6. K. Bennett, P. Bradley, and A. Demiriz. Constrained k-means clustering. Technical Report 2000-65, Microsoft Research, May 2000.
7. I. Davidson and S. Ravi. Clustering under constraints: Feasibility results and the k-means algorithm. In SIAM Data Mining Conference, 2005.
8. I. Davidson and S. Ravi. Hierarchical clustering with constraints: Theory and practice. In the 9th European Principles and Practice of KDD (PKDD), 2005.
9. C. B. D.J. Newman, S. Hettich and C. Merz. UCI repository of machine learning databases, 1998.
10. Y. Freund and R. E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119-139, 1997.
11. J. Goldberger, S. T. Roweis, G. E. Hinton, and R. Salakhutdinov. Neighbourhood components analysis. In NIPS'04, 2004.
12. M. Halkidi, D. Gunopulos, N. Kumar, M. Vazirgiannis, and C. Domeniconi. A framework for semi-supervised learning based on subjective and objective clustering criteria. In ICDM '05, 2005.
13. T. Hertz, A. Bar-Hillel, and D. Weinshall. Boosting margin based distance functions for clustering. In ICML '04, 2004.
14. T. Hertz, A. B. Hillel, and D. Weinshall. Learning a kernel function for classification with small training samples. In ICML '06, 2006.
15. S. C. H. Hoi, W. Liu, M. R. Lyu, and W.-Y. Ma. Learning distance metrics with contextual constraints for image retrieval. In CVPR '06, 2006.
16. A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: a review. A CM Comput. Surv., 31(3):264-323, September 1999.
17. S. D. Kamvar, D. Klein, and C. D. Manning. Spectral Learning. In IJCAI '03, 2003.
18. 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 ICML'02, 2002.
19. B. Kulis, S. Basu, I. Dhillon, and R. Mooney. Semi-supervised graph clustering: a kernel approach. In ICML '05, 2005.
20. J. T. Kwok and I. W. Tsang. Learning with idealized kernels. In ICML '03, 2003.
21. T. Lange, M. H. C. Law, A. K. Jain, and J. M. Buhmann. Learning with constrained and unlabelled data. In CVPR '05, 2005.
22. M. H. C. Law, A. P. Topchy, and A. K. Jain. Model-based clustering with probabilistic constraints. In SDM '05, 2005.
23. Z. Lu and T. Leen. Semi-supervised learning with penalized probabilistic clustering. In NIPS '05, 2005.
24. A. Y. Ng, M. I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In NIPS '01, 2001.
25. M. Schultz and T. Joachims. Learning a distance metric from relative comparisons. In NIPS '03, 2003.
26. N. Shental, A. Bar-Hillel, T. Hertz, and D. Weinshall. Computing gaussian mixture models with EM using side-information. In Proc. of workshop on the continuum from labeled to unlabeled data in machine learning and data mining, 2003.
27. K. Wagstaff, C. Cardie, S. Rogers, and S. Schroedl. Constrained k-means clustering with background knowledge. In ICML '01, 2001.
28. K. Weinberger, J. Blitzer, and L. Saul. Distance metric learning for large margin nearest neighbor classification. In NIPS '06, 2006.
29. E. P. Xing, A. Y. Ng, M. I. Jordan, and S. Russell. Distance metric learning with application to clustering with side-information. In NIPS '03, 2003.
30. L. Yang, R. Jin, R. Sukthankar, and Y. Liu. An efficient algorithm for local distance metric learning. In AAAI '06, 2006.
31. Y. Yang and X. Liu. A re-examination of text categorization methods. In SIGIR '99, 1999.
32. Z. Zhang, J. Kwok, and D. Yeung. Parametric distance metric learning with label information. In IJCAI'03, 2003.