Similarity from conceptual relations

T. Andreasen, H. Bulskov, R. Knappe
{"title":"Similarity from conceptual relations","authors":"T. Andreasen, H. Bulskov, R. Knappe","doi":"10.1109/NAFIPS.2003.1226777","DOIUrl":null,"url":null,"abstract":"The main focus of this paper is how to measure similarity in a content-based information retrieval environment. In the first part we define the information base, which is a generative framework where an ontology in combination with a concept language defines a set of well-formed concepts. Well-formed concepts is assumed to be the basis for an indexing of the information base in the sense that these concepts appear in descriptions attached to objects in the base. Subsequent and last we introduce an approach for measuring similarity in this framework. The measuring problem is divided into to continuous parts where we first narrow what concepts have in common, and secondly use this fragment, a similarity graph, for calculating the similarity between concepts. The purpose of narrowing or restricting what concepts have in common is to manage the generative aspect of the ontology, and to retain the greatest possible number of shared attributes and characteristics of the concepts being compared. Taking the similarity graphs as input we discuss what properties a similarity function need to satisfy to measure the degree of similarity proportional to how close the concepts are or how much they share.","PeriodicalId":153530,"journal":{"name":"22nd International Conference of the North American Fuzzy Information Processing Society, NAFIPS 2003","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"22nd International Conference of the North American Fuzzy Information Processing Society, NAFIPS 2003","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAFIPS.2003.1226777","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

The main focus of this paper is how to measure similarity in a content-based information retrieval environment. In the first part we define the information base, which is a generative framework where an ontology in combination with a concept language defines a set of well-formed concepts. Well-formed concepts is assumed to be the basis for an indexing of the information base in the sense that these concepts appear in descriptions attached to objects in the base. Subsequent and last we introduce an approach for measuring similarity in this framework. The measuring problem is divided into to continuous parts where we first narrow what concepts have in common, and secondly use this fragment, a similarity graph, for calculating the similarity between concepts. The purpose of narrowing or restricting what concepts have in common is to manage the generative aspect of the ontology, and to retain the greatest possible number of shared attributes and characteristics of the concepts being compared. Taking the similarity graphs as input we discuss what properties a similarity function need to satisfy to measure the degree of similarity proportional to how close the concepts are or how much they share.
概念关系的相似性
本文主要研究的是如何在基于内容的信息检索环境中度量相似度。在第一部分中,我们定义了信息库,这是一个生成框架,其中本体与概念语言结合定义了一组格式良好的概念。格式良好的概念被认为是信息库索引的基础,因为这些概念出现在附加到信息库中的对象的描述中。随后和最后,我们介绍了在该框架中测量相似性的方法。度量问题被分成连续的部分,我们首先缩小概念的共同之处,然后使用这个片段,一个相似图,来计算概念之间的相似度。缩小或限制概念的共同之处的目的是管理本体的生成方面,并保留尽可能多的正在比较的概念的共享属性和特征。以相似图作为输入,我们讨论了相似函数需要满足哪些属性来度量与概念的接近程度或共享程度成比例的相似度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信