Cart (Loading....) | Create Account
Close category search window
 

Quantum Path Integral Inspired Query Sequence Suggestion for User Search Task Simplification

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
$31 $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

7 Author(s)
Baojun Yue ; Dept. of Math. Sci., Tsinghua Univ., Beijing, China ; Jun Yan ; Heng Liang ; Ning Liu
more authors

Query suggestion algorithms, which aim to suggest a set of similar but independent queries to users, have been widely studied to simplify user searches. However, in many cases, the users will accomplish their search tasks through a sequence of search behaviors instead of by one single query, which may make the classical query suggestion algorithms fail to satisfy end users in terms of task completion. In this paper, we propose a quantum path integral inspired algorithm for personalized user search behavior prediction, through which we can provide sequential query suggestions to assist the users complete their search tasks step by step. In detail, we consider the sequential search behavior of a user as a trajectory of a particle that moves in a query space. The query space is represented by a graph with each node is a query, which is named as query-path graph. Inspired by the quantum theorems, each edge in query-path graph is represented by both amplitude and phase respectively. Using this graph, we modify the quantum path integral algorithm to predict a user's follow-up trajectory based on her behavioral history in this graph. We empirically show that the proposed algorithm can well predict the user search behavior and outperform classical query suggestion algorithms for user search task completion using the search log of a commercial search engine.

Published in:

Data Mining Workshops (ICDMW), 2010 IEEE International Conference on

Date of Conference:

13-13 Dec. 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.