• Corpus ID: 32829079

USER FEEDBACK SESSION WITH CLICKED AND UNCLICKED DOCUMENTS FOR RELATED SEARCH RECOMMENDATION

@inproceedings{Desai2016USERFS,
  title={USER FEEDBACK SESSION WITH CLICKED AND UNCLICKED DOCUMENTS FOR RELATED SEARCH RECOMMENDATION},
  author={Sejal Ajmera Desai and Vinuth Chandrasheker and Vijay Mathapati and Venugopal Kuppanna Rajuk and Sundaraja Sitharama Iyengar and Lalit M. Patnaik},
  year={2016}
}
Keyword based search is extensively used method to discover knowledge on the web. Generally, web users unable to arrange and define input queries relevant to their search because of adequate knowledge about domain. Hence, the input queries are normally short and ambiguous. Query recommendation is a method to recommend web queries that are related to the user initial query which helps them to locate their required information more precisely. It also helps the search engine to return appropriate… 
1 Citations

Figures and Tables from this paper

Feature Extraction and Duplicate Detection for Text Mining : A Survey
  • Ramya
  • Computer Science
  • 2017
TLDR
This survey covers different text summarization, classification, clustering methods to discover useful features and also discovering query facets which are multiple groups of words or phrases that explain and summarize the content covered by a query thereby reducing time taken by the survey.

References

SHOWING 1-10 OF 39 REFERENCES
How do users describe their information need: Query recommendation based on snippet click model
A structured approach to query recommendation with social annotation data
TLDR
Empirical experimental results indicate that the structured approach to query recommendation with social annotation data can better satisfy users' interests and significantly enhance users' click behavior on recommendations.
An efficient approach to suggesting topically related web queries using hidden topic model
TLDR
Experimental results show that the hidden topic based suggestion is much more efficient than the traditional term or URL based approach, and is effective in finding topically related queries for suggestion.
A New Algorithm for Inferring User Search Goals with Feedback Sessions
TLDR
This paper proposes a framework to discover different user search goals for a query by clustering the proposed feedback sessions by generating pseudo-documents to better represent the feedback sessions for clustering.
Optimal rare query suggestion with implicit user feedback
TLDR
Experimental results on one-month query logs from a large commercial search engine with over 40 million rare queries demonstrate the superiority of the proposed rare query suggestion framework over the traditional random walk models and pseudo-relevance feedback models.
Post-ranking query suggestion by diversifying search results
TLDR
The concept of diversifying the content of the search results from suggested queries while keeping the suggestion relevant is introduced and results indicate that the post-ranking framework significantly improves the relevance of suggested queries by comparing to existing models.
Diversifying Query Suggestion Results
TLDR
This paper presents a novel unified method to suggest both semantically relevant and diverse queries to Web users based on Markov random walk and hitting time analysis on the query-URL bipartite graph, which can effectively prevent semantically redundant queries from receiving a high rank.
Context-aware query suggestion by mining click-through and session data
TLDR
This paper proposes a novel context-aware query suggestion approach which is in two steps, and outperforms two baseline methods in both coverage and quality of suggestions.
A new query expansion method based on query logs mining
TLDR
The central idea is to extract correlations among queries by analyzing the common documents the users selected for them, and the expanded terms only come from the associated queries more than the relevant documents.
Fast Query Recommendation by Search
TLDR
A general and highly efficient method for query recommendation that automatically generates many similar and dissimilar query-pairs as the prior knowledge to move similar queries closer such that similar queries tend to have similar hash values.
...
...