Jeongbin Kim, Jiyoon Kim, Hyeonseong Jo, Jason J. Jung, David Camacho
{"title":"基于启发式算法的复杂问题多领域知识图谱搜索","authors":"Jeongbin Kim, Jiyoon Kim, Hyeonseong Jo, Jason J. Jung, David Camacho","doi":"10.1109/iiai-aai53430.2021.00080","DOIUrl":null,"url":null,"abstract":"Question answering (QA) system is widely used because it finds the information that users want. Users can ask a variety of questions to the QA system, and the type of question is divided into a simple question and a complex question. A simple question is one query with one question while a complex question is one query with two or more questions. Although many studies have greatly improved the ability of the QA system to answer simple questions, answering complex questions remains a difficult problem. To solve the problem, we use the information from multiple domains and propose a method to quickly retrieve information from many data through a heuristic algorithm. For experiments, we use the movie, person, and country domain data as a knowledge base for the QA system, which is able to help solve the complex question. Compared to the widely used graph search algorithm Breadth-First Search (BFS) and Depth-First Search (DFS), the proposed method reduces the search time by 62% and 44% for finding the answers, respectively.","PeriodicalId":414070,"journal":{"name":"2021 10th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multiple Domains Knowledge Graph Search via Heuristic Algorithm for Answering Complex Questions\",\"authors\":\"Jeongbin Kim, Jiyoon Kim, Hyeonseong Jo, Jason J. Jung, David Camacho\",\"doi\":\"10.1109/iiai-aai53430.2021.00080\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Question answering (QA) system is widely used because it finds the information that users want. Users can ask a variety of questions to the QA system, and the type of question is divided into a simple question and a complex question. A simple question is one query with one question while a complex question is one query with two or more questions. Although many studies have greatly improved the ability of the QA system to answer simple questions, answering complex questions remains a difficult problem. To solve the problem, we use the information from multiple domains and propose a method to quickly retrieve information from many data through a heuristic algorithm. For experiments, we use the movie, person, and country domain data as a knowledge base for the QA system, which is able to help solve the complex question. Compared to the widely used graph search algorithm Breadth-First Search (BFS) and Depth-First Search (DFS), the proposed method reduces the search time by 62% and 44% for finding the answers, respectively.\",\"PeriodicalId\":414070,\"journal\":{\"name\":\"2021 10th International Congress on Advanced Applied Informatics (IIAI-AAI)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 10th International Congress on Advanced Applied Informatics (IIAI-AAI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/iiai-aai53430.2021.00080\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 10th International Congress on Advanced Applied Informatics (IIAI-AAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iiai-aai53430.2021.00080","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Multiple Domains Knowledge Graph Search via Heuristic Algorithm for Answering Complex Questions
Question answering (QA) system is widely used because it finds the information that users want. Users can ask a variety of questions to the QA system, and the type of question is divided into a simple question and a complex question. A simple question is one query with one question while a complex question is one query with two or more questions. Although many studies have greatly improved the ability of the QA system to answer simple questions, answering complex questions remains a difficult problem. To solve the problem, we use the information from multiple domains and propose a method to quickly retrieve information from many data through a heuristic algorithm. For experiments, we use the movie, person, and country domain data as a knowledge base for the QA system, which is able to help solve the complex question. Compared to the widely used graph search algorithm Breadth-First Search (BFS) and Depth-First Search (DFS), the proposed method reduces the search time by 62% and 44% for finding the answers, respectively.