상세 보기
Multiple Domains Knowledge Graph Search via Heuristic Algorithm for Answering Complex Questions
- Kim, J.;
- Kim, J.;
- Jo, H.;
- Jung, Jason J.;
- Camacho, D.
SCOPUS
0초록
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.
키워드
- 제목
- Multiple Domains Knowledge Graph Search via Heuristic Algorithm for Answering Complex Questions
- 저자
- Kim, J.; Kim, J.; Jo, H.; Jung, Jason J.; Camacho, D.
- 발행일
- 2021-07
- 유형
- Conference Paper
- 저널명
- Proceedings - 2021 10th International Congress on Advanced Applied Informatics, IIAI-AAI 2021
- 페이지
- 464 ~ 469
- 언어
- ENG
- 출판사
- Institute of Electrical and Electronics Engineers Inc.
- 분량
- 6 페이지
- ISSN
- P 0000-0000