Query similarity by projecting the query-flow graph

Ilaria Bordino, Carlos Castillo, Debora Donato, Aristides Gionis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

51 Citations (Scopus)

Abstract

Defining a measure of similarity between queries is an interesting and difficult problem. A reliable query-similarity measure can be used in a variety of applications such as query recommendation, query expansion, and advertising. In this paper, we exploit the information present in query logs in order to develop a measure of semantic similarity between queries. Our approach relies on the concept of the query-flow graph. The query-flow graph aggregates query reformulations from many users: nodes in the graph represent queries, and two queries are connected if they are likely to appear as part of the same search goal. Our query-similarity measure is obtained by projecting the graph (or appropriate subgraphs of it) on a low-dimensional Euclidean space. Our experiments show that the measure we obtain captures a notion of semantic similarity between queries and it is useful for diversifying query recommendations.

Original languageEnglish
Title of host publicationSIGIR 2010 Proceedings - 33rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval
Pages515-522
Number of pages8
DOIs
Publication statusPublished - 1 Sep 2010
Externally publishedYes
Event33rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2010 - Geneva, Switzerland
Duration: 19 Jul 201023 Jul 2010

Other

Other33rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2010
CountrySwitzerland
CityGeneva
Period19/7/1023/7/10

Fingerprint

Flow graphs
Semantics
Marketing
Experiments

Keywords

  • Algorithms
  • Experimentation

ASJC Scopus subject areas

  • Information Systems

Cite this

Bordino, I., Castillo, C., Donato, D., & Gionis, A. (2010). Query similarity by projecting the query-flow graph. In SIGIR 2010 Proceedings - 33rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (pp. 515-522) https://doi.org/10.1145/1835449.1835536

Query similarity by projecting the query-flow graph. / Bordino, Ilaria; Castillo, Carlos; Donato, Debora; Gionis, Aristides.

SIGIR 2010 Proceedings - 33rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. 2010. p. 515-522.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bordino, I, Castillo, C, Donato, D & Gionis, A 2010, Query similarity by projecting the query-flow graph. in SIGIR 2010 Proceedings - 33rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. pp. 515-522, 33rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2010, Geneva, Switzerland, 19/7/10. https://doi.org/10.1145/1835449.1835536
Bordino I, Castillo C, Donato D, Gionis A. Query similarity by projecting the query-flow graph. In SIGIR 2010 Proceedings - 33rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. 2010. p. 515-522 https://doi.org/10.1145/1835449.1835536
Bordino, Ilaria ; Castillo, Carlos ; Donato, Debora ; Gionis, Aristides. / Query similarity by projecting the query-flow graph. SIGIR 2010 Proceedings - 33rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. 2010. pp. 515-522
@inproceedings{750dc28aead04f2d9fd6ed18c04fed71,
title = "Query similarity by projecting the query-flow graph",
abstract = "Defining a measure of similarity between queries is an interesting and difficult problem. A reliable query-similarity measure can be used in a variety of applications such as query recommendation, query expansion, and advertising. In this paper, we exploit the information present in query logs in order to develop a measure of semantic similarity between queries. Our approach relies on the concept of the query-flow graph. The query-flow graph aggregates query reformulations from many users: nodes in the graph represent queries, and two queries are connected if they are likely to appear as part of the same search goal. Our query-similarity measure is obtained by projecting the graph (or appropriate subgraphs of it) on a low-dimensional Euclidean space. Our experiments show that the measure we obtain captures a notion of semantic similarity between queries and it is useful for diversifying query recommendations.",
keywords = "Algorithms, Experimentation",
author = "Ilaria Bordino and Carlos Castillo and Debora Donato and Aristides Gionis",
year = "2010",
month = "9",
day = "1",
doi = "10.1145/1835449.1835536",
language = "English",
isbn = "9781605588964",
pages = "515--522",
booktitle = "SIGIR 2010 Proceedings - 33rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval",

}

TY - GEN

T1 - Query similarity by projecting the query-flow graph

AU - Bordino, Ilaria

AU - Castillo, Carlos

AU - Donato, Debora

AU - Gionis, Aristides

PY - 2010/9/1

Y1 - 2010/9/1

N2 - Defining a measure of similarity between queries is an interesting and difficult problem. A reliable query-similarity measure can be used in a variety of applications such as query recommendation, query expansion, and advertising. In this paper, we exploit the information present in query logs in order to develop a measure of semantic similarity between queries. Our approach relies on the concept of the query-flow graph. The query-flow graph aggregates query reformulations from many users: nodes in the graph represent queries, and two queries are connected if they are likely to appear as part of the same search goal. Our query-similarity measure is obtained by projecting the graph (or appropriate subgraphs of it) on a low-dimensional Euclidean space. Our experiments show that the measure we obtain captures a notion of semantic similarity between queries and it is useful for diversifying query recommendations.

AB - Defining a measure of similarity between queries is an interesting and difficult problem. A reliable query-similarity measure can be used in a variety of applications such as query recommendation, query expansion, and advertising. In this paper, we exploit the information present in query logs in order to develop a measure of semantic similarity between queries. Our approach relies on the concept of the query-flow graph. The query-flow graph aggregates query reformulations from many users: nodes in the graph represent queries, and two queries are connected if they are likely to appear as part of the same search goal. Our query-similarity measure is obtained by projecting the graph (or appropriate subgraphs of it) on a low-dimensional Euclidean space. Our experiments show that the measure we obtain captures a notion of semantic similarity between queries and it is useful for diversifying query recommendations.

KW - Algorithms

KW - Experimentation

UR - http://www.scopus.com/inward/record.url?scp=77956025821&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77956025821&partnerID=8YFLogxK

U2 - 10.1145/1835449.1835536

DO - 10.1145/1835449.1835536

M3 - Conference contribution

AN - SCOPUS:77956025821

SN - 9781605588964

SP - 515

EP - 522

BT - SIGIR 2010 Proceedings - 33rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval

ER -