Changlong Wang, Siyun Bi, Rong Zhang, Qibin Fu, Tingting Gan
{"title":"知识图谱的模块化推理方法","authors":"Changlong Wang, Siyun Bi, Rong Zhang, Qibin Fu, Tingting Gan","doi":"10.1109/ICACTE55855.2022.9943760","DOIUrl":null,"url":null,"abstract":"The construction and application of Knowledge Graph require effective reasoning support. However, the standard reasoning engines can not effectively deal with large-scale Knowledge Graphs because they load and compute Knowledge Graphs as a whole. This paper proposes a modular reasoning approach to Knowledge Graph. Firstly, the facts in the Knowledge Graph are partitioned into modules according to the predicate type and entity. Then the concepts and attributes involved in the fact module are used as seed signatures to extract the ontology module from the schema. During the reasoning procedure, the reasoning engine partially loads fact modules and the related ontology modules. Experiments show that the proposed approach can deal with large-scale Knowledge Graphs in a modular way with less time and memory.","PeriodicalId":165068,"journal":{"name":"2022 15th International Conference on Advanced Computer Theory and Engineering (ICACTE)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Modular Reasoning Approach to Knowledge Graph\",\"authors\":\"Changlong Wang, Siyun Bi, Rong Zhang, Qibin Fu, Tingting Gan\",\"doi\":\"10.1109/ICACTE55855.2022.9943760\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The construction and application of Knowledge Graph require effective reasoning support. However, the standard reasoning engines can not effectively deal with large-scale Knowledge Graphs because they load and compute Knowledge Graphs as a whole. This paper proposes a modular reasoning approach to Knowledge Graph. Firstly, the facts in the Knowledge Graph are partitioned into modules according to the predicate type and entity. Then the concepts and attributes involved in the fact module are used as seed signatures to extract the ontology module from the schema. During the reasoning procedure, the reasoning engine partially loads fact modules and the related ontology modules. Experiments show that the proposed approach can deal with large-scale Knowledge Graphs in a modular way with less time and memory.\",\"PeriodicalId\":165068,\"journal\":{\"name\":\"2022 15th International Conference on Advanced Computer Theory and Engineering (ICACTE)\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 15th International Conference on Advanced Computer Theory and Engineering (ICACTE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICACTE55855.2022.9943760\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 15th International Conference on Advanced Computer Theory and Engineering (ICACTE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACTE55855.2022.9943760","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The construction and application of Knowledge Graph require effective reasoning support. However, the standard reasoning engines can not effectively deal with large-scale Knowledge Graphs because they load and compute Knowledge Graphs as a whole. This paper proposes a modular reasoning approach to Knowledge Graph. Firstly, the facts in the Knowledge Graph are partitioned into modules according to the predicate type and entity. Then the concepts and attributes involved in the fact module are used as seed signatures to extract the ontology module from the schema. During the reasoning procedure, the reasoning engine partially loads fact modules and the related ontology modules. Experiments show that the proposed approach can deal with large-scale Knowledge Graphs in a modular way with less time and memory.