Argumentation-based schema matching for multiple digital libraries

שמור ב:
מידע ביבליוגרפי
הוצא לאור ב:Online Information Review vol. 39, no. 1 (2015), p. 81-103
מחבר ראשי: Quan, Tho Thanh
מחברים אחרים: Luong, Xuan H., Nguyen, Thanh C., Cheung, Hui Siu
יצא לאור:
Emerald Group Publishing Limited
נושאים:
גישה מקוונת:Citation/Abstract
Full Text
Full Text - PDF
תגים: הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!

MARC

LEADER 00000nab a2200000uu 4500
001 1655249772
003 UK-CbPIL
022 |a 1468-4527 
022 |a 1468-4535 
022 |a 0309-314X 
022 |a 1353-2642 
024 7 |a 10.1108/OIR-02-2014-0023  |2 doi 
035 |a 1655249772 
045 2 |b d20150101  |b d20150214 
084 |a 36206  |2 nlm 
100 1 |a Quan, Tho Thanh 
245 1 |a Argumentation-based schema matching for multiple digital libraries 
260 |b Emerald Group Publishing Limited  |c 2015 
513 |a Journal Article 
520 3 |a Purpose - Most digital libraries (DL) are now available online. They also provide the Z39.50 standard protocol which allows computer-based systems to effectively retrieve information stored in the DLs. The major difficulty lies in inconsistency between database schemas of multiple DLs. The purpose of this paper is to present a system known as Argumentation-based Digital Library Search (ADLSearch), which facilitates information retrieval across multiple DLs. Design/methodology/approach - The proposed approach is based on argumentation theory for schema matching reconciliation from multiple schema matching algorithms. In addition, a distributed architecture is proposed for the ADLSearch system for information retrieval from multiple DLs. Findings - Initial performance results are promising. First, schema matching can improve the retrieval performance on DLs, as compared to the baseline technique. Subsequently, argumentation-based retrieval can yield better matching accuracy and retrieval efficiency than individual schema matching algorithms. Research limitations/implications - The work discussed in this paper has been implemented as a prototype supporting scholarly retrieval from about 800 DLs over the world. However, due to complexity of argumentation algorithm, the process of adding new DLs to the system cannot be performed in a real-time manner. Originality/value - In this paper, an argumentation-based approach is proposed for reconciling the conflicts from multiple schema matching algorithms in the context of information retrieval from multiple DL. Moreover, the proposed approach can also be applied for similar applications which require automatic mapping from multiple database schemas. 
653 |a Academic libraries 
653 |a Algorithms 
653 |a Data processing 
653 |a Information retrieval 
653 |a Computer engineering 
653 |a Computer science 
653 |a Semantics 
653 |a Software engineering 
653 |a Digital libraries 
653 |a Methods 
653 |a Databases 
653 |a Big Data 
653 |a Data mining 
653 |a Search engines 
653 |a Ontology 
653 |a Semantic web 
653 |a Libraries 
653 |a Prototypes 
653 |a Mapping 
653 |a Inconsistency 
653 |a Information 
653 |a Schemas 
653 |a Argumentation 
653 |a Retrieval 
653 |a Matching 
653 |a Debates 
653 |a Electronic Libraries 
653 |a Persuasive Discourse 
653 |a Mathematics 
653 |a Information Sources 
653 |a Language Processing 
653 |a Semiotics 
653 |a Research Problems 
700 1 |a Luong, Xuan H. 
700 1 |a Nguyen, Thanh C. 
700 1 |a Cheung, Hui Siu 
773 0 |t Online Information Review  |g vol. 39, no. 1 (2015), p. 81-103 
786 0 |d ProQuest  |t ABI/INFORM Global 
856 4 1 |3 Citation/Abstract  |u https://www.proquest.com/docview/1655249772/abstract/embedded/ZKJTFFSVAI7CB62C?source=fedsrch 
856 4 0 |3 Full Text  |u https://www.proquest.com/docview/1655249772/fulltext/embedded/ZKJTFFSVAI7CB62C?source=fedsrch 
856 4 0 |3 Full Text - PDF  |u https://www.proquest.com/docview/1655249772/fulltextPDF/embedded/ZKJTFFSVAI7CB62C?source=fedsrch