A Latent Dirichlet model for unsupervised entity resolution

Proceedings of the Sixth SIAM International Conference on Data Mining

Volumn 2006, Issue , 2006, Pages 47-58

  Bhattacharya, Indrajit ^a   Getoor, Lise ^a  

^a University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIBLIOGRAPHIC RETRIEVAL SYSTEMS; DATA REDUCTION; PROBABILISTIC LOGICS; REAL TIME SYSTEMS; SAMPLING;

ENTITY RESOLUTION; LATENT DIRICHLET MODEL; RELATIONAL DOMAINS; SAMPLING ALGORITHMS;

MATHEMATICAL MODELS;

EID: 33745448357     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972764.5     Document Type: Conference Paper

References (34)

1. R. Ananthakrishna, S. Chaudhuri, and V. Ganti. Eliminating fuzzy duplicates in data warehouses. In International Conference on Very Large Databases, 2002.
2. C. Antoniak. Mixtures of dirichlet processes with applications to bayesian nonparametric problems. The Annals of Statistics, 2:1152-1174, 1974.
3. I. Bhattacharya and L. Getoor. Iterative record linkage for cleaning and integration. In SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, 2004.
4. M. Bilenko and R. J. Mooney. Adaptive duplicate detection using learnable string similarity measures. In International Conference on Knowledge Discovery and Data Mining, 2003.
5. D. M. Blei and M. I. Jordan. Variational methods for the dirichlet process. In International Conference on Machine Learning, 2004.
6. D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent dirichlet allocation. Journal of Machine Learning Research, 3:951-991, Jan 2003.
7. S. Chaudhuri, K. Ganjam, V. Ganti, and R. Motwani. Robust and efficient fuzzy match for online data cleaning. In International Conference on Management of Data, 2003.
8. W. W. Cohen, P. Ravikumar, and S. E. Fienberg. A comparison of string distance metrics for name-matching tasks. In IJCAI Workshop on Information Integration on the Web, 2003.
9. W. W. Cohen and J. Richman. Learning to match and cluster large high-dimensional data sets for data integration. In International Conference on Knowledge Discovery and Data Mining, 2002.
10. A. Culotta and A. McCallum. A conditional model of deduplication for multi-type relational data. Technical Report IR-443, University of Massachusetts, 2005.
11. A. Doan, Y. Lu, Y. Lee, and J. Han. Object matching for data integration: A profile-based approach. In IJCAI Workshop on Information Integration on the Web, 2003.
12. X. Dong, A. Halevy, and J. Madhavan. Reference reconciliation in complex information spaces. In International Conference on Management of Data, 2005.
13. I. P. Fellegi and A. B. Sunter. A theory for record linkage. Journal of the American Statistical Association, 64:1183-1210, 1969.
14. T. Ferguson. A bayesian analysis of some nonparametric problems. The Annals of Statistics, 1:209-230, 1973.
15. C. L. Giles, K. Bollacker, and S. Lawrence. CiteSeer: An automatic citation indexing system. In Conference on Digital Libraries, 1998.
16. T. Griffiths and M. Steyvers. Finding scientific topics. In Proceedings of the National Academy of Sciences, 2004.
17. M. A. Hernández and S. J. Stolfo. The merge/purge problem for large databases. In International Conference on Management of Data, 1995.
18. T. Hofmann. Probabilistic latent semantic analysis. In Uncertainty in Artificial Intelligence, 1999.
19. H. D. III and D. Marcu. A bayesian model for supervised clustering with the dirichlet process prior. Journal of Machine Learning Research, 6:1551-1577, Sep 2005.
20. D. V. Kalashnikov, S. Mehrotra, and Z. Chen. Exploiting relationships for domain-independent data cleaning. In SIAM International Conference on Data Mining, 2005.
21. J. Kubica, A. Moore, J. Schneider, and Y. Yang. Stochastic link and group detection. In National Conference on Artificial Intelligence, 2002.
22. X. Li, P. Morie, and D. Roth. Robust reading: Identification and tracing of ambiguous names. In Human Language Technology Conference / NAACL, 2004.
23. A. McCallum, K. Nigam, and L. Ungar. Efficient clustering of high-dimensional data sets with application to reference matching. In International Conference On Knowledge Discovery and Data Mining, 2000.
24. A. McCallum and B. Wellner. Conditional models of identity uncertainty with application to noun coreference. In Neural Information Processing Systems, 2004.
25. T. P. Minka. Expectation propagation for approximate bayesian inference. In Uncertainty in Artificial Intelligence, 2001.
26. A. E. Monge and C. P. Elkan. The field matching problem: Algorithms and applications. In International Conference on Knowledge Discovery and Data Mining, 1996.
27. R. M. Neal. Markov chain sampling methods for dirichlet process mixture models. Journal of Computational and Graphical Statistics, 9, 2000.
28. Parag and P. Domingos. Multi-relational record linkage. In ACM SIGKDD Workshop on Multi-Relational Data Mining, 2004.
29. H. Pasula, B. Marthi, B. Milch, S. Russell, and I. Shpitser. Identity uncertainty and citation matching. In Neural Information Processing Systems, 2003.
30. P. Ravikumar and W. W. Cohen. A hierarchical graphical model for record linkage. In Uncertainty in Artificial Intelligence, 2004.
31. M. Rosen-Zvi, T. Griffiths, M. Steyvers, and P. Smyth. The author-topic model for authors and documents. In Uncertainty in Artificial Intelligence, 2004.
32. S. Sarawagi and A. Bhamidipaty. Interactive deduplication using active learning. In International Conference on Knowledge Discovery and Data Mining, 2002.
33. S. Tejada, C. A. Knoblock, and S. Minton. Learning object identification rules for information integration. Information Systems Journal, 26(8):635-656, 2001.
34. W. E. Winkler. Methods for record linkage and Bayesian networks. Technical report, Statistical Research Division, U.S. Census Bureau, Washington, DC, 2002.