Please use this identifier to cite or link to this item:
http://ir.futminna.edu.ng:8080/jspui/handle/123456789/11083
Title: | ENHANCED QUERY EXPANSION ALGORITHM: FRAMEWORK FOR EFFECTIVE ONTOLOGY BASED INFORMATION RETRIEVAL SYSTEM |
Authors: | Aminu, Enesi Femi Oyefolahan, Ishaq Oyebisi Abdullahi, Mohammad Bashir Salaudeen, Muhammadu Tajudeen |
Keywords: | Query Expansion, WordNet, Ontology, Information Retrieval, Synonym, Polysemy |
Issue Date: | 2019 |
Publisher: | i-manager’s Journal on Computer Science |
Abstract: | The strength of an Information Retrieval System lies on its ability to retrieve relevant information or documents according to user's intent by considering a high level of precision and a low level of irrelevant recall of results. A recent development to actualize this dream is the application of ontology. Therefore, Ontology-Based Information Retrieval is becoming an interesting area in the current research trend of ontology and semantic web. However, the sufficiency of developing domain ontology alone to efficiently and effectively take care of information retrieval becomes a research issue. Thus, to address the research gap, a technique called Query Expansion has been identified as a veritable tool. Query Expansion is a process of expanding initial user's query term(s) with the aid of a technology such as wordNet to return relevant results according to user's intent. But returns of query results using the existing wordNet is challenging in normal or inflected terms, such as synonyms or polysemy (word mismatch). Therefore, this paper proposes improved query expansion algorithm as framework to effectively and efficiently develop ontology based information retrieval system. |
URI: | http://repository.futminna.edu.ng:8080/jspui/handle/123456789/11083 |
Appears in Collections: | Information and Media Technology |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ENHANCED QUERY EXPANSION ALGORITHM FRAMEWORK FOR.pdf | 357.02 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.