Hypergraph-based Wikipedia search with semantics

G. Sadasivam, K. Saranya, K. G. Karrthik
{"title":"Hypergraph-based Wikipedia search with semantics","authors":"G. Sadasivam, K. Saranya, K. G. Karrthik","doi":"10.1504/IJWS.2013.056576","DOIUrl":null,"url":null,"abstract":"Wikipedia is a free, web-based encyclopaedia. This paper addresses the knowledge integration issue by computing semantic relatedness over a graph derived from Wikipedia by treating the articles as nodes and the links between the articles as the edges. Sentences with highest occurring keywords are extracted. These complex sentences are split into simple sentences and triplets with synonyms are extracted. A hypergraph structure is formed using hypernyms of the keywords to cluster the articles. Hypernyms extracted from the search query and keyword co-occurrences are used to extract relevant articles. Mapping the articles under the hypernyms category to an in-memory structure improves search efficiency and facilitates personalisation. The proposed work ensures the implied relationships between articles in the graph structure and maintenance of semantic relatedness between articles. Further, clustering the articles within the graph structure based on the hypernyms narrows down the search","PeriodicalId":425045,"journal":{"name":"Int. J. Web Sci.","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Web Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJWS.2013.056576","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Wikipedia is a free, web-based encyclopaedia. This paper addresses the knowledge integration issue by computing semantic relatedness over a graph derived from Wikipedia by treating the articles as nodes and the links between the articles as the edges. Sentences with highest occurring keywords are extracted. These complex sentences are split into simple sentences and triplets with synonyms are extracted. A hypergraph structure is formed using hypernyms of the keywords to cluster the articles. Hypernyms extracted from the search query and keyword co-occurrences are used to extract relevant articles. Mapping the articles under the hypernyms category to an in-memory structure improves search efficiency and facilitates personalisation. The proposed work ensures the implied relationships between articles in the graph structure and maintenance of semantic relatedness between articles. Further, clustering the articles within the graph structure based on the hypernyms narrows down the search
带有语义的基于超图的维基百科搜索
维基百科是一个免费的、基于网络的百科全书。本文将维基百科上的文章作为节点,文章之间的链接作为边,通过计算图的语义相关性来解决知识集成问题。提取出出现次数最高的关键字。这些复杂的句子被分解成简单的句子,并提取出带有同义词的三联体。用关键词的首字母构成一个超图结构来聚类文章。从搜索查询中提取的中词和关键词共现用于提取相关文章。将缩略词类别下的文章映射到内存结构可以提高搜索效率并促进个性化。所提出的工作确保了图结构中条目之间的隐含关系和条目之间的语义相关性的维护。此外,基于中词对图结构中的文章进行聚类可以缩小搜索范围
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信