Monthly Archives: 五月 2016

  • -

讲座信息:Discovering Neighborhood Pattern Queries by Sample Answers in Knowledge Base

Category : 未分类

时间: 14:00-15:00, May. 6, 2016
题目: Discovering Neighborhood Pattern Queries by Sample Answers in Knowledge Base
演讲者: Jialong Han博士, Nanyang Technological University

Abstract: Knowledge bases have shown their effectiveness in facilitating services like Web search and question-answering. Nevertheless, it remains challenging for ordinary users to fully understand the structure of a knowledge base and to issue structural queries. In many cases, users may have a natural language question and also know some popular (but not all) entities as sample answers. In this paper, we study the Reverse top-k Neighborhood Pattern Query problem, with the aim of discovering structural queries of the question based on: (i) the structure of the knowledge base, and (ii) the sample answers of the question. The proposed solution contains two phases: filter and refine. In the filter phase, a search space of candidate queries is systematically explored. The invalid queries whose result sets do not fully cover the sample answers are filtered out. In the refine phase, all surviving queries are verified to ensure that they are sufficiently relevant to the sample answers, with the assumption that the sample answers are more well-known or popular than other entities in the results of relevant queries. Several optimization techniques are proposed to accelerate the refine phrase. For evaluation, we conduct extensive experiments using the DBpedia knowledge base and a set of real-life questions. Empirical results show that our algorithm is able to provide a small set of possible queries, which contains the query matching the user question in natural language.

Short Bio:Jialong Han is a postdoctoral research fellow at School of Computer Science and Engineering, Nanyang Technological University. He earned his Ph.D. degree from Renmin University of China in 2015, under the supervision of Prof. Ji-Rong Wen. He obtained his B.E. degree also from Renmin University of China in 2010. His research interests include graph mining, graph data management, and knowledge bases.