Next Article in Journal
Thermodynamic Black Holes
Next Article in Special Issue
A Novel Delay Linear Coupling Logistics Map Model for Color Image Encryption
Previous Article in Journal
Vacuum Landscaping: Cause of Nonlocal Influences without Signaling
Previous Article in Special Issue
Quantifying the Effects of Topology and Weight for Link Prediction in Weighted Complex Networks
Article Menu
Issue 6 (June) cover image

Export Article

Open AccessArticle
Entropy 2018, 20(6), 459;

Recommending Queries by Extracting Thematic Experiences from Complex Search Tasks

Software College, Northeastern University, Shenyang 110004, China
School of Computer Science and Engineering, Northeastern University, Shenyang 110004, China
Author to whom correspondence should be addressed.
Received: 17 May 2018 / Revised: 1 June 2018 / Accepted: 3 June 2018 / Published: 13 June 2018
(This article belongs to the Special Issue Research Frontier in Chaos Theory and Complex Networks)
Full-Text   |   PDF [848 KB, uploaded 13 June 2018]   |  


Since complex search tasks are usually divided into subtasks, providing subtask-oriented query recommendations is an effective way to support complex search tasks. Currently, most subtask-oriented query recommendation methods extract subtasks from plain form search logs consisting of only queries and clicks, providing limited clues to identify subtasks. Meanwhile, for several decades, the Computer Human Interface (CHI)/Human Computer Interaction (HCI) communities have been working on new complex search tools for the purpose of supporting rich user interactions beyond just queries and clicks, and thus providing rich form search logs with more clues for subtask identification. In this paper, we researched the provision of subtask-oriented query recommendations by extracting thematic experiences from the rich form search logs of complex search tasks logged in a proposed visual data structure. We introduce the tree structure of the visual data structure and propose a visual-based subtask identification method based on the visual data structure. We then introduce a personalized PageRank-based method to recommend queries by ranking nodes on the network from the identified subtasks. We evaluated the proposed methods in experiments consisting of informative and tentative search tasks. View Full-Text
Keywords: complex search; subtask identification; query recommendation; personalized PageRank complex search; subtask identification; query recommendation; personalized PageRank

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Zhao, Y.; Zhang, Y.; Zhang, B.; Gao, K.; Li, P. Recommending Queries by Extracting Thematic Experiences from Complex Search Tasks. Entropy 2018, 20, 459.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top