IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Automatic Schema-Independent Linked Data Instance Matching System

Automatic Schema-Independent Linked Data Instance Matching System
View Sample PDF
Author(s): Khai Nguyen (The Graduate University for Advanced Studies, Japan & Ho Chi Minh City University of Science, Vietnam)and Ryutaro Ichise (The Graduate University for Advanced Studies, Japan)
Copyright: 2018
Pages: 24
Source title: Information Retrieval and Management: Concepts, Methodologies, Tools, and Applications
Source Author(s)/Editor(s): Information Resources Management Association (USA)
DOI: 10.4018/978-1-5225-5191-1.ch065

Purchase

View Automatic Schema-Independent Linked Data Instance Matching System on the publisher's website for pricing and purchasing information.

Abstract

The goal of linked data instance matching is to detect all instances that co-refer to the same objects in two linked data repositories, the source and the target. Since the amount of linked data is rapidly growing, it is important to automate this task. However, the difference between the schemata of source and target repositories remains a challenging barrier. This barrier reduces the portability, accuracy, and scalability of many proposed approaches. The authors present automatic schema-independent interlinking (ASL), which is a schema-independent system that performs instance matching on repositories with different schemata, without prior knowledge about the schemata. The key improvements of ASL compared to previous systems are the detection of useful attribute pairs for comparing instances, an attribute-driven token-based blocking scheme, and an effective modification of existing string similarities. To verify the performance of ASL, the authors conducted experiments on a large dataset containing 246 subsets with different schemata. The results show that ASL obtains high accuracy and significantly improves the quality of discovered coreferences against recently proposed complex systems.

Related Content

Hrithik Raj, Ritu Punhani, Ishika Punhani. © 2023. 31 pages.
Divi Anand, Isha Kaushik, Jasmehar Singh Mann, Ritu Punhani, Ishika Punhani. © 2023. 21 pages.
Jayanthi G., Purushothaman R.. © 2023. 10 pages.
Anshika Gupta, Shuchi Sirpal. © 2023. 14 pages.
Reet Kaur Kohli, Seneha Santoshi, Sunishtha S. Yadav, Vandana Chauhan. © 2023. 13 pages.
Poonam Tanwar. © 2023. 14 pages.
Monika Mehta, Shivani Mishra, Santosh Kumar, Muskaan Bansal. © 2023. 16 pages.
Body Bottom