Skip to main content

MUSETS: Diversity-Aware Web Query Suggestions for Shortening User Sessions

  • Conference paper
  • First Online:
  • 701 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9384))

Abstract

We propose MUSETS (multi-session total shortening) – a novel formulation of the query suggestion task, specified as an optimization problem. Given an ambiguous user query, the goal is to propose the user a set of query suggestions that optimizes a diversity-aware objective function. The function models the expected number of query reformulations that a user would save until reaching a satisfactory query formulation. The function is diversity-aware, as it naturally enforces high coverage of different alternative continuations of the user session. For modeling the topics covered by the queries, we also use an extended query representation based on entities extracted from Wikipedia. We apply a machine learning approach to learn the model on a set of user sessions to be subsequently used for queries that are under-represented in historical query logs and present an evaluation of the approach.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    Optionally, it is also possible to consider the latest occurence thereof.

  2. 2.

    While this is an “optimistic” assumption, other variants can be also considered, in particular min operator (“pessimistic” variant) or some other aggregation operators.

  3. 3.

    However other options are possible, what is envisaged in the continuation work.

  4. 4.

    The choice of the value of k is an independent interesting problem that depends on the level of ambiguity of the query and some other external conditions such as the space available for presenting the suggestions in the front-end application. We do not study this problem here and treat k as an external parameter.

  5. 5.

    Such a direct approach can be of high computational complexity though.

  6. 6.

    http://people.cs.umass.edu/~vdang/ranklib.html.

References

  1. Baeza-Yates, R., Hurtado, C.A., Mendoza, M.: Query recommendation using query logs in search engines. In: Lindner, W., Fischer, F., Türker, C., Tzitzikas, Y., Vakali, A.I. (eds.) EDBT 2004. LNCS, vol. 3268, pp. 588–596. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Boldi, P., Bonchi, F., Castillo, C., Donato, D., Gionis, A., Vigna, S.: The query-flow graph: model and applications. In: Proceedings of CIKM’08. ACM (2008)

    Google Scholar 

  3. Bonchi, F., Perego, R., Silvestri, F., Vahabi, H., Venturini, R.: Efficient query recommendations in the long tail via center-piece subgraphs. In: Proceedings of SIGIR’12. ACM (2012)

    Google Scholar 

  4. Broccolo, D., Marcon, L., Nardini, F.M., Perego, R., Silvestri, F.: Generating suggestions for queries in the long tail with an inverted index. Inf. Process. Manage. 48(2), 326–339 (2012)

    Article  Google Scholar 

  5. Ceccarelli, D., Lucchese, C., Orlando, S., Perego, R., Trani, S.: Dexter: an open source framework for entity linking. In: Proceedings of ESAIR’13 (2013)

    Google Scholar 

  6. Deng, H., King, I., Lyu, M.R.: Entropy-biased models for query representation on the click graph. In: Proceedings of SIGIR’09. ACM (2009)

    Google Scholar 

  7. Friedman, J.H.: Greedy function approximation: a gradient boosting machine. Ann. Stat. 29, 1189–1232 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  8. Muntean, C.I., Nardini, F.M., Silvestri, F., Sydow, M.: Learning to shorten query sessions. In: Proceedings WWW ’13 Companion (2013)

    Google Scholar 

  9. Ozertem, U., Chapelle, O., Donmez, P., Velipasaoglu, E.: Learning to suggest: a machine learning framework for ranking query suggestions. In: Proceedings of SIGIR ’12. ACM (2012)

    Google Scholar 

  10. Silvestri, F.: Mining query logs: turning search usage data into knowledge. Found. Trends Inf. Retrieval 1(1–2), 1–174 (2010)

    Article  MATH  Google Scholar 

  11. Sydow, M., Ciesielski, K., Wajda, J.: Introducing diversity to log-based query suggestions to deal with underspecified user queries. In: Bouvry, P., Kłopotek, M.A., Leprévost, F., Marciniak, M., Mykowiecka, A., Rybiński, H. (eds.) SIIS 2011. LNCS, vol. 7053, pp. 251–264. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  12. Vahabi, H., Ackerman, M., Loker, D., Baeza-Yates, R., Lopez-Ortiz, A.: Orthogonal query recommendation. In: Proceedings of RecSys’13. ACM (2013)

    Google Scholar 

Download references

Acknowledgments

The work is partially supported by Polish National Science Centre 2012/07/B/ST6/01239 “DISQUSS” grant.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marcin Sydow .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Sydow, M., Muntean, C.I., Nardini, F.M., Matwin, S., Silvestri, F. (2015). MUSETS: Diversity-Aware Web Query Suggestions for Shortening User Sessions. In: Esposito, F., Pivert, O., Hacid, MS., Rás, Z., Ferilli, S. (eds) Foundations of Intelligent Systems. ISMIS 2015. Lecture Notes in Computer Science(), vol 9384. Springer, Cham. https://doi.org/10.1007/978-3-319-25252-0_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-25252-0_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-25251-3

  • Online ISBN: 978-3-319-25252-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics