A Constraint Programming Approach to Automatic Layout Definition for Search Results

  • Alessandro Bozzon
  • Marco Brambilla
  • Laura Cigardi
  • Sara Comai
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6757)

Abstract

In this paper we describe a general framework based on constraint programming techniques to address the automatic layout definition problem for Web search result pages, considering heterogeneous result items types (e.g., web links, images, videos, maps, etc.). Starting from the entity type(s) specified in the search query and the result types deemed more relevant for the given entity type, we define an optimization problem and a set of constraints that grant the optimal positioning of results in the page, modeled as a grid with assigned weights depending on the visibility.

References

  1. 1.
    Choco library, http://choco.emn.fr/
  2. 2.
    Bozzon, A., Brambilla, M., Comai, S.: A Characterization of the Layout Definition Problem for Web Search Results. In: Meersman, R., Dillon, T., Herrero, P. (eds.) OTM 2010. LNCS, vol. 6428, pp. 150–159. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  3. 3.
    Ceri, S., Brambilla, M. (eds.): Search Computing - Challenges and Directions. LNCS, vol. 5950, pp. 3–10. Springer, Heidelberg (2010)Google Scholar
  4. 4.
    Hearst, M.A.: Search User Interfaces, 1st edn. Cambridge University Press, Cambridge (2009)CrossRefGoogle Scholar
  5. 5.
    Kuhlthau, C.C.: Inside the search process: Information seeking from the user’s perspective. Journal of the American Society for Information Science 42(5)(5), 361–371 (1991)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Alessandro Bozzon
    • 1
  • Marco Brambilla
    • 1
  • Laura Cigardi
    • 1
  • Sara Comai
    • 1
  1. 1.Department of Electronics and Information (DEI)Politecnico di MilanoMilanItaly

Personalised recommendations