Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1507509.1507516acmconferencesArticle/Chapter ViewAbstractPublication PageswsdmConference Proceedingsconference-collections
research-article

Optimising topical query decomposition

Published: 09 February 2009 Publication History

Abstract

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

References

[1]
Francesco Bonchi, Carlos Castillo, Debora Donato, and Aristides Gionis. Topical query decomposition. In Proceeding of ACM SIGKDD'08.
[2]
Robert D. Carr, Srinivas Doddi, Goran Konjevod, and Madhav V. Marathe. On the red-blue set cover problem. In Symposium on Discrete Algorithms, 2000.
[3]
V. Chvátal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 4:233--235, 1979.
[4]
Bernard J. Jansen, Amanda Spink How are we searching the World Wide Web? A comparison of nine search engine transaction logs Information Processing & Management. Formal Methods for Information Retrieval., 1(42):248--263, 2006.
[5]
David Johnson. Approximation algorithms for combinatorial problems. In Proceedings of the ACM Symposium on Theory of Computing, 1973.
[6]
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, 220(4598):671--680, May 1983.
[7]
David Peleg. Approximation algorithms for the label-covermax and red-blue set cover problems. Journal of Discrete Algorithms, 5(1):55--64, 2007.

Cited By

View all
  • (2011)On the selection of tags for tag cloudsProceedings of the fourth ACM international conference on Web search and data mining10.1145/1935826.1935855(835-844)Online publication date: 9-Feb-2011

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
WSCD '09: Proceedings of the 2009 workshop on Web Search Click Data
February 2009
95 pages
ISBN:9781605584348
DOI:10.1145/1507509
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 February 2009

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. objective function
  2. query decomposition
  3. query logs
  4. query recommendation
  5. simulated annealing

Qualifiers

  • Research-article

Conference

Upcoming Conference

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 08 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2011)On the selection of tags for tag cloudsProceedings of the fourth ACM international conference on Web search and data mining10.1145/1935826.1935855(835-844)Online publication date: 9-Feb-2011

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media