skip to main content
10.1145/2396761.2398651acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
poster

Selecting expansion terms as a set via integer linear programming

Published:29 October 2012Publication History

ABSTRACT

Pseudo-relevance feedback via query expansion has been widely studied from various perspectives in the past decades. Its effectiveness in improving retrieval effectiveness has been shown in many tasks. A variety of criteria were proposed to select additional terms for the original queries. However, most of the existing methods weight and select terms individually and do not consider the impact of term-to-term relationship. In this paper, we first examine the influence of combinations of terms through data analysis, which demonstrate the significant effect of term-to-term relationship on retrieval effectiveness. Then, to address this problem, we formalize the query expansion task as an integer linear programming (ILP) problem. The model combines the weights learned from a supervised method for individual terms, and integrates constraints to capture relations between terms. Finally, three standard TREC collections are used to evaluate the proposed method. Experimental results demonstrate that the proposed method can significantly improve the effectiveness of retrieval.

References

  1. D. Alevras and M. W. Padberg. Linear Optimization and Extensions: Problems and Solutions. Springer, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  2. J. Bhogal, A. Macfarlane, and P. Smith. A review of ontology based query expansion. Information Processing & Management, 43(4):866--886, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. C. Buckley. Automatic query expansion using smart : Trec 3. In Proceedings of The third Text REtrieval Conference (TREC-3), pages 69--80, 1994.Google ScholarGoogle Scholar
  4. G. Cao, J.-Y. Nie, J. Gao, and S. Robertson. Selecting good expansion terms for pseudo-relevance feedback. In SIGIR '08, pages 243--250, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. C. Carpineto, R. de Mori, G. Romano, and B. Bigi. An information-theoretic approach to automatic query expansion. ACM Transactions on Information Systems, 19(1):1--27, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. K. Collins-Thompson. Estimating robust query models with convex optimization. In Advances in Neural Information Processing Systems 21 (NIPS), pages 329--336, 2008.Google ScholarGoogle Scholar
  7. K. Collins-Thompson. Reducing the risk of query expansion via robust constrained optimization. In Proceedings of the Eighteenth International Conference on Information and Knowledge Management (CIKM 2009), pages 329--336, Hong Kong, China, 2009. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. K. Collins-Thompson and J. Callan. Estimation and use of uncertainty in pseudo-relevance feedback. In SIGIR '07, pages 303--310, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. B. Croft, D. Metzler, and T. Strohman. Search Engines: Information Retrieval in Practice. Addison-Wesley Publishing Company, USA, 1st edition, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. H. Cui, J.-R. Wen, J.-Y. Nie, and W.-Y. Ma. Query expansion by mining user logs. IEEE Transactions on Knowledge and Data Engineering, 15(4):829--839, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. X. Huang and W. B. Croft. A unified relevance model for opinion retrieval. In Proceedings of 16th Conference on Information and Knowledge Management(CIKM 2009), Hong Kong, China, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. K. S. Lee, W. B. Croft, and J. Allan. A cluster-based resampling method for pseudo-relevance feedback. In SIGIR '08, pages 235--242, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. D. I. Moldovan and R. Mihalcea. Using wordnet and lexical operators to improve internet searches. IEEE Internet Computing, 4(1):34--43, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. S. E. Robertson. On term selection for query expansion. Journal of Documentation, 46(4):359--364, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. J. Rocchio. Relevance Feedback in Information Retrieval, pages 313--323. 1971.Google ScholarGoogle Scholar
  16. R. Sun, C.-H. Ong, and T.-S. Chua. Mining dependency relations for query expansion in passage retrieval. In Proceedings of SIGIR 2006, pages 382--389, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. R. Udupa, A. Bhole, and P. Bhattacharyya. "a term is known by the company it keeps": On selecting a good expansion set in pseudo-relevance feedback. In ICTIR '09: Proceedings of the 2nd International Conference on Theory of Information Retrieval, pages 104--115, Berlin, Heidelberg, 2009. Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Y. Wu, Q. Zhang, Y. Zhou, and X. Huang. Pseudo-relevance feedback based on mrmr criteria. In P.-J. Cheng, M.-Y. Kan, W. Lam, and P. Nakov, editors, Information Retrieval Technology, volume 6458 of Lecture Notes in Computer Science, pages 211--220. Springer Berlin / Heidelberg, 2010.Google ScholarGoogle Scholar
  19. Y. Xu, G. J. Jones, and B. Wang. Query dependent pseudo-relevance feedback based on wikipedia. In SIGIR '09, pages 59--66, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. S. Yu, D. Cai, J.-R. Wen, and W.-Y. Ma. Improving pseudo-relevance feedback in web information retrieval using web page segmentation. In Proceedings of WWW 2003, pages 11--18, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Selecting expansion terms as a set via integer linear programming

    Recommendations

    Comments

    Login options

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

    Sign in
    • Published in

      cover image ACM Conferences
      CIKM '12: Proceedings of the 21st ACM international conference on Information and knowledge management
      October 2012
      2840 pages
      ISBN:9781450311564
      DOI:10.1145/2396761

      Copyright © 2012 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]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 29 October 2012

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • poster

      Acceptance Rates

      Overall Acceptance Rate1,861of8,427submissions,22%

      Upcoming Conference

    • Article Metrics

      • Downloads (Last 12 months)1
      • Downloads (Last 6 weeks)0

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader