Entity resolution with Markov logic

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2006, Pages 572-582

  Singla, Parag ^a   Domingos, Pedro ^a  

^a University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENTITY RESOLUTION; MARKOV LOGIC; MARKOV NETWORKS; PROBABILISTIC GRAPHICAL MODELS;

AD HOC NETWORKS; DATA MINING; DATABASE SYSTEMS; MATHEMATICAL MODELS; PROBABILISTIC LOGICS; PROBLEM SOLVING;

MARKOV PROCESSES;

EID: 84878044770     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2006.65     Document Type: Conference Paper

References (46)

1. A. Agresti. Categorical Data Analysis. Wiley, New York, NY, 1990.
2. I. Bhattacharya and L. Getoor. Iterative record linkage for cleaning and integration. In Proc. SIGMOD-04 DMKD Wkshp., 2004.
3. M. Bilenko and R. Mooney. Adaptive duplicate detection using learnable string similarity measures. In Proc. KDD-03, pages 39-48, 2003.
4. M. Bilenko and R. Mooney. On evaluation and training-set construction for duplicate detection. In Proc. KDD-03 Wkshp. on Data Cleaning, Record Linkage, and Object Consolidation, pages 7-12, 2003.
5. W. Cohen, H. Kautz, and D. McAllester. Hardening soft information sources. In Proc. KDD-00, pages 255-259, 2000.
6. W. Cohen, P. Ravikumar, and S. Fienberg. A comparison of string metrics for matching names and records. In Proc. KDD-03 Wkshp. on Data Cleaning, Record Linkage, and Object Consolidation, pages 13-18, 2003.
7. W. Cohen and J. Richman. Learning to match and cluster large high-dimensional data sets for data integration. In Proc. KDD-02, pages 475-480, 2002.
8. M. Collins. Discriminative training methods for hidden Markov models: Theory and experiments with perceptron algorithms. In Proc. EMNLP-02, Philadelphia, PA, 2002.
9. A. Culotta and A. McCallum. Joint deduplication of multiple record types in relational data. In Proc. CIKM-05, pages 257-258, 2005.
10. J. Davis, I. Dutra, D. Page, , and V. Costa. Establishing identity equivalence in multi-relational domains. In Proc. ICIA-05, 2005.
11. S. Della Pietra, V. Della Pietra, and J. Lafferty. Inducing features of random fields. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19:380-392, 1997.
12. X. Dong, A. Halevy, and J. Madhavan. Reference reconciliation in complex information spaces. In Proc. SIGMOD-05, pages 85-96, 2005.
13. S. Džeroski and H. Blockeel, editors. Proceedings of the KDD-04 Workshop on Multi-Relational Data Mining. ACM Press, Chicago, IL, 2004.
14. I. Fellegi and A. Sunter. A theory for record linkage. J. American Statistical Association, 64:1183-1210, 1969.
15. A. Fern, L. Getoor, and B. Milch, editors. Proceedings of the ICML-2006 Workshop on Open Problems in Statistical Relational Learning. IMLS, Pittsburgh, PA, USA, 2006.
16. J. Gehrke, P. Ginsparg, and J. Kleinberg. KDD cup 2003. Online bibliography, SIGKDD, 2003. http://-www.cs.cornell.edu/projects/kddcup.
17. M. R. Genesereth and N. J. Nilsson. Logical Foundations of Artificial Intelligence. Morgan Kaufmann, San Mateo, CA, 1987.
18. W. R. Gilks, S. Richardson, and D. J. Spiegelhalter, editors. Markov Chain Monte Carlo in Practice. Chapman and Hall, London, UK, 1996.
19. L. Gravano, P. Ipeirotis, H. Jagadish, N. Koudas, S. Muthukrishnan, L. Pietarinen, and D. Srivastava. Using q-grams in a DBMS for approximate string processing. IEEE Data Engineering Bulletin, 24(4): 28-34, 2001.
20. M. Hernandez and S. Stolfo. The merge/purge problem for large databases. In Proc. SIGMOD-95, pages 127-138, 1995.
21. T. Huang and S. Russell. Object identification: A Bayesian analysis with application to traffic surveillance. Artificial Intelligence, 103:1-17, 1998.
22. H. Kautz, B. Selman, and Y Jiang. A general stochastic approach to solving problems with hard and soft constraints. In D. Gu, J. Du, and P. Pardalos, editors, The Satisfiability Problem: Theory and Applications, pages 573-586. American Mathematical Society, New York, NY, 1997.
23. S. Kok and P. Domingos. Learning the structure of Markov logic networks. In Proc. ICML-05, pages 441-448, Bonn, Germany, 2005. ACM Press.
24. S. Kok, P. Singla, M. Richardson, and P. Domingos. The Alchemy system for statistical relational AL Technical report, Department of Computer Science and Engineering, University of Washington, Seattle, WA, 2005. http://www.cs. washington.edu/ai/alchemy.
25. X. Li, P. Morie, and D. Roth. Semantic integration in text: from ambiguous names to identifiable entities. AIMagazine, 26(1):45-58, 2005.
26. A. McCallum, K. Nigam, and L. Ungar. Efficient clustering of high-dimensional data sets with application to reference matching. In Proc. KDD-00, pages 169-178, 2000.
27. A. McCallum, S. Tejada, and D. Quass, editors. Proceedings of the KDD-2003 Workshop on Data Cleaning, Record Linkage, and Object Consolidation. ACM Press, 2003.
28. A. McCallum and B. Wellner. Conditional models of identity uncertainty with application to noun coreference. In Adv. NIPS 17, pages 905-912, 2005.
29. B. Milch, B. Marthi, D. Sontag, S. Russell, and D. L. Ong. BLOG: Probabilistic models with unknown objects. In Proc. IJCAI-05, pages 1352-1359, Edinburgh, Scotland, 2005.
30. A. Monge and C. Elkan. An efficient domain-independent algorithm for detecting approximately duplicate database records. In Proc. SIGMOD-97 DMKD Wkshp., 1997.
31. H. Newcombe, J. Kennedy, S. Axford, and A. James. Automatic linkage of vital records. Science, 130:954-959, 1959.
32. J. Nocedal and S. J. Wright. Numerical Optimization. Springer, New York, NY, 1999.
33. G. Norén, R. Orre, and A. Bate. A hit-miss model for duplicate detection in the WHO Drug safety Database. In Proc. KDD-05, pages 459-468, Chicago, IL, 2005.
34. H. Pasula, B. Marthi, B. Milch, S. Russell, and I. Shpitser. Identity uncertainty and citation matching. In Adv. NIPS 15, pages 1401-1408, 2003.
35. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Francisco, CA, 1988.
36. M. Richardson and P. Domingos. Markov logic networks. Machine Learning, 62:107-136, 2006.
37. D. Roth. On the hardness of approximate reasoning. Artificial Intelligence, 82:273-302, 1996.
38. S. Sarawagi and A. Bhamidipaty. Interactive deduplication using active learning. In Proc. KDD-02, pages 269-278, 2002.
39. B. Selman, H. Kautz, and B. Cohen. Local search strategies for satisfiability testing. In D. S. Johnson and M. A. Trick, editors, Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, pages 521-532. American Mathematical Society, Washington, DC, 1996.
40. W. Shen, X. Li, and A. Doan. Constraint-based entity matching. In Proc. AAAI-05, pages 862-867, Pittsburgh, PA, 2005. AAAI Press.
41. P. Singla and P. Domingos. Discriminative training of Markov logic networks. In Proc. AAAI-05, pages 868-873, Pittsburgh, PA, 2005. AAAI Press.
42. P. Singla and P. Domingos. Object identification with attribute-mediated dependences. In Proc. PKDD-05, pages 297-308, Porto, Portugal, 2005. springer.
43. P. Singla and P. Domingos. Memory-efficient inference in relational domains. In Proc. AAAI-06, pages 488-493, Boston, MA, 2006. AAAI Press.
44. S. Tejada, C. Knoblock, and S. Minton. Learning object identification rules for information integration. Information Systems, 26(8): 607-633, 2001.
45. S. Tejada, C. Knoblock, and S. Minton. Learning domain-independent string transformation weights for high accuracy object identification. In Proc. KDD-02, pages 350-359, 2002.
46. W. Winkler. The state of record linkage and current research problems. Technical report, Statistical Research Division, U.S. Census Bureau, 1999.