Optimising topical query decomposition

Marcin Sydow, Francesco Bonchi, Carlos Castillo, Debora Donato

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

2 Citations (Scopus)

Abstract

Topical query decomposition (TQD) is a paradigm recently in [1], which, given a query, returns to the user a of queries that cover the answer set of the original query. TQD problem was studied as a variant of the set-cover and solved by means of a greedy algorithm. paper aims to strengthen the original formulation introducing a new global objective function, and thus the problem as a combinatorial optimisation one. a reformulation defines a common framework allowing formal evaluation and comparison of different approaches TQD.We apply simulated annealing, a sub-optimal metaheuristic, the problem of topical query decomposition and show, through a large experimentation on a data sample from an actual query log, that such meta-heuristic achieves better results than the greedy algorithm.

Original languageEnglish
Title of host publicationProceedings of Workshop on Web Search Click Data, WSCD'09
Pages43-47
Number of pages5
DOIs
Publication statusPublished - 14 Jul 2009
Externally publishedYes
EventWorkshop on Web Search Click Data, WSCD'09 - Barcelona, Spain
Duration: 9 Feb 20099 Feb 2009

Other

OtherWorkshop on Web Search Click Data, WSCD'09
CountrySpain
CityBarcelona
Period9/2/099/2/09

Fingerprint

Decomposition
Combinatorial optimization
Simulated annealing

Keywords

  • Objective function
  • Query decomposition
  • Query logs
  • Query recommendation
  • Simulated annealing

ASJC Scopus subject areas

  • Information Systems
  • Software

Cite this

Sydow, M., Bonchi, F., Castillo, C., & Donato, D. (2009). Optimising topical query decomposition. In Proceedings of Workshop on Web Search Click Data, WSCD'09 (pp. 43-47) https://doi.org/10.1145/1507509.1507516

Optimising topical query decomposition. / Sydow, Marcin; Bonchi, Francesco; Castillo, Carlos; Donato, Debora.

Proceedings of Workshop on Web Search Click Data, WSCD'09. 2009. p. 43-47.

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

Sydow, M, Bonchi, F, Castillo, C & Donato, D 2009, Optimising topical query decomposition. in Proceedings of Workshop on Web Search Click Data, WSCD'09. pp. 43-47, Workshop on Web Search Click Data, WSCD'09, Barcelona, Spain, 9/2/09. https://doi.org/10.1145/1507509.1507516
Sydow M, Bonchi F, Castillo C, Donato D. Optimising topical query decomposition. In Proceedings of Workshop on Web Search Click Data, WSCD'09. 2009. p. 43-47 https://doi.org/10.1145/1507509.1507516
Sydow, Marcin ; Bonchi, Francesco ; Castillo, Carlos ; Donato, Debora. / Optimising topical query decomposition. Proceedings of Workshop on Web Search Click Data, WSCD'09. 2009. pp. 43-47
@inproceedings{73147cf9bbab4e83b4d9c3624573ffa3,
title = "Optimising topical query decomposition",
abstract = "Topical query decomposition (TQD) is a paradigm recently in [1], which, given a query, returns to the user a of queries that cover the answer set of the original query. TQD problem was studied as a variant of the set-cover and solved by means of a greedy algorithm. paper aims to strengthen the original formulation introducing a new global objective function, and thus the problem as a combinatorial optimisation one. a reformulation defines a common framework allowing formal evaluation and comparison of different approaches TQD.We apply simulated annealing, a sub-optimal metaheuristic, the problem of topical query decomposition and show, through a large experimentation on a data sample from an actual query log, that such meta-heuristic achieves better results than the greedy algorithm.",
keywords = "Objective function, Query decomposition, Query logs, Query recommendation, Simulated annealing",
author = "Marcin Sydow and Francesco Bonchi and Carlos Castillo and Debora Donato",
year = "2009",
month = "7",
day = "14",
doi = "10.1145/1507509.1507516",
language = "English",
isbn = "9781605584348",
pages = "43--47",
booktitle = "Proceedings of Workshop on Web Search Click Data, WSCD'09",

}

TY - GEN

T1 - Optimising topical query decomposition

AU - Sydow, Marcin

AU - Bonchi, Francesco

AU - Castillo, Carlos

AU - Donato, Debora

PY - 2009/7/14

Y1 - 2009/7/14

N2 - Topical query decomposition (TQD) is a paradigm recently in [1], which, given a query, returns to the user a of queries that cover the answer set of the original query. TQD problem was studied as a variant of the set-cover and solved by means of a greedy algorithm. paper aims to strengthen the original formulation introducing a new global objective function, and thus the problem as a combinatorial optimisation one. a reformulation defines a common framework allowing formal evaluation and comparison of different approaches TQD.We apply simulated annealing, a sub-optimal metaheuristic, the problem of topical query decomposition and show, through a large experimentation on a data sample from an actual query log, that such meta-heuristic achieves better results than the greedy algorithm.

AB - Topical query decomposition (TQD) is a paradigm recently in [1], which, given a query, returns to the user a of queries that cover the answer set of the original query. TQD problem was studied as a variant of the set-cover and solved by means of a greedy algorithm. paper aims to strengthen the original formulation introducing a new global objective function, and thus the problem as a combinatorial optimisation one. a reformulation defines a common framework allowing formal evaluation and comparison of different approaches TQD.We apply simulated annealing, a sub-optimal metaheuristic, the problem of topical query decomposition and show, through a large experimentation on a data sample from an actual query log, that such meta-heuristic achieves better results than the greedy algorithm.

KW - Objective function

KW - Query decomposition

KW - Query logs

KW - Query recommendation

KW - Simulated annealing

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

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

U2 - 10.1145/1507509.1507516

DO - 10.1145/1507509.1507516

M3 - Conference contribution

SN - 9781605584348

SP - 43

EP - 47

BT - Proceedings of Workshop on Web Search Click Data, WSCD'09

ER -