{"title":"基于张量的网络物理-社会系统知识融合与推理:理论与框架","authors":"Jing Yang, L. Yang, Yuan Gao, Huazhong Liu, Hao Wang, Xia Xie","doi":"10.1109/MSMC.2021.3114538","DOIUrl":null,"url":null,"abstract":"Cyberphysical-social systems (CPSS) integrate human, machine, and information into large-scale automated systems and generate complex heterogeneous big data from multiple sources. Knowledge graphs play a pivotal role in energizing the data with huge volume and uneven quality to drive CPSS intelligent applications and services, thus attracting intense research interests from scholars. The Resource Description Framework (RDF) describes knowledge in the form of subject-predicate-object triples and interpreted as directed labeled graphs. However, the graph structure doesn’t have flexible operability and direct computability in the theoretical framework, although it can be understood intuitively. Therefore, we proposed a tensor-based knowledge analysis framework in this article, which supports the representation, fusion, and reasoning of knowledge graphs. First, we employ Boolean tensors to represent heterogeneous knowledge graphs completely. Then, we present a series of graph tensor operations for the modification, extraction, and aggregation of high-order knowledge graphs. Furthermore, we perform tensor 1-mode product operation between the knowledge graph representation tensor and the entity representation tensor to obtain the relation path tensor, so as to infer the relationship between any two entities. Finally, we demonstrate the practicality and effectiveness of the proposed model by implementing a case study.","PeriodicalId":43649,"journal":{"name":"IEEE Systems Man and Cybernetics Magazine","volume":"39 1","pages":"31-38"},"PeriodicalIF":1.9000,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Tensor-Based Knowledge Fusion and Reasoning for Cyberphysical-Social Systems: Theory and Framework\",\"authors\":\"Jing Yang, L. Yang, Yuan Gao, Huazhong Liu, Hao Wang, Xia Xie\",\"doi\":\"10.1109/MSMC.2021.3114538\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cyberphysical-social systems (CPSS) integrate human, machine, and information into large-scale automated systems and generate complex heterogeneous big data from multiple sources. Knowledge graphs play a pivotal role in energizing the data with huge volume and uneven quality to drive CPSS intelligent applications and services, thus attracting intense research interests from scholars. The Resource Description Framework (RDF) describes knowledge in the form of subject-predicate-object triples and interpreted as directed labeled graphs. However, the graph structure doesn’t have flexible operability and direct computability in the theoretical framework, although it can be understood intuitively. Therefore, we proposed a tensor-based knowledge analysis framework in this article, which supports the representation, fusion, and reasoning of knowledge graphs. First, we employ Boolean tensors to represent heterogeneous knowledge graphs completely. Then, we present a series of graph tensor operations for the modification, extraction, and aggregation of high-order knowledge graphs. Furthermore, we perform tensor 1-mode product operation between the knowledge graph representation tensor and the entity representation tensor to obtain the relation path tensor, so as to infer the relationship between any two entities. Finally, we demonstrate the practicality and effectiveness of the proposed model by implementing a case study.\",\"PeriodicalId\":43649,\"journal\":{\"name\":\"IEEE Systems Man and Cybernetics Magazine\",\"volume\":\"39 1\",\"pages\":\"31-38\"},\"PeriodicalIF\":1.9000,\"publicationDate\":\"2022-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Systems Man and Cybernetics Magazine\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MSMC.2021.3114538\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, CYBERNETICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Systems Man and Cybernetics Magazine","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MSMC.2021.3114538","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}
Tensor-Based Knowledge Fusion and Reasoning for Cyberphysical-Social Systems: Theory and Framework
Cyberphysical-social systems (CPSS) integrate human, machine, and information into large-scale automated systems and generate complex heterogeneous big data from multiple sources. Knowledge graphs play a pivotal role in energizing the data with huge volume and uneven quality to drive CPSS intelligent applications and services, thus attracting intense research interests from scholars. The Resource Description Framework (RDF) describes knowledge in the form of subject-predicate-object triples and interpreted as directed labeled graphs. However, the graph structure doesn’t have flexible operability and direct computability in the theoretical framework, although it can be understood intuitively. Therefore, we proposed a tensor-based knowledge analysis framework in this article, which supports the representation, fusion, and reasoning of knowledge graphs. First, we employ Boolean tensors to represent heterogeneous knowledge graphs completely. Then, we present a series of graph tensor operations for the modification, extraction, and aggregation of high-order knowledge graphs. Furthermore, we perform tensor 1-mode product operation between the knowledge graph representation tensor and the entity representation tensor to obtain the relation path tensor, so as to infer the relationship between any two entities. Finally, we demonstrate the practicality and effectiveness of the proposed model by implementing a case study.