2015 ExploitingRelevanceFeedbackinKn

Subject Headings:

Notes

The big data era is witnessing a prevalent shift of data from homogeneous to heterogeneous, from isolated to linked. Exemplar outcomes of this shift are a wide range of graph data such as information, social, and knowledge graphs. The unique characteristics of graph data are challenging traditional search techniques like SQL and keyword search. Graph query is emerging as a promising complementary search form. In this paper, we study how to improve graph query by relevance feedback. Specifically, we focus on knowledge graph query, and formulate the graph relevance feedback (GRF) problem. We propose a general GRF framework that is able to (1) tune the original ranking function based on user feedback and (2) further enrich the query itself by mining new features from user feedback. As a consequence, a query-specific ranking function is generated, which is better aligned with the user search intent. Given a newly learned ranking function based on user feedback, we further investigate whether we shall re-rank the existing answers, or choose to search from scratch. We propose a strategy to train a binary classifier to predict which action will be more beneficial for a given query. The GRF framework is applied to searching DBpedia with graph queries derived from YAGO and Wikipedia. Experiment results show that GRF can improve the mean average precision by 80% to 100%.

;

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2015 ExploitingRelevanceFeedbackinKn	Mudhakar Srivatsa Xifeng Yan Shengqi Yang Huan Sun Yu Su Sue Kase Michelle Vanni			Exploiting Relevance Feedback in Knowledge Graph Search				10.1145/2783258.2783320		2015