More Web Proxy on the site http://driver.im/

research-article

Robust query rewriting using anchor data

Authors:

Bodo Billerbeck,

Dennis Fetterly,

Marc NajorkAuthors Info & Claims

WSDM '13: Proceedings of the sixth ACM international conference on Web search and data mining

Pages 335 - 344

https://doi.org/10.1145/2433396.2433440

Published: 04 February 2013 Publication History

Abstract

Query rewriting algorithms can be used as a form of query expansion, by combining the user's original query with automatically generated rewrites. Rewriting algorithms bring linguistic datasets to bear without the need for iterative relevance feedback, but most studies of rewriting have used proprietary datasets such as large-scale search logs. By contrast this paper uses readily available data, particularly ClueWeb09 link text with over 1.2 billion anchor phrases, to generate rewrites. To avoid overfitting, our initial analysis is performed using Million Query Track queries, leading us to identify three algorithms which perform well. We then test the algorithms on Web and newswire data. Results show good properties in terms of robustness and early precision.

References

[1]

E. Amitay, A. Darlow, D. Konopnicki, and U. Weiss. Queries as anchors: selection by association. In Proc. of the sixteenth ACM conference on Hypertext and hypermedia, HYPERTEXT'05, pages 193--201, New York, NY, USA, 2005. ACM.

Digital Library

[2]

J. R. Baron, D. D. Lewis, and D. W. Oard. TREC-2006 legal track overview. In Proc. of TREC 2006, 2006.

[3]

L. Barroso, J. Dean, and U. Holzle. Web search for a planet: The Google cluster architecture. Micro, IEEE, 23(2):22--28, March-April 2003.

Digital Library

[4]

M. Bendersky, D. Metzler, and W. B. Croft. Parameterized concept weighting in verbose queries. In Proc. of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR'11, pages 605--614, 2011.

Digital Library

[5]

M. Bendersky, D. Metzler, and W. B. Croft. Effective query formulation with multiple information sources. In Proc. of the 5th ACM International Conference on Web Search and Data Mining, WSDM'12, pages 443--452, 2012.

Digital Library

[6]

E. Brill and R. C. Moore. An improved error model for noisy channel spelling correction. In Proc. of the 38th Annual Meeting on Association for Computational Linguistics, ACL'00, pages 286--293, 2000.

Digital Library

[7]

J. Brutlag. Speed matters for Google web search. Technical report, Google, 2009.

[8]

B. Carterette, V. Pavlu, H. Fang, and E. Kanoulas. Million query track 2009 overview. In Proc. of TREC 2009, 2009.

[9]

K. Collins-Thompson. Reducing the risk of query expansion via robust constrained optimization. In Proc. of the 18th ACM Conference on Information and Knowledge Management, CIKM'09, pages 837--846, 2009.

Digital Library

[10]

N. Craswell and M. Szummer. Random walks on the click graph. In Proc. of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR'07, pages 239--246, 2007.

Digital Library

[11]

H. Cui, J.-R. Wen, J.-Y. Nie, and W.-Y. Ma. Probabilistic query expansion using query logs. In Proc. of the 11th International Conference on World Wide Web, WWW'02, pages 325--332, 2002.

Digital Library

[12]

V. Dang and B. W. Croft. Query reformulation using anchor text. In Proc. of the 3rd ACM International Conference on Web Search and Data Mining, WSDM'10, pages 41--50, 2010.

Digital Library

[13]

P. A. Dmitriev, N. Eiron, M. Fontoura, and E. Shekita. Using annotations in enterprise search. In Proc. of the 15th international conference on World Wide Web, WWW'06, pages 811--817, New York, NY, USA, 2006. ACM.

Digital Library

[14]

J. L. Elsas, J. Arguello, J. Callan, and J. G. Carbonell. Retrieval and feedback models for blog feed search. In Proc. of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR'08, pages 347--354, 2008.

Digital Library

[15]

J. Guo, G. Xu, H. Li, and X. Cheng. A unified and discriminative model for query refinement. In Proc. of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR'08, pages 379--386, 2008.

Digital Library

[16]

D. Harman and C. Buckley. The NRRC Reliable Information Access (RIA) workshop. In Proc. of the 27th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR'04, pages 528--529, 2004.

Digital Library

[17]

D. Hawking and N. Craswell. The very large collection and web tracks. In E. Voorhees and D. Harman, editors, TREC: Experiment and Evaluation in Information Retrieval. MIT Press, 2005.

[18]

J. Huang, J. Gao, J. Miao, X. Li, K. Wang, F. Behr, and C. L. Giles. Exploring web scale language models for search query processing. In Proc. of the 19th International Conference on World Wide Web, WWW'10, pages 451--460, 2010.

Digital Library

[19]

A. Jain, U. Ozertem, and E. Velipasaoglu. Synthesizing high utility suggestions for rare web search queries. In Proc. of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR'11, pages 805--814, 2011.

Digital Library

[20]

R. Jones, B. Rey, O. Madani, and W. Greiner. Generating query substitutions. In Proc. of the 15th International Conference on World Wide Web, WWW'06, pages 387--396, 2006.

Digital Library

[21]

R. Kraft and J. Zien. Mining anchor text for query refinement. In Proc. of the 13th international conference on World Wide Web, WWW'04, pages 666--674, New York, NY, USA, 2004. ACM.

Digital Library

[22]

V. Lavrenko and W. B. Croft. Relevance based language models. In Proc. of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR'01, pages 120--127, 2001.

Digital Library

[23]

S. Levy. In the Plex: How Google Thinks, Works, and Shapes Our Lives. Simon & Schuster, 2011.

Digital Library

[24]

S. Robertson. On GMAP -- and other transformations. In Proc. of the 15th ACM International Conference on Information and Knowledge Management, CIKM'06, pages 78--83, 2006.

Digital Library

[25]

C. Shannon, N. Petigara, and S. Seshasai. A mathematical theory of communication. Bell System Technical Journal, 27:379--423, 1948.

[26]

A. F. Smeaton and C. J. Van Rijsbergen. The retrieval effects of query expansion on a feedback document retrieval system. The Computer Journal, 26(3):10--18, 1983.

[27]

E. M. Voorhees. The TREC robust retrieval track. SIGIR Forum, 39:11--20, June 2005.

Digital Library

[28]

Y. Xu, G. J. Jones, and B. Wang. Query dependent pseudo-relevance feedback based on Wikipedia. In Proc. of the 32nd International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR'09, pages 59--66, 2009.

Digital Library

[29]

X. Xue, W. B. Croft, and D. A. Smith. Modeling reformulation using passage analysis. In Proceedings of the 19th ACM international conference on Information and knowledge management, CIKM'10, pages 1497--1500, New York, NY, USA, 2010. ACM.

Digital Library

[30]

E. Yilmaz and S. Robertson. On the choice of effectiveness measures for learning to rank. Inf. Retr., 13:271--290, June 2010.

Digital Library

[31]

S. Yu, D. Cai, J.-R. Wen, and W.-Y. Ma. Improving pseudo-relevance feedback in web information retrieval using web page segmentation. In Proc. of the 12th International Conference on World Wide Web, WWW'03, pages 11--18, 2003.

Digital Library

[32]

W. Zhang and C. Yu. UIC at TREC 2006 blog track: a notebook paper. In Proc. of TREC 2006, 2006.

[33]

Y. Zhang and A. Moffat. Some observations on user search behavior. In Proc. of the 11th Australasian Document Computing Symposium, pages 1--8, 2006.

Cited By

Fröbe MGünther SProbst MPotthast MHagen M(2022)The Power of Anchor Text in the Neural Retrieval EraAdvances in Information Retrieval10.1007/978-3-030-99736-6_38(567-583)Online publication date: 5-Apr-2022
https://doi.org/10.1007/978-3-030-99736-6_38
Brusilovsky PSmyth BShapira B(2018)Social SearchSocial Information Access10.1007/978-3-319-90092-6_7(213-276)Online publication date: 3-May-2018
https://doi.org/10.1007/978-3-319-90092-6_7
Hwang SKim SHe YElnikety SChoi S(2016)Prediction and Predictability for Search Query AccelerationACM Transactions on the Web10.1145/294378410:3(1-28)Online publication date: 16-Aug-2016
https://dl.acm.org/doi/10.1145/2943784
Show More Cited By

Index Terms

Robust query rewriting using anchor data
1. Information systems
  1. Information retrieval

Recommendations

Determinacy and query rewriting for conjunctive queries and views

Answering queries using views is the problem which examines how to derive the answers to a query when we only have the answers to a set of views. Constructing rewritings is a widely studied technique to derive those answers. In this paper we consider ...
Query reformulation using anchor text
WSDM '10: Proceedings of the third ACM international conference on Web search and data mining

Query reformulation techniques based on query logs have been studied as a method of capturing user intent and improving retrieval effectiveness. The evaluation of these techniques has primarily, however, focused on proprietary query logs and selected ...
View-based query processing: On the relationship between rewriting, answering and losslessness

As a result of the extensive research in view-based query processing, three notions have been identified as fundamental, namely rewriting, answering, and losslessness. Answering amounts to computing the tuples satisfying the query in all databases ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

WSDM '13: Proceedings of the sixth ACM international conference on Web search and data mining

February 2013

816 pages

ISBN:9781450318693

DOI:10.1145/2433396

General Chairs:
Stefano Leonardi
Sapienza University of Rome, Italy
,
Alessandro Panconesi
Sapienza University of Rome, Italy
,
Program Chairs:
Paolo Ferragina
University of Pisa, Italy
,
Aristides Gionis
Yahoo! Research, Barcelona, Spain

Copyright © 2013 ACM.

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: 04 February 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

WSDM 2013

Sponsor:

WSDM 2013: Sixth ACM International Conference on Web Search and Data Mining

February 4 - 8, 2013

Rome, Italy

Acceptance Rates

Overall Acceptance Rate 498 of 2,863 submissions, 17%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
273
Total Downloads

Downloads (Last 12 months)11
Downloads (Last 6 weeks)1

Reflects downloads up to 11 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Fröbe MGünther SProbst MPotthast MHagen M(2022)The Power of Anchor Text in the Neural Retrieval EraAdvances in Information Retrieval10.1007/978-3-030-99736-6_38(567-583)Online publication date: 5-Apr-2022
https://doi.org/10.1007/978-3-030-99736-6_38
Brusilovsky PSmyth BShapira B(2018)Social SearchSocial Information Access10.1007/978-3-319-90092-6_7(213-276)Online publication date: 3-May-2018
https://doi.org/10.1007/978-3-319-90092-6_7
Hwang SKim SHe YElnikety SChoi S(2016)Prediction and Predictability for Search Query AccelerationACM Transactions on the Web10.1145/294378410:3(1-28)Online publication date: 16-Aug-2016
https://dl.acm.org/doi/10.1145/2943784
Ren XCheng TGangemi ALeonardi SPanconesi A(2015)Synonym Discovery for Structured Entities on Heterogeneous GraphsProceedings of the 24th International Conference on World Wide Web10.1145/2740908.2745396(443-453)Online publication date: 18-May-2015
https://dl.acm.org/doi/10.1145/2740908.2745396
Bing LLam WWong TJameel S(2015)Web Query Reformulation via Joint Modeling of Latent Topic Dependency and Term ContextACM Transactions on Information Systems10.1145/269966633:2(1-38)Online publication date: 17-Feb-2015
https://dl.acm.org/doi/10.1145/2699666
Jeon MKim SHwang SHe YElnikety SCox ARixner SGeva STrotman ABruza PClarke CJärvelin K(2014)Predictive parallelizationProceedings of the 37th international ACM SIGIR conference on Research & development in information retrieval10.1145/2600428.2609572(253-262)Online publication date: 3-Jul-2014
https://dl.acm.org/doi/10.1145/2600428.2609572
Bakhtin AUstinovskiy YSerdyukov PHe QIyengar ANejdl WPei JRastogi R(2013)Predicting the impact of expansion terms using semantic and user interaction featuresProceedings of the 22nd ACM international conference on Information & Knowledge Management10.1145/2505515.2507872(1825-1828)Online publication date: 27-Oct-2013
https://dl.acm.org/doi/10.1145/2505515.2507872

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents