基于本体的文档语义相似排序

S. Thenmalar, T. Geetha, S. Devi
{"title":"基于本体的文档语义相似排序","authors":"S. Thenmalar, T. Geetha, S. Devi","doi":"10.1145/2007052.2007074","DOIUrl":null,"url":null,"abstract":"Semantic relatedness measures the degree to which some words or concepts are related, considering possible semantic relationships among them. Semantic relatedness is of great interest in different areas, such as Natural Language Processing, Information Retrieval, or the Semantic Web. This paper proposes policy based ranking of documents, where policy directs which path of the ontology tree is to be considered for semantic computation. An algorithm for ranking documents according to their relevance to a query is used. The given query is expanded based on the ontology concepts and the given polices. As the policy changes, the concept set used for the ranking algorithm varies. Depending on the requirements, using the same ontology, documents can be ranked differently based on the policies which in turn depend on the structure of the ontology. A ranking algorithm calculates the similarity degree of each document with respect to the user query.","PeriodicalId":348804,"journal":{"name":"International Conference on Advances in Computing and Artificial Intelligence","volume":"163 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Ontology based semantic similarly ranking of documents\",\"authors\":\"S. Thenmalar, T. Geetha, S. Devi\",\"doi\":\"10.1145/2007052.2007074\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Semantic relatedness measures the degree to which some words or concepts are related, considering possible semantic relationships among them. Semantic relatedness is of great interest in different areas, such as Natural Language Processing, Information Retrieval, or the Semantic Web. This paper proposes policy based ranking of documents, where policy directs which path of the ontology tree is to be considered for semantic computation. An algorithm for ranking documents according to their relevance to a query is used. The given query is expanded based on the ontology concepts and the given polices. As the policy changes, the concept set used for the ranking algorithm varies. Depending on the requirements, using the same ontology, documents can be ranked differently based on the policies which in turn depend on the structure of the ontology. A ranking algorithm calculates the similarity degree of each document with respect to the user query.\",\"PeriodicalId\":348804,\"journal\":{\"name\":\"International Conference on Advances in Computing and Artificial Intelligence\",\"volume\":\"163 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Advances in Computing and Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2007052.2007074\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Advances in Computing and Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2007052.2007074","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

语义相关性衡量一些词或概念的关联程度,考虑它们之间可能的语义关系。语义相关性在自然语言处理、信息检索或语义网等不同领域都引起了人们的极大兴趣。本文提出了一种基于策略的文档排序方法,其中策略指导在语义计算中考虑本体树的哪条路径。使用了一种根据与查询的相关性对文档进行排序的算法。根据本体概念和给定策略对给定查询进行扩展。随着策略的变化,排序算法使用的概念集也会发生变化。根据需求,使用相同的本体,可以根据策略对文档进行不同的排序,而策略又依赖于本体的结构。排序算法计算每个文档相对于用户查询的相似度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Ontology based semantic similarly ranking of documents
Semantic relatedness measures the degree to which some words or concepts are related, considering possible semantic relationships among them. Semantic relatedness is of great interest in different areas, such as Natural Language Processing, Information Retrieval, or the Semantic Web. This paper proposes policy based ranking of documents, where policy directs which path of the ontology tree is to be considered for semantic computation. An algorithm for ranking documents according to their relevance to a query is used. The given query is expanded based on the ontology concepts and the given polices. As the policy changes, the concept set used for the ranking algorithm varies. Depending on the requirements, using the same ontology, documents can be ranked differently based on the policies which in turn depend on the structure of the ontology. A ranking algorithm calculates the similarity degree of each document with respect to the user query.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Secured routing over MANET with power management A comparative study of UML tools Automated taxi/cab system using A* algorithm Ontology based semantic similarly ranking of documents Security policy implementation using connection and event log to achieve network access control
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1