SCALABLE INFORMATION RETRIEVAL SYSTEM IN SEMANTIC WEB BY QUERY EXPANSION AND ONTOLOGICAL BASED LSA RANKING SIMILARITY MEASUREMENT

Q3 Engineering
M. Devi, G. Gandhi
{"title":"SCALABLE INFORMATION RETRIEVAL SYSTEM IN SEMANTIC WEB BY QUERY EXPANSION AND ONTOLOGICAL BASED LSA RANKING SIMILARITY MEASUREMENT","authors":"M. Devi, G. Gandhi","doi":"10.1504/IJAIP.2020.10013899","DOIUrl":null,"url":null,"abstract":"In recent days, semantic web presents a key role in intelligent retrieval of information system that resolves vocabulary mismatch problem by query expansion process. However, achieving the scalable information retrieval (IR) in semantic web is a challenging issue in a large dataset. The semantic IR problem is addressed by an ontological-based semantic similarity measurement using natural language processing. The two novel algorithms namely syntactic correlation coefficient (SCC) and mapping-based K-nearest neighbour (M-KNN) for semantic similarity measurement is proposed which improves the accuracy of relevant result. The ontological constructs with word sense disambiguation (WSD) algorithm for document repository improves the conceptual relationships, reduces the ambiguities in ontology and improves scalability by intensely analysing the semantic relationship as well as dynamically reconstructing the ontology when numbers of documents are updated. Ranking is done with latent semantic analysis (LSA) after semantic similarity analysis, which improves the retrieved result and reduces the complexity in relevancy. The performance of the system is analysed with respect to different metrics such as processing time, F-measure (0.97), time complexity, precision (0.95), recall (0.98) and space complexity.","PeriodicalId":38797,"journal":{"name":"International Journal of Advanced Intelligence Paradigms","volume":"17 1","pages":"44-66"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Advanced Intelligence Paradigms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJAIP.2020.10013899","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 3

Abstract

In recent days, semantic web presents a key role in intelligent retrieval of information system that resolves vocabulary mismatch problem by query expansion process. However, achieving the scalable information retrieval (IR) in semantic web is a challenging issue in a large dataset. The semantic IR problem is addressed by an ontological-based semantic similarity measurement using natural language processing. The two novel algorithms namely syntactic correlation coefficient (SCC) and mapping-based K-nearest neighbour (M-KNN) for semantic similarity measurement is proposed which improves the accuracy of relevant result. The ontological constructs with word sense disambiguation (WSD) algorithm for document repository improves the conceptual relationships, reduces the ambiguities in ontology and improves scalability by intensely analysing the semantic relationship as well as dynamically reconstructing the ontology when numbers of documents are updated. Ranking is done with latent semantic analysis (LSA) after semantic similarity analysis, which improves the retrieved result and reduces the complexity in relevancy. The performance of the system is analysed with respect to different metrics such as processing time, F-measure (0.97), time complexity, precision (0.95), recall (0.98) and space complexity.
基于查询扩展和本体的lsa排序相似度度量的语义网可扩展信息检索系统
近年来,语义网在信息系统的智能检索中发挥着关键作用,它通过查询扩展过程来解决词汇不匹配问题。然而,在大型数据集中,实现语义网中的可伸缩信息检索是一个具有挑战性的问题。语义IR问题是通过使用自然语言处理的基于本体论的语义相似性测量来解决的。提出了两种新的语义相似性度量算法,即句法相关系数(SCC)和基于映射的K-近邻(M-KNN),提高了相关结果的准确性。基于词义消歧(WSD)算法的文档库本体结构通过深入分析语义关系以及在文档数量更新时动态重构本体,改善了概念关系,减少了本体中的歧义,提高了可扩展性。在进行语义相似度分析后,利用潜在语义分析(LSA)进行排序,提高了检索结果,降低了关联度的复杂度。根据不同的指标分析了系统的性能,如处理时间、F-测度(0.97)、时间复杂性、精度(0.95)、召回率(0.98)和空间复杂性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.70
自引率
0.00%
发文量
92
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信