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

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.

[1]  Hector Garcia-Molina,et al.  Combating Web Spam with TrustRank , 2004, VLDB.

[2]  Nick Craswell,et al.  Random walks on the click graph , 2007, SIGIR.

[3]  Jun Wang,et al.  A User-Item Relevance Model for Log-Based Collaborative Filtering , 2006, ECIR.

[4]  Douglas B. Terry,et al.  Using collaborative filtering to weave an information tapestry , 1992, CACM.

[5]  Qiang Yang,et al.  Scalable collaborative filtering using cluster-based smoothing , 2005, SIGIR '05.

[6]  Ji-Rong Wen,et al.  Clustering user queries of a search engine , 2001, WWW '01.

[7]  Kenneth Ward Church,et al.  Query suggestion using hitting time , 2008, CIKM '08.

[8]  Lu Wang,et al.  Clustering query refinements by user intent , 2010, WWW '10.

[9]  A. Das.  Path Integrals and Quantum Mechanics , 1993 .

[10]  Mark Levene,et al.  A Probabilistic Approach to Navigation in Hypertext , 1999, Inf. Sci..

[11]  Olfa Nasraoui,et al.  Mining search engine query logs for query recommendation , 2006, WWW '06.

[12]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[13]  Michael McGill,et al.  Introduction to Modern Information Retrieval , 1983 .

[14]  Kevyn Collins-Thompson,et al.  Query expansion using random walk models , 2005, CIKM '05.

[15]  Rosie Jones,et al.  Beyond the session timeout: automatic hierarchical segmentation of search topics in query logs , 2008, CIKM '08.

[16]  V. Chvátal,et al.  Longest common subsequences of two random sequences , 1975, Advances in Applied Probability.

[17]  Joan Fisher Box,et al.  Guinness, Gosset, Fisher, and Small Samples , 1987 .

[18]  Ricardo A. Baeza-Yates,et al.  Graphs from Search Engine Queries , 2007, SOFSEM.

[19]  Filip Radlinski,et al.  Query chains: learning to rank from implicit feedback , 2005, KDD '05.

[20]  Aristides Gionis,et al.  The query-flow graph: model and applications , 2008, CIKM '08.

[21]  Taher H. Haveliwala.  Topic-sensitive PageRank , 2002, IEEE Trans. Knowl. Data Eng..

[22]  Tamotsu Kasai,et al.  A Method for the Correction of Garbled Words Based on the Levenshtein Metric , 1976, IEEE Transactions on Computers.

[23]  Richard A. Harshman,et al.  Indexing by Latent Semantic Analysis , 1990, J. Am. Soc. Inf. Sci..

[24]  Enhong Chen,et al.  Context-aware query suggestion by mining click-through and session data , 2008, KDD.

[25]  Taher H. Haveliwala.  Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search , 2003, IEEE Trans. Knowl. Data Eng..

[26]  Shigenobu Kobayashi,et al.  Link analysis for private weighted graphs , 2009, SIGIR.

[27]  Ryen W. White,et al.  Stream prediction using a generative model based on frequent episodes in event sequences , 2008, KDD.

[28]  Nivio Ziviani,et al.  Using association rules to discover search engines related queries , 2003, Proceedings of the IEEE/LEOS 3rd International Conference on Numerical Simulation of Semiconductor Optoelectronic Devices (IEEE Cat. No.03EX726).