DOPCA:一种计算本体语义相似度的新方法

Mingxin Gan, Xue Dou, Daoping Wang, R. Jiang
{"title":"DOPCA:一种计算本体语义相似度的新方法","authors":"Mingxin Gan, Xue Dou, Daoping Wang, R. Jiang","doi":"10.1109/ICIS.2011.25","DOIUrl":null,"url":null,"abstract":"Although semantic similarity has been broadly applied in artificial intelligence and related fields, the calculation of such similarity still remains a great challenge, appealing for the development of effective methods that can be flexibly applied to a diversity of domains. In this paper, we first review existing methods that rely on an ontology to calculate semantic similarity. We classify these methods into three categories: methods based on the structure of an ontology, methods based on the information content of an ontology, and methods that utilize multiple properties of an ontology in a hybrid manner, and we analyze the advantages and limitations of these methods. Then, we propose a novel method called DOPCA that relies on the structure of an ontology to calculate semantic similarity. Our method combines two similarity measures, the degrees of overlap in paths (DOP) and the depth of the lowest common ancestor node (DLCA), and uses their weighted summation to quantify the relatedness of terms in an ontology. We apply our method to the gene ontology (GO) and the plant ontology (PO), and we show the well agreement of our method with two existing methods. Finally, we show that our method is capable of overcoming the limitation of existing methods that overlook the existence of multiple lowest common ancestor nodes, and we analyze the flexibility of our method when applied to ontologies of different domains.","PeriodicalId":256762,"journal":{"name":"2011 10th IEEE/ACIS International Conference on Computer and Information Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"DOPCA: A New Method for Calculating Ontology-Based Semantic Similarity\",\"authors\":\"Mingxin Gan, Xue Dou, Daoping Wang, R. Jiang\",\"doi\":\"10.1109/ICIS.2011.25\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Although semantic similarity has been broadly applied in artificial intelligence and related fields, the calculation of such similarity still remains a great challenge, appealing for the development of effective methods that can be flexibly applied to a diversity of domains. In this paper, we first review existing methods that rely on an ontology to calculate semantic similarity. We classify these methods into three categories: methods based on the structure of an ontology, methods based on the information content of an ontology, and methods that utilize multiple properties of an ontology in a hybrid manner, and we analyze the advantages and limitations of these methods. Then, we propose a novel method called DOPCA that relies on the structure of an ontology to calculate semantic similarity. Our method combines two similarity measures, the degrees of overlap in paths (DOP) and the depth of the lowest common ancestor node (DLCA), and uses their weighted summation to quantify the relatedness of terms in an ontology. We apply our method to the gene ontology (GO) and the plant ontology (PO), and we show the well agreement of our method with two existing methods. Finally, we show that our method is capable of overcoming the limitation of existing methods that overlook the existence of multiple lowest common ancestor nodes, and we analyze the flexibility of our method when applied to ontologies of different domains.\",\"PeriodicalId\":256762,\"journal\":{\"name\":\"2011 10th IEEE/ACIS International Conference on Computer and Information Science\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 10th IEEE/ACIS International Conference on Computer and Information Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIS.2011.25\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 10th IEEE/ACIS International Conference on Computer and Information Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIS.2011.25","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

尽管语义相似度在人工智能及相关领域得到了广泛的应用,但这种相似度的计算仍然是一个巨大的挑战,需要开发能够灵活应用于多种领域的有效方法。在本文中,我们首先回顾了现有的依赖于本体来计算语义相似度的方法。我们将这些方法分为三类:基于本体结构的方法、基于本体信息内容的方法和混合利用本体多种属性的方法,并分析了这些方法的优点和局限性。在此基础上,提出了一种基于本体结构计算语义相似度的DOPCA方法。我们的方法结合了路径重叠度(DOP)和最低共同祖先节点深度(DLCA)两种相似性度量,并使用它们的加权和来量化本体中术语的相关性。将该方法应用于基因本体(GO)和植物本体(PO),结果表明该方法与现有的两种方法具有较好的一致性。最后,我们证明了我们的方法能够克服现有方法忽略多个最低共同祖先节点存在的局限性,并分析了我们的方法在应用于不同领域本体时的灵活性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
DOPCA: A New Method for Calculating Ontology-Based Semantic Similarity
Although semantic similarity has been broadly applied in artificial intelligence and related fields, the calculation of such similarity still remains a great challenge, appealing for the development of effective methods that can be flexibly applied to a diversity of domains. In this paper, we first review existing methods that rely on an ontology to calculate semantic similarity. We classify these methods into three categories: methods based on the structure of an ontology, methods based on the information content of an ontology, and methods that utilize multiple properties of an ontology in a hybrid manner, and we analyze the advantages and limitations of these methods. Then, we propose a novel method called DOPCA that relies on the structure of an ontology to calculate semantic similarity. Our method combines two similarity measures, the degrees of overlap in paths (DOP) and the depth of the lowest common ancestor node (DLCA), and uses their weighted summation to quantify the relatedness of terms in an ontology. We apply our method to the gene ontology (GO) and the plant ontology (PO), and we show the well agreement of our method with two existing methods. Finally, we show that our method is capable of overcoming the limitation of existing methods that overlook the existence of multiple lowest common ancestor nodes, and we analyze the flexibility of our method when applied to ontologies of different domains.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信