{"title":"利用结构化和非结构化信息从知识图谱中进行事实计算验证","authors":"Saransh Khandelwal, D. Kumar","doi":"10.1145/3371158.3371187","DOIUrl":null,"url":null,"abstract":"In today's world, data or information is increasing at an exponential rate, and so is the fake news. Traditional fact-checking methods like fake news detection by experts, analysts, or some organizations do not match with the volume of information available. This is where the problem of computational fact-checking or validation becomes relevant. Given a Knowledge Graph, a knowledge corpus, and a fact (triple statement), the goal of fact-checking is to decide whether the fact or knowledge is correct or not. Existing approaches extensively used several structural features of the input Knowledge Graph to address the mentioned problem. In this work, our primary focus would be to leverage the unstructured information along with the structured ones. Our approach considers finding evidence from Wikipedia and structured information from Wikidata, which helps in determining the validity of the input facts. As features from the structured domain, we have used TransE embedding considering components of the input fact. The similarity of input fact with elements of relevant Wikipedia pages has been used as unstructured features. The experiments with a dataset consisting of nine relations of Wikidata has established the advantage of combining unstructured features with structured features for the given task.","PeriodicalId":360747,"journal":{"name":"Proceedings of the 7th ACM IKDD CoDS and 25th COMAD","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Computational Fact Validation from Knowledge Graph using Structured and Unstructured Information\",\"authors\":\"Saransh Khandelwal, D. Kumar\",\"doi\":\"10.1145/3371158.3371187\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In today's world, data or information is increasing at an exponential rate, and so is the fake news. Traditional fact-checking methods like fake news detection by experts, analysts, or some organizations do not match with the volume of information available. This is where the problem of computational fact-checking or validation becomes relevant. Given a Knowledge Graph, a knowledge corpus, and a fact (triple statement), the goal of fact-checking is to decide whether the fact or knowledge is correct or not. Existing approaches extensively used several structural features of the input Knowledge Graph to address the mentioned problem. In this work, our primary focus would be to leverage the unstructured information along with the structured ones. Our approach considers finding evidence from Wikipedia and structured information from Wikidata, which helps in determining the validity of the input facts. As features from the structured domain, we have used TransE embedding considering components of the input fact. The similarity of input fact with elements of relevant Wikipedia pages has been used as unstructured features. The experiments with a dataset consisting of nine relations of Wikidata has established the advantage of combining unstructured features with structured features for the given task.\",\"PeriodicalId\":360747,\"journal\":{\"name\":\"Proceedings of the 7th ACM IKDD CoDS and 25th COMAD\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-01-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 7th ACM IKDD CoDS and 25th COMAD\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3371158.3371187\",\"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 7th ACM IKDD CoDS and 25th COMAD","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3371158.3371187","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Computational Fact Validation from Knowledge Graph using Structured and Unstructured Information
In today's world, data or information is increasing at an exponential rate, and so is the fake news. Traditional fact-checking methods like fake news detection by experts, analysts, or some organizations do not match with the volume of information available. This is where the problem of computational fact-checking or validation becomes relevant. Given a Knowledge Graph, a knowledge corpus, and a fact (triple statement), the goal of fact-checking is to decide whether the fact or knowledge is correct or not. Existing approaches extensively used several structural features of the input Knowledge Graph to address the mentioned problem. In this work, our primary focus would be to leverage the unstructured information along with the structured ones. Our approach considers finding evidence from Wikipedia and structured information from Wikidata, which helps in determining the validity of the input facts. As features from the structured domain, we have used TransE embedding considering components of the input fact. The similarity of input fact with elements of relevant Wikipedia pages has been used as unstructured features. The experiments with a dataset consisting of nine relations of Wikidata has established the advantage of combining unstructured features with structured features for the given task.