Semantic-Aware Blocking for Entity Resolution

IEEE Transactions on Knowledge and Data Engineering

Volumn 28, Issue 1, 2016, Pages 166-180

  Wang, Qing ^a   Cui, Mingyuan ^a   Liang, Huizhi ^b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

blocking; Data matching; deduplication; entity resolution; indexing; locality sensitive hashing; record linkage; semantic features; semantic hashing; semantic similarity; taxonomy tree

Indexed keywords

IMAGE RETRIEVAL; INDEXING (OF INFORMATION); TREES (MATHEMATICS); VIRTUAL REALITY;

BLOCKING; DATA MATCHING; DE DUPLICATIONS; ENTITY RESOLUTIONS; LOCALITY SENSITIVE HASHING; RECORD LINKAGE; SEMANTIC FEATURES; SEMANTIC SIMILARITY;

SEMANTICS;

EID: 84961639084     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2015.2468711     Document Type: Conference Paper

References (42)

1. N. Adly, "Efficient record linkage using a double embedding scheme," in Proc. Int. Conf. Data Mining, 2009, pp. 274-281.
2. A. Aizawa and K. Oyama, "A fast linkage detection scheme for multi-source information integration," in Proc. Int. Workshop Challenges Web Inf. Retrieval Integr., 2005, pp. 30-39.
3. A. Andoni and P. Indyk, "Near-optimal hashing algorithms for near neighbor problem in high dimension," Commun. ACM, vol. 51, no. 1, pp. 117-122, 2008.
4. A. Arasu, M. Götz, and R. Kaushik, "On active learning of record matching packages," in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2010, pp. 783-794.
5. M. Bawa, T. Condie, and P. Ganesan, "LSH forest: Self-tuning indexes for similarity search," in Proc. Int. Conf. World Wide Web, 2005, pp. 651-660.
6. R. Baxter, P. Christen, and T. Churches, "A comparison of fast blocking methods for record linkage," in Proc. ACM Int. Conf. Knowl. Discovery Data Mining, 2003, vol. 3, pp. 25-27.
7. M. Bilenko, B. Kamath, and R. J. Mooney, "Adaptive blocking: Learning to scale up record linkage," in Proc. Int. Conf. Data Mining, 2006, pp. 87-96.
8. A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher, "Min-wise independent permutations," J. Comput. Syst. Sci., vol. 60, no. 3, pp. 630-659, 2000.
9. F. Chierichetti and R. Kumar, "LSH-preserving functions and their applications," in Proc. 23rd Annu. ACM-SIAM Symp. Discrete Algorithm, 2012, pp. 1078-1094.
10. P. Christen, "Towards parameter-free blocking for scalable record linkage," Dept. Comput. Sci., Australian Nat. Univ., CA, Australia, Tech. Rep. TR-CS-07-03, 2007.
11. P. Christen, Data Matching, New York, NY, USA: Springer, 2012.
12. P. Christen, "A survey of indexing techniques for scalable record linkage and deduplication," IEEE Trans. Knowl. Data Eng., vol. 24, no. 9, pp. 1537-1555, Sep. 2012.
13. P. Christen, "Preparation of a real voter data set for record linkage and duplicate detection research," Australian Nat. Univ., Canberra, Australia, 2013.
14. W. W. Cohen and J. Richman, "Learning to match and cluster large high-dimensional data sets for data integration," in Proc. ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2002, pp. 475-480.
15. T. De Vries, H. Ke, S. Chawla, and P. Christen, "Robust record linkage blocking using suffix arrays," in Proc. 18th ACM Conf. Inf. Knowl. Manage., 2009, pp. 305-314.
16. A. Doan, J. Madhavan, R. Dhamankar, P. Domingos, and A. Halevy, "Learning to match ontologies on the semantic web," VLDB J., vol. 12, no. 4, pp. 303-319, 2003.
17. M. G. Elfeky, V. S. Verykios, and A. K. Elmagarmid, "Tailor: A record linkage toolbox," in Proc. Int. Conf. Data Eng., 2002, pp. 17-28.
18. I. Fellegi and A. Sunter, "A theory for record linkage," J. Amer. Stat. Assoc., vol. 64, no. 328, pp. 1183-1210, 1969.
19. E. Gabrilovich and S. Markovitch, "Computing semantic relatedness using Wikipedia-based explicit semantic analysis," in Proc. 20th Int. Joint Conf. Artif. Intell., 2007, pp. 1606-1611.
20. A. Gionis, P. Indyk, and R. Motwani, "Similarity search in high dimensions via hashing," in Proc. 25th Int. Conf. Very Large Databases, 1999, pp. 518-529.
21. M. A. Hernández and S. J. Stolfo, "The merge/purge problem for large databases," ACM SIGMOD Rec., vol. 24, pp. 127-138, 1995.
22. M. A. Hernández and S. J. Stolfo, "Real-world data is dirty: Data cleansing and the merge/purge problem," Data Mining Knowl. Discovery, vol. 2, no. 1, pp. 9-37, 1998.
23. P. Indyk and R. Motwani, "Approximate nearest neighbors: Towards removing the curse of dimensionality," in Proc. Annu. ACM Symp. Theory Comput., 1998, pp. 604-613.
24. E. Ioannou, O. Papapetrou, D. Skoutas, and W. Nejdl, "Efficient semantic-aware detection of near duplicate resources," in Proc. 7th Int. Conf. Semantic Web: Res. Appl., 2010, pp. 136-150.
25. L. Jin, C. Li, and S. Mehrotra, "Efficient record linkage in large data sets," in Proc. 8th Int. Conf. Database Syst. Adv. Appl., 2003, pp. 137-146.
26. M. Kejriwal and D. P. Miranker, "An unsupervised algorithm for learning blocking schemes," in Proc. Int. Conf. Data Mining, 2013, pp. 340-349.
27. B. Kenig and A. Gal, "MFIBlocks: An effective blocking algorithm for entity resolution," Inf. Syst., vol. 38, no. 6, pp. 908-926, 2013.
28. H.-S. Kim and D. Lee, "HARRA: Fast iterative hashed record linkage for large-scale data collections," in Proc. Int. Conf. Extending Database Technol.: Adv. Database Technol., 2010, pp. 525-536.
29. Q. Lv, W. Josephson, Z. Wang, M. Charikar, and K. Li, "Multiprobe LSH: Efficient indexing for high-dimensional similarity search," in Proc. Int. Conf. Very Large Databases, 2007, pp. 950-961.
30. A. Maedche and S. Staab, "Measuring similarity between ontologies," in Proc. 13th Int. Conf. Knowl. Eng. Knowl. Manage. Ontol. Semantic Web, 2002, pp. 251-263.
31. P. Malhotra, P. Agarwal, and G. Shroff, "Graph-parallel entity resolution using LSH & IMM," in Proc. EDBT/ICDT Workshops, 2014, pp. 41-49.
32. A. McCallum, K. Nigam, and L. H. Ungar, "Efficient clustering of high-dimensional data sets with application to reference matching," in Proc. 6th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2000, pp. 169-178.
33. G. Miller and C. Fellbaum, Wordnet: An Electronic Lexical Database, Cambridge, Ma, Usa: MIT Press, 1998.
34. R. Panigrahy, "Entropy based nearest neighbor search in high dimensions," in Proc. Annu. ACM-SIAM Symp. Discrete Algorithm, 2006, pp. 1186-1195.
35. G. Papadakis, E. Ioannou, C. Niederée, T. Palpanas, and W. Nejdl, "Eliminating the redundancy in blocking-based entity resolution methods," in Proc. 11th Annu. Int. ACM/IEEE Joint Conf. Digital libraries, 2011, pp. 85-94.
36. G. Papadakis, E. Ioannou, C. Niederée, T. Palpanas, and W. Nejdl, "Beyond 100 million entities: Large-scale blocking-based resolution for heterogeneous data," in Proc. ACM Int. Conf. Web Search Data Mining, 2012, pp. 53-62.
37. G. Papadakis, G. Koutrika, T. Palpanas, and W. Nejdl, "Metablocking: Taking entity resolution to the next level," IEEE Trans. Knowl. Data Eng., vol. 26, no. 8, pp. 1946-1960, Aug. 2014.
38. P. Resnik, "Using information content to evaluate semantic similarity in a taxonomy," in Proc. Int. Joint Conf. Artif. Intell., 1995, pp. 448-453.
39. S. E. Whang, D. Menestrina, G. Koutrika, M. Theobald, and H. Garcia-Molina, "Entity resolution with iterative blocking," in Proc. SIGMOD Int. Conf. Manage. Data, 2009, pp. 219-232.
40. W. Wu, H. Li, H. Wang, and K. Zhu, "Towards a probabilistic taxonomy of many concepts," Microsoft Res. Redmond, WA, USA, Tech. Rep. MSR-TR-2011-25, 2011.
41. S. Yan, D. Lee, M.-Y. Kan, and L. C. Giles, "Adaptive sorted neighborhood methods for efficient record linkage," in Proc. 7th ACM/ IEEE-CS Joint Conf. Digital librarie, 2007, pp. 185-194.
42. P. Zezula, G. Amato, V. Dohnal, and M. Batko, Similarity Search: The Metric Space Approach, vol. 32, New York, NY, USA: Springer, 2006.