A Bayesian model for supervised clustering with the dirichlet process prior

Journal of Machine Learning Research

Volumn 6, Issue , 2005, Pages

  Daumé III, Hal ^a   Marcu, Daniel ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

Citation matching; Coreference; Dirichlet process; Non parametric Bayesian; Record linkage; Supervised clustering

Indexed keywords

ALGORITHMS; MARKOV PROCESSES; MONTE CARLO METHODS; PARAMETER ESTIMATION; PROBLEM SOLVING; SET THEORY; SUPERVISORY AND EXECUTIVE PROGRAMS;

CITATION MATCHING; COREFERENCE; DIRICHLET PROCESS; NON-PARAMETRIC BAYESIAN; RECORD LINKAGE; SUPERVIZED CLUSTERING;

MATHEMATICAL MODELS;

EID: 25444485701     PISSN: 15337928     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (36)

1. Charles E. Antoniak. Mixtures of Dirichlet processes with applications to Bayesian nonparametric problems. The Annals of Statistics, 2(6): 1152-1174, November 1974.
2. Aharon Bar-Hillel, Tomer Hertz, Noam Shental, and Daphna Weinshall. Learning distance functions using equivalence relations. In Proceedings of the International Conference on Machine Learning (ICML), 2003.
3. Aharon Bar-Hillel and Daphna Weinshall. Learning with equivalence constraints and the relation to multiclass learning. In Proceedings of the Conference on Computational Learning Theory (COLT), 2003.
4. Sugato Basu, Mikhail Bilenko, and Raymond J. Mooney. Comparing and unifying search-based and similarity-based approaches to semi-supervised clustering. In ICML Workshop on the Continuum from Labeled to Unlabeled Data in Machine Learning and Data Mining, pages 42-49, 2003.
5. Matt Beal, Zoubin Ghahramani, and Carl Edward Rasmussen. The infinite hidden Markov model. In Advances in Neural Information Processing Systems (NIPS), 2002.
6. David Blackwell and James B. MacQueen. Ferguson distributions via Pòlya urn schemes. The Annals of Statistics, 1(2):353-355, March 1973.
7. David Blei and Michael I. Jordan. Variational inference for Dirichlet process mixtures. Bayesian Analysis, 1(1):121-144, August 2005.
8. Peter Carbonetto, Jacek Kisyński, Nando de Freitas, and David Poole. Nonparametric bayesian logic. In Proceedings of the Converence on Uncertainty in Artificial Intelligence (UAI), July 2005.
9. William Cohen and Jacob Richman. Learning to match and cluster large high-dimensional data sets for data integration. In KDD, 2002.
10. Anhai Doan, Jayant Madhavan, Pedro Domingos, and Alon Halevy. Ontology matching: A machine learning approach. In S. Staab and R. Studer, editors, Handbook on Ontologies in Information Systems, pages 397-416. Springer-Velag, 2004.
11. Michael D. Escobar. Estimating normal means with a Dirichlet process prior. Journal of the American Statistical Association (JASA), 89(425):268-277, March 1994.
12. Thomas S. Ferguson. A Bayesian analysis of some nonparametric problems. The Annals of Statistics, 1(2):209-230, March 1973.
13. Thomas S. Ferguson. Prior distributions on spaces of probability measures. The Annals of Statistics, 2(4):615-629, July 1974.
14. Thomas S. Ferguson. Bayesian density estimation by mixtures of normal distribution. In H. Rizvi and J. Rustagi, editors, Recent Advances in Statistics, pages 287-303. Academic Press, 1983.
15. Thomas Finley and Thorsten Joachims. Supervised clustering with support vector machines. In Proceedings of the International Conference on Machine Learning (ICML), July 2005.
16. Hermant Ishwaran and Lancelot F. James. Gibbs sampling methods for stick-breaking priors. Journal of the American Statistical Association (JASA), 96(453): 161-173, March 2001.
17. Sonia Jain and Radford M. Neal. A split-merge markov chain Monte Carlo procedure for the Dirichlet process mixture model. Technical Report 2003, University of Toronto, Department of Statistics, 2003.
18. Toshihiro Kamishima and Fumio Motoyoshi. Learning from cluster examples. Machine Learning (ML), pages 199-233, 2003.
19. Steven N. MacEachern and Peter Müller. Estimating mixture of Dirichlet process models. Journal of Computational and Graphical Statistics (JCGS), 7:223-238, 1998.
20. Andrew McCallum, Kamal Nigam, and Lyle Ungar. Efficient clustering of high-dimensional data sets with application to reference matching. In KDD, 2000.
21. Andrew McCallum and Ben Wellner. Conditional models of identity uncertainty with application to noun coreference. In Advances in Neural Information Processing Systems (NIPS), 2004.
22. Marina Meila. Comparing clusterings. In Proceedings of the Conference on Computational Learning Theory (COLT), 2003.
23. Thomas Minka and Zoubin Ghahramani. Expectation propagation for infinite mixtures. In NIPS Workshop on Nonparametric Bayesian Methods and Infinite Models, 2004.
24. Alvaro E. Monge and Charles Elkan. An efficient domain-independent algorithm for detecting approximately duplicate database records. In KDD, 1997.
25. Radford M. Neal. Markov chain sampling methods for Dirichlet process mixture models. Technical Report 9815, University of Toronto, September 1998.
26. Vincent Ng and Claire Cardie. Improving machine learning approaches to coreference resolution. In Proceedings of the Conference of the Association for Computational Linguistics (ACL), 2002.
27. Patrick Pantel. Clustering by Committee. PhD thesis, University of Alberta, 2003.
28. Hanna Pasula, Bhaskara Marthi, Brian Milch, Stuart Russell, and Ilya Shpitser. Identity uncertainty and citation matching. In Advances in Neural Information Processing Systems (NIPS), 2003.
29. Jim Pitman. Some developments of the Blackwell-MacQueen urn scheme. In Statistics, Probability and Game Theory; Papers in honor of David Blackwell Lecture Notes, Monograph Series 30: 245-267, 1996.
30. W. M. Rand. Objective criteria for the evaluation of clustering methods. Journal of the American Statistical Association (JASA), 66:846-850, 1971.
31. Wee Meng Soon, Hwee Tou Ng, and Daniel Chung Yong Lim. A machine learning approach to coreference resolution of noun phrases. Computational Linguistics, 27(4):521 - 544, 2001.
32. Ioannis Tsochantaridis, Thomas Hofmann, Thorsten Joachims, and Yasmine Altun. Support vector machine learning for interdependent and structured output spaces. In Proceedings of the International Conference on Machine Learning (ICML), 2004.
33. USPS digits database. United states postal service handwritten zip code database. Made available by the USPS Office of Advanced Technology, 1987.
34. Mike West. Hyperparameter estimation in Dirichlet process mixture models. ISDS Discussion Paper #92-A03, 1992. Duke University.
35. Eric P. Xing, Andrew Ng, Michael I. Jordan, and Stuart Russell. Distance metric learning, with application to clustering with side-information. In Advances in Neural Information Processing Systems (NIPS), 2003.
36. Eric P. Xing, Roded Sharan, and Michael I. Jordan. Bayesian haplotype inference via the Dirichlet process. In Proceedings of the International Conference on Machine Learning (ICML), 2004.