Clustering Search Engine Log for Query Recommendation

Author(s):  
Mehdi Hosseini ◽  
Hassan Abolhassani
2017 ◽  
Vol 67 ◽  
pp. 1-10 ◽  
Author(s):  
David A. Hanauer ◽  
Danny T.Y. Wu ◽  
Lei Yang ◽  
Qiaozhu Mei ◽  
Katherine B. Murkowski-Steffy ◽  
...  

2015 ◽  
Vol 2015 ◽  
pp. 1-14 ◽  
Author(s):  
JianGuo Wang ◽  
Joshua Zhexue Huang ◽  
Dingming Wu

Query recommendation is an essential part of modern search engine which aims at helping users find useful information. Existing query recommendation methods all focus on recommending similar queries to the users. However, the main problem of these similarity-based approaches is that even some very similar queries may return few or even no useful search results, while other less similar queries may return more useful search results, especially when the initial query does not reflect user’s search intent correctly. Therefore, we propose recommending high utility queries, that is, useful queries with more relevant documents, rather than similar ones. In this paper, we first construct a query-reformulation graph that consists of query nodes, satisfactory document nodes, and interruption node. Then, we apply an absorbing random walk on the query-reformulation graph and model the document utility with the transition probability from initial query to the satisfactory document. At last, we propagate the document utilities back to queries and rank candidate queries with their utilities for recommendation. Extensive experiments were conducted on real query logs, and the experimental results have shown that our method significantly outperformed the state-of-the-art methods in recommending high utility queries.


2020 ◽  
Vol 17 (1) ◽  
pp. 445-450
Author(s):  
Chetana Badgujar ◽  
Vimla Jethani ◽  
Tushar Ghorpade

Exploratory search aids in the production of desired results which improve browsing abilities of user in current era. To improve search engine performance, this method inspects search goal shift to obtain pertinent knowledge about query entered by the user. The existing system fails to provide bigram relationship and ignores synonyms of the submitted query. Also there is un-certainty of spam links which may be included in the final result. To overcome these lacunas, the proposed framework will conduct an exploratory search to recommend query by making use of bi-gram approach which will also remove the spam links with the help of trust rank algorithm and finds all possible synonyms of the submitted query in order to obtain a proper result. This phenomenon helps to produce better user recommendations.


Sign in / Sign up

Export Citation Format

Share Document