NDLI: An optimization framework for query recommendation

Please wait, while we are loading the content...

Leveraging temporal dynamics of document content in relevance ranking

Tagging human knowledge

Coupled semi-supervised learning for information extraction

Ranking with query-dependent loss for web search

Large scale query log analysis of re-finding

Learning influence probabilities in social networks

A novel click model and its applications to online advertising

Revisiting globally sorted indexes for efficient document retrieval

SBotMiner: large scale search bot detection

Towards recency ranking in web search

Precomputing search features for fast and accurate query classification

Adapting information bottleneck method for automatic construction of domain-oriented sentiment lexicon

IntervalRank: isotonic regression with listwise and pairwise constraints

Anatomy of the long tail: ordinary people with extraordinary tastes

You are who you know: inferring user profiles in online social networks

Early online identification of attention gathering items in social media

Adaptive weighing designs for keyword value computation

Learning URL patterns for webpage de-duplication

Gathering and ranking photos of named entities with high precision, high recall, and diversity

Ranking mechanisms in twitter-like forums

I tag, you tag: translating tags for advanced user models

Data-oriented content query system: searching for data into text on the web

An optimization framework for query recommendation

Inferring search behaviors using partially observable Markov (POM) model

TwitterRank: finding topic-sensitive influential twitterers

Evolution of two-sided markets

Automatic generation of bid phrases for online advertising

On compressing the textual web

Boilerplate detection using shallow text features

Learning concept importance using a weighted dependence model

Pairwise interaction tensor factorization for personalized tag recommendation

Corroborating information from disagreeing views

Improving quality of training data for learning to rank using click-through data

Beyond DCG: user behavior as a predictor of a successful search

Folks in Folksonomies: social link prediction from shared metadata

Personalized click prediction in sponsored search

A sketch-based distance oracle for web-scale graphs

Query reformulation using anchor text

fLDA: matrix factorization through latent dirichlet allocation

A model to estimate intrinsic document relevance from the clickthrough logs of a web search engine

Measuring the reusability of test collections

GeoFolk: latent spatial semantics in web 2.0 social media

Improving ad relevance in sponsored search

Early exit optimizations for additive machine learned ranking systems

An optimization framework for query recommendation

Content Provider	ACM Digital Library
Author	Anagnostopoulos, Aris Becchetti, Luca Gionis, Aristides Castillo, Carlos
Abstract	Query recommendation is an integral part of modern search engines. The goal of query recommendation is to facilitate users while searching for information. Query recommendation also allows users to explore concepts related to their information needs. In this paper, we present a formal treatment of the problem of query recommendation. In our framework we model the querying behavior of users by a probabilistic reformula- tion graph, or query-flow graph [Boldi et al. CIKM 2008]. A sequence of queries submitted by a user can be seen as a path on this graph. Assigning score values to queries allows us to define suitable utility functions and to consider the expected utility achieved by a reformulation path on the query-flow graph. Providing recommendations can be seen as adding shortcuts in the query-flow graph that "nudge" the reformulation paths of users, in such a way that users are more likely to follow paths with larger expected utility. We discuss in detail the most important questions that arise in the proposed framework. In particular, we provide examples of meaningful utility functions to optimize, we discuss how to estimate the effect of recommendations on the reformulation probabilities, we address the complexity of the optimization problems that we consider, we suggest efficient algorithmic solutions, and we validate our models and algorithms with extensive experimentation. Our techniques can be applied to other scenarios where user behavior can be modeled as a Markov process.
Starting Page	161
Ending Page	170
Page Count	10
File Format	PDF
ISBN	9781605588896
DOI	10.1145/1718487.1718508
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2010-02-04
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Query suggestions Query reformulations
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An optimization framework for query recommendation ∗.

Efficient approximate thompson sampling for search query recommendation

An efficient framework for similarity query optimization

Complete yet practical search for minimal query reformulations under constraints

An optimization framework for query recommendation (2010)

An Optimization Framework for Query Recommendation

Adaptation of the concept hierarchy model with search logs for query recommendation on intranets

An optimization framework for query recommendation (2010)

Learning to rank query reformulations.

An optimization framework for query recommendation

Similar Documents

An optimization framework for query recommendation ∗.

Efficient approximate thompson sampling for search query recommendation

An efficient framework for similarity query optimization

Complete yet practical search for minimal query reformulations under constraints

An optimization framework for query recommendation (2010)

An Optimization Framework for Query Recommendation

Adaptation of the concept hierarchy model with search logs for query recommendation on intranets

An optimization framework for query recommendation (2010)

Learning to rank query reformulations.

An optimization framework for query recommendation