A Constraint Programming Approach to Automatic Layout Definition for Search Results

  • Alessandro Bozzon
  • Marco Brambilla
  • Laura Cigardi
  • Sara Comai
Conference paper

DOI: 10.1007/978-3-642-22233-7_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6757)
Cite this paper as:
Bozzon A., Brambilla M., Cigardi L., Comai S. (2011) A Constraint Programming Approach to Automatic Layout Definition for Search Results. In: Auer S., Díaz O., Papadopoulos G.A. (eds) Web Engineering. ICWE 2011. Lecture Notes in Computer Science, vol 6757. Springer, Berlin, Heidelberg

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.

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