By Topic

A Social-Knowledge-Directed Query Suggestion Approach for Exploratory Search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yuqing Mao ; Sch. of Comput. Eng., Nanyang Technol. Univ., Singapore, Singapore ; Haifeng Shen ; Chengzheng Sun

Existing query suggestion techniques mainly revolve around mining existing queries that are most similar to a given query. If the query fails to precisely capture a user's real intent, for example, in most exploratory search tasks, suggested queries are likely to fail as well. If suggested queries are not only relevant to the query but also diverse in nature, it is likely that some of them are close to the user's real intent. In this paper, we propose a novel social-knowledge-directed query suggestion approach for exploratory search, which integrates the social knowledge into the probabilistic model based on query-URL bipartite graphs. Social knowledge is discovered by conducting kernel principle component analysis on the related queries, and incorporating the social knowledge with random walk on the bipartite graph can obtain diverse queries that are relevant to a given one. We have conducted a set of experiments to validate this approach and the results show that this approach outperforms other query suggestion methods in terms of supporting exploratory search.

Published in:

Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), 2011 International Conference on

Date of Conference:

10-12 Oct. 2011