A framework for entity resolution with efficient blocking

Proceedings of the 2012 IEEE 13th International Conference on Information Reuse and Integration, IRI 2012

Volumn , Issue , 2012, Pages 431-440

  Shu, Liangcai ^a   Lin, Can ^a   Meng, Weiyi ^a   Han, Yue ^a   Yu, Clement T ^b   Smalheiser, Neil R ^c  

^a State University of New York   (United States)

^b University of Illinois at Chicago   (United States)

^c UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ATTRIBUTE VALUES; BLOCKING ALGORITHMS; CONTEXT SENSITIVE; DATA OBJECTS; DATA SETS; DATA-SOURCES; GENERIC FRAMEWORKS; MARKOV BLANKETS; MATCHING ALGORITHM; MATCHING FUNCTIONS; NAIVE BAYES CLASSIFIERS; RELATIONAL DATA; WEB DATA INTEGRATION;

ALGORITHMS; DECISION TREES; INFORMATION USE;

BAYESIAN NETWORKS;

EID: 84868328932     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IRI.2012.6303041     Document Type: Conference Paper

References (33)

1. C. Batini and M. Scannapieco. Data quality: Concepts, methodologies annd techniques. Springer, 2006.
2. I. Bhattacharya and L. Getoor. Deduplication and group detection using links. In ACM SIGKDD Workshop on Link Analysis and Group Detection (LinkKDD-04), 2004.
3. I. Bhattacharya and L. Getoor. Iterative record linkage for cleaning and integration. In ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD), 2004.
4. I. Bhattacharya and L. Getoor. A latent Dirichlet model for unsupervised entity resolution. In SDM, 2006.
5. M. Bilenko and R. J. Mooney. Adaptive duplicate detection using learnable string similarity measures. In KDD, 2003.
6. A. Chapman. Principles and Methods of Data Cleaning. Report for the Global Biodiversity Information Facility, 2005.
7. P. Christen and T. Churches. Febrl: Freely extensible biomedical record linkage release 0.3, 2005. http://datamining.anu.edu.au/linkage.html.
8. W. Cohen and J. Richman. Learning to match and cluster large high-dimensional data sets for data integration. In KDD, 2002.
9. A. K. Elmagarmid, P. G. Ipeirotis, and V. S. Verykios. Duplicate record detection: A survey. IEEE Transactions on Knowledge and Data Engineering, 19(1):1-16, 2007.
10. S. Euijong Whang, D. Menestrina, G. Koutrika, M. Theobald, and H. Garcia-Molina. Entity resolution with iterative blocking. In SIGMOD, 2009.
11. W. Fan, X. Jia, J. Li, and S. Ma. Reasoning about record matching rules. In VLDB, 2009.
12. I. Fellegi and A. Sunter. A theory for record linkage. J. of the American Statistical Society, 64(328):1183-1210, 1969.
13. L. Gravano, P. G. Ipeirotis, N. Koudas, and D. Srivastava. Text joins in an RDBMS for web data integration. In WWW, pages 90-101, 2003.
14. S. Guha, N. Koudas, A. Marathe, and D. Srivastava. Merging the results of approximate match operations. In VLDB, 2004.
15. O. Hassanzadeh, F. Chiang, H. C. Lee, and R. J. Miller. Framework for evaluating clustering algorithms in duplicate detection. In VLDB, 2009.
16. M. Hernandez, M. A. H. Andez, S. Stolfo, and U. Fayyad. Real-world data is dirty: Data cleansing and the merge/purge problem. Data Mining and Knowledge Discovery, 2(1):9-37, 1998.
17. V. I. Levenshtein. Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady, 10(8):707-710, 1966.
18. C. D. Manning, P. Raghavan, and H. Schutze. Introduction to Information Retrieval. Cambridge University Press, 2008.
19. A. McCallum, K. Nigam, and L. Ungar. Efficient clustering of high-dimensional data sets with application to reference matching. In KDD, pages 169-178, 2000.
20. H. B. Newcombe, J. M. Kennedy, S. J. Axford, and A. P. James. Automatic linkage of vital records. Science, 130(3381):954-959, 1959.
21. M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69(2):026113+, Feb 2004.
22. H. Pasula, B. Marthi, B. Milch, S. Russell, and I. Shpitser. Identity uncertainty and citation matching. In NIPS, 2002.
23. J. Pearl. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, 1988.
24. J. C. Pinheiro and D. X. Sun. Methods for linking and mining massive heterogeneous databases. In KDD, 1998.
25. G. Salton, A. Wong, and C. S. Yang. A vector space model for automatic indexing. Communications of the ACM, 18(11):613-620, 1975.
26. S. Sarawagi and A. Bhamidipaty. Interactive deduplication using active learning. In KDD, pages 269-278, 2002.
27. L. Shu, A. Chen, M. Xiong, and W. Meng. Efficient spectral neighborhood blocking for entity resolution. In ICDE, pages 1067-1078, Hannover, Germany, April 2011.
28. L. Shu, B. Long, and W. Meng. A latent topic model for complete entity resolution. In ICDE, 2009.
29. E. Ukkonen. Approximate string matching with q-grams and maximal matches. Theoretical Computer Science, 92(1):191-211, 1992.
30. V. S. Verykios and A. K. Elmagarmid. Automating the approximate record matching process. Information Sciences, 126:83-98, 1999.
31. J. Williamson. Bayesian Nets and Causality: philosophical and computational foundations, chapter 3, pages 14-48. Oxford University Press, 2005.
32. W.Winkler. Overview of record linkage and current research directions. Technical report, US Bureau of the Census, 2006.
33. I. Witten and E. Frank. Data mining: practical machine learning tools and techniques, second edition. Morgan Kaufmann, San Francisco, 2005.