{"title":"知识图谱及其应用的最新趋势","authors":"S. Kannadhasan, R. Nagarajan","doi":"10.4108/eai.14-5-2022.2318897","DOIUrl":null,"url":null,"abstract":": In the area of the Intelligent Network, the representations of an information graph have sparked a lot of research interest. Language-based approaches treat each relationship as a single translation from head to tail like Trans E, Trans H and Trans R are simple, efficient and achieving the art state efficiency. Information graphs convey knowledge as a graph with marked edges (relationships) between nodes (entities). The completion of the information graph is an essential activity aimed at predicting the missing relationship between entities.","PeriodicalId":256486,"journal":{"name":"Proceedings of the International Conference on Intelligent Technologies in Security and Privacy for Wireless Communication, ITSPWC 2022, 14-15 May 2022, Karur, Tamilnadu, India","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Recent Trends in Knowledge Graphs and its Applications\",\"authors\":\"S. Kannadhasan, R. Nagarajan\",\"doi\":\"10.4108/eai.14-5-2022.2318897\",\"DOIUrl\":null,\"url\":null,\"abstract\":\": In the area of the Intelligent Network, the representations of an information graph have sparked a lot of research interest. Language-based approaches treat each relationship as a single translation from head to tail like Trans E, Trans H and Trans R are simple, efficient and achieving the art state efficiency. Information graphs convey knowledge as a graph with marked edges (relationships) between nodes (entities). The completion of the information graph is an essential activity aimed at predicting the missing relationship between entities.\",\"PeriodicalId\":256486,\"journal\":{\"name\":\"Proceedings of the International Conference on Intelligent Technologies in Security and Privacy for Wireless Communication, ITSPWC 2022, 14-15 May 2022, Karur, Tamilnadu, India\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the International Conference on Intelligent Technologies in Security and Privacy for Wireless Communication, ITSPWC 2022, 14-15 May 2022, Karur, Tamilnadu, India\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4108/eai.14-5-2022.2318897\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the International Conference on Intelligent Technologies in Security and Privacy for Wireless Communication, ITSPWC 2022, 14-15 May 2022, Karur, Tamilnadu, India","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4108/eai.14-5-2022.2318897","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
在智能网络领域,信息图的表示引起了很多研究的兴趣。基于语言的方法将每个关系视为从头到尾的单个翻译,如Trans E, Trans H和Trans R,简单,高效,达到了艺术状态的效率。信息图以节点(实体)之间带有标记边(关系)的图的形式传达知识。信息图的完成是预测实体之间缺失关系的基本活动。
Recent Trends in Knowledge Graphs and its Applications
: In the area of the Intelligent Network, the representations of an information graph have sparked a lot of research interest. Language-based approaches treat each relationship as a single translation from head to tail like Trans E, Trans H and Trans R are simple, efficient and achieving the art state efficiency. Information graphs convey knowledge as a graph with marked edges (relationships) between nodes (entities). The completion of the information graph is an essential activity aimed at predicting the missing relationship between entities.