Concept cognition over knowledge graphs: A perspective from mining multi-granularity attribute characteristics of concepts

IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Xin Hu , Denan Huang , Jiangli Duan , Pingping Wu , Sulan Zhang , Wenqin Li
{"title":"Concept cognition over knowledge graphs: A perspective from mining multi-granularity attribute characteristics of concepts","authors":"Xin Hu ,&nbsp;Denan Huang ,&nbsp;Jiangli Duan ,&nbsp;Pingping Wu ,&nbsp;Sulan Zhang ,&nbsp;Wenqin Li","doi":"10.1016/j.ipm.2025.104095","DOIUrl":null,"url":null,"abstract":"<div><div>Humans can better understand and answer questions than machines because they know the cognitive knowledge related to the concept in questions. To equip machines with the cognitive knowledge required for cognizing concepts, concept cognition over knowledge graphs in this study involves mining the cognitive knowledge required by machines, i.e., multi-granularity attribute characteristics of concepts, which enables machines to distinguish or cognize concepts from multiple granularities. First, an algorithm is proposed to mine multi-granularity attributes characteristics of concepts from concept-related knowledge in a knowledge graph, i.e., frequent attributes and attribute values of concepts from multiple granularities. Second, the monotonicity of the multi-granularity attribute pattern is proposed to promote synergy among granularities and accelerate the mining process because the result from coarser granularity can serve as a candidate for the result from finer granularity. Third, the representativeness of the maximal frequent attribute pattern is used to unleash the value of above monotonicity and accelerate the mining process, which enables the algorithm to mine maximal frequent attribute patterns with fewer quantities to derive all frequent attribute patterns in large numbers. Finally, the experiments show that the above algorithm is more efficient than baseline algorithms, the monotonicity of the multi-granularity attribute patterns can accelerate the mining process, the representativeness of the maximal frequent attribute patterns means that the percentage is always less than 5%, the percentages of correctly classified instances by the multi-granularity attribute characteristics are always higher than 90%, and the above classification performance performs better than existing machine learning algorithms at most cases.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"62 4","pages":"Article 104095"},"PeriodicalIF":7.4000,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing & Management","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0306457325000378","RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Humans can better understand and answer questions than machines because they know the cognitive knowledge related to the concept in questions. To equip machines with the cognitive knowledge required for cognizing concepts, concept cognition over knowledge graphs in this study involves mining the cognitive knowledge required by machines, i.e., multi-granularity attribute characteristics of concepts, which enables machines to distinguish or cognize concepts from multiple granularities. First, an algorithm is proposed to mine multi-granularity attributes characteristics of concepts from concept-related knowledge in a knowledge graph, i.e., frequent attributes and attribute values of concepts from multiple granularities. Second, the monotonicity of the multi-granularity attribute pattern is proposed to promote synergy among granularities and accelerate the mining process because the result from coarser granularity can serve as a candidate for the result from finer granularity. Third, the representativeness of the maximal frequent attribute pattern is used to unleash the value of above monotonicity and accelerate the mining process, which enables the algorithm to mine maximal frequent attribute patterns with fewer quantities to derive all frequent attribute patterns in large numbers. Finally, the experiments show that the above algorithm is more efficient than baseline algorithms, the monotonicity of the multi-granularity attribute patterns can accelerate the mining process, the representativeness of the maximal frequent attribute patterns means that the percentage is always less than 5%, the percentages of correctly classified instances by the multi-granularity attribute characteristics are always higher than 90%, and the above classification performance performs better than existing machine learning algorithms at most cases.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Information Processing & Management
Information Processing & Management 工程技术-计算机:信息系统
CiteScore
17.00
自引率
11.60%
发文量
276
审稿时长
39 days
期刊介绍: Information Processing and Management is dedicated to publishing cutting-edge original research at the convergence of computing and information science. Our scope encompasses theory, methods, and applications across various domains, including advertising, business, health, information science, information technology marketing, and social computing. We aim to cater to the interests of both primary researchers and practitioners by offering an effective platform for the timely dissemination of advanced and topical issues in this interdisciplinary field. The journal places particular emphasis on original research articles, research survey articles, research method articles, and articles addressing critical applications of research. Join us in advancing knowledge and innovation at the intersection of computing and information science.
×
引用
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学术官方微信