Major Web Search Engines take as a common practice to provide Suggestions to users in order to enhance their search experience. Such suggestions have normally the form of queries that are, to some extent, "similar" to the queries already submitted by the same or related users. The final aim of query suggestions is typically to help users to satisfy their information needs more quickly. In this paper we face this problem from a somewhat different perspective, and we propose a new query suggestion model based on Search Shortcuts, that consist in finding and proposing to the user "Successful" queries that allowed, in the past, several users to satisfy their information needs. This model differs from traditional query suggestion approaches, and allows the evaluation to be performed effectively by exploiting actual user sessions from the Microsoft 2006 RFP dataset. We evaluate several algorithms applied to this problem, both traditional Collaborative Filtering techniques and ad-hoc solutions, and report on preliminary results achieved.

Search shortcuts using click-through data from the 2006 RFP dataset

Baraglia R;Perego R;Silvestri F;
2009

Abstract

Major Web Search Engines take as a common practice to provide Suggestions to users in order to enhance their search experience. Such suggestions have normally the form of queries that are, to some extent, "similar" to the queries already submitted by the same or related users. The final aim of query suggestions is typically to help users to satisfy their information needs more quickly. In this paper we face this problem from a somewhat different perspective, and we propose a new query suggestion model based on Search Shortcuts, that consist in finding and proposing to the user "Successful" queries that allowed, in the past, several users to satisfy their information needs. This model differs from traditional query suggestion approaches, and allows the evaluation to be performed effectively by exploiting actual user sessions from the Microsoft 2006 RFP dataset. We evaluate several algorithms applied to this problem, both traditional Collaborative Filtering techniques and ad-hoc solutions, and report on preliminary results achieved.
2009
Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo" - ISTI
Inglese
Proceeding WSCD '09 Proceedings of the 2009 workshop on Web Search Click Data
Web Search and Web Data Mining. 2009 Workshop on Web Search Click Data
48
55
8
978-1-60558-434-8
http://dl.acm.org/citation.cfm?id=1507517
ACM Press
New York
STATI UNITI D'AMERICA
Sì, ma tipo non specificato
9 February 2009
Barcelona, Spain
Recommendation
Query suggestion
6
restricted
Baraglia, R; Perego, R; Silvestri, F; Cacheda, F; Carneiro, V; Formoso, V
273
info:eu-repo/semantics/conferenceObject
04 Contributo in convegno::04.01 Contributo in Atti di convegno
File in questo prodotto:
File Dimensione Formato  
prod_92004-doc_131119.pdf

solo utenti autorizzati

Descrizione: Search shortcuts using click-through data from the 2006 RFP dataset
Tipologia: Versione Editoriale (PDF)
Dimensione 420.83 kB
Formato Adobe PDF
420.83 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/62351
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact