A blocking scheme for entity resolution in the semantic web

Proceedings - International Conference on Advanced Information Networking and Applications, AINA

Volumn 2016-May, Issue , 2016, Pages 1138-1145

  De Assis Costa, Gustavo ^a,b   De Oliveira, José Maria Parente ^b  

^a Instituto Federal de Educacao Ciencia e Tecnologia de Goias   (Brazil)

^b INSTITUTO TECNOLÓGICO DE AERONÁUTICA   (Brazil)

Author keywords

Blocking Scheme; Data Integration; Entity Resolution; Semantic Web

Indexed keywords

APPROXIMATION ALGORITHMS; DATA INTEGRATION;

BLOCKING SCHEME; BRUTE-FORCE APPROACH; ENTITY RESOLUTIONS; INVERTED INDEX STRUCTURES; QUADRATIC COMPLEXITY; RELATIONAL LEARNING; RESEARCH COMMUNITIES; STATISTICAL APPROXIMATION;

SEMANTIC WEB;

EID: 84988948815     PISSN: 1550445X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/AINA.2016.23     Document Type: Conference Paper

References (32)

1. Y. Altowim, D. V. Kalashnikov, and S. Mehrotra, "Progressive approach to relational entity resolution, " Proc. VLDB Endow., vol. 7, pp. 999-1010, jul 2014.
2. C. Bizer, T. Heath, and T. Berners-Lee, "Linked data-The story so far, " Int. J. Semantic Web Inf. Syst., vol. 5, pp. 1-22, 2009.
3. V. Levenshtein, "Binary codes capable of correcting deletions, insertions, and reversals, " Soviet Physics Doklady, vol. 10, p. 707, feb 1966.
4. S. Harispe, S. Ranwez, S. Janaqi, and J. Montmain, "Semantic similarity from natural language and ontology analysis, " Synthesis Lectures on Human Language Technologies, vol. 8, pp. 1-254, May 2015.
5. G. Papadakis, G. Demartini, P. Fankhauser, and P. Kärger, "The missing links: Discovering hidden same-as links among a billion of triples, " in Proc. of the 12th International Conference on Information Integration and Web-based Applications and Services (iiWAS'2010), New York, NY, USA, 2010, pp. 453-460.
6. G. de Assis Costa and J. M. P. de Oliveira, "A relational learning approach for collective entity resolution in the web of data, " in Proc. of the 5th International Workshop on Consuming Linked Data (COLD 2014) co-located with the 13th International Semantic Web Conference (ISWC 2014), vol. 1264, Riva del Garda, Italy, oct 2014.
7. G. de Assis Costa and J. M. P. de Oliveira, "Large-scale entity resolution for semantic web data integration, " in Proc. of the International Conference WWW/Internet 2014 (ICWI 2014), Porto, Portugal, oct 2014, pp. 99-106.
8. M. Nickel, V. Tresp, and H.-P. Kriegel, "A three-way model for collective learning on multi-relational data, " in Proc. of the 28th International Conference on Machine Learning (ICML'11), New York, NY, USA, jun 2011, pp. 809-816.
9. M. Nickel, V. Tresp, and H.-P. Kriegel, "Factorizing yago: scalable machine learning for linked data, " in Proc. of the 21st international conference on World Wide Web, New York, NY, USA, 2012, pp. 271-280.
10. A. Harth. (2012) Billion triples challenge data set. [Online]. Available: http: //km. Aifb. kit. edu/projects/btc-2012/
11. G. Papadakis, E. Ioannou, C. Niederée, and P. Fankhauser, "Efficient entity resolution for large heterogeneous information spaces, " in Proc. of the Fourth ACM International Conference on Web Search and Data Mining (WSDM'11), New York, NY, USA, 2011, pp. 535-544.
12. P. Christen, "A survey of indexing techniques for scalable record linkage and deduplication, " IEEE Transactions on Knowledge and Data Engineering, vol. 24, pp. 1537-1555, sep 2012.
13. P. Christen and R. Gayler, "Towards scalable real-time entity resolution using a similarity-aware inverted index approach, " in Proc. of the 7th Australasian Data Mining Conference (AusDM'08), Darlinghurst, Australia, 2008, pp. 51-60.
14. W. W. Cohen and J. Richman, "Learning to match and cluster large high-dimensional data sets for data integration, " in Proc. of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'02), New York, NY, USA, 2002, pp. 475-480.
15. P. Christen, Data Matching-Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection, ser. Data-Centric Systems and Applications. New York, NY, USA: Springer, 2012.
16. Z. Wu and M. Palmer, "Verbs semantics and lexical selection, " in Proc. of the 32nd Annual Meeting on Association for Computational Linguistics, Stroudsburg, PA, USA, 1994, pp. 133-138.
17. H. Köpcke and E. Rahm, "Frameworks for entity matching: A comparison, " Data & Knowledge Engineering, vol. 69, pp. 197-210, feb 2010.
18. L. Kolb, A. Thor, and E. Rahm, "Dedoop: Efficient deduplication with hadoop, " Proc. VLDB Endow., vol. 5, pp. 1878-1881, aug 2012.
19. L. Kolb, A. Thor, and E. Rahm, "Load balancing for mapreducebased entity resolution, " in Proc. of the 2012 IEEE 28th International Conference on Data Engineering (ICDE'2012), Washington, DC, USA, 2012, pp. 618-629.
20. L. Kolb, A. Thor, and E. Rahm, "Multi-pass sorted neighborhood blocking with mapreduce, " Computer Science-Research and Development, vol. 27, pp. 45-63, feb 2012.
21. L. Kolb, A. Thor, and E. Rahm, "Don't match twice: Redundancyfree similarity computation with mapreduce, " in Proc. of the Second Workshop on Data Analytics in the Cloud, New York, NY, USA, 2013, pp. 1-5.
22. G. Papadakis, G. Koutrika, T. Palpanas, and W. Nejdl, "Meta-blocking: Taking entity resolution to the next level, " IEEE Transactions on Knowledge and Data Engineering, vol. 26, pp. 1946-1960, aug 2014.
23. 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. of the Fifth ACM International Conference on Web Search and Data Mining (WSDM 2012), New York, NY, USA, 2012, pp. 53-62.
24. G. Papadakis, E. Ioannou, C. Niederée, T. Palpanas, and W. Nejdl, "A blocking framework for entity resolution in highly heterogeneous nformation spaces, " IEEE Transactions on Knowledge and Data Engineering, vol. 25, pp. 2665-2682, dec 2013.
25. R. Isele, A. Jentzsch, and C. Bizer, "Efficient multidimensional blocking for link discovery without losing recall, " in Proc. of the 14th International Workshop on the Web and Databases (WebDB 2011), Athens, Greece.
26. A.-C. N. Ngomo and Sören Auer, "Limes: A time-efficient approach for large-scale link discovery on the web of data, " in Proc. of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 2011, pp. 2312-2317.
27. D. Song and J. Heflin, "Automatically generating data linkages using a domain-independent candidate selection approach, " in Proc. of the 10th International Conference on The Semantic Web (ISWC 2010), Berlin, Heidelberg, 2011, pp. 649-664.
28. M. Kejriwal and D. P. Miranker, "A two-step blocking scheme learner for scalable link discovery, " in Proc. of the 9th International Workshop on Ontology Matching co-located with the 13th International Semantic Web Conference (ISWC 2014), Riva del Garda, Italy, oct.
29. B. Ramadan, P. Christen, H. Liang, R. W. Gayler, and D. Hawking, "Dynamic similarity-aware inverted indexing for real-time entity resolution, " in Trends and Applications in Knowledge Discovery and Data Mining, ser. Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2013, vol. 7867, pp. 47-58.
30. E. Daskalaki, I. Fundulaki, M. Herschel, and J. Saveta, "Instance matching benchmarks for linked data, " presented at the Proc. of the 13th International Semantic Web Conference, Riva del Garda, Italy, oct 2014.
31. J. Euzenat and P. Shvaiko, Ontology Matching. Berlin Heidelberg (DE): Springer-Verlag, 2007.
32. A. McCallum, K. Nigam, and L. H. Ungar, "Efficient clustering of highdimensional data sets with application to reference matching, " in Proc. of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2000), New York, NY, USA, 2000, pp. 169-178.