Multiple Domains Knowledge Graph Search via Heuristic Algorithm for Answering Complex Questions

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.