Complexity and algorithms for composite retrieval

Online search has become a daily activity and a source of a variety of valuable information, from the finest granularity such as finding the address of a specific restaurant, to more complex tasks like looking for accessories compatible with an iPhone or planning a trip. The latter typically involve...

Descripción completa

Detalles Bibliográficos
Autores principales: Amer-Yahia, S., Bonchi, F., Castillo, C., Feuerstein, E., Méndez-Díaz, I., Zabala, P.
Formato: CONF
Materias:
Complementarity
Composite retrieval
Diversity
Maximum edge subgraph
Daily activity
Geographic proximity
Information seeking
Multiple search
Online reviews
Subgraphs
Hardware
World Wide Web
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_97814503_v_n_p79_AmerYahia
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires
id todo:paper_97814503_v_n_p79_AmerYahia
record_format dspace
spelling todo:paper_97814503_v_n_p79_AmerYahia2023-10-03T16:43:20Z Complexity and algorithms for composite retrieval Amer-Yahia, S. Bonchi, F. Castillo, C. Feuerstein, E. Méndez-Díaz, I. Zabala, P. Complementarity Composite retrieval Diversity Maximum edge subgraph Complementarity Daily activity Diversity Geographic proximity Information seeking Multiple search Online reviews Subgraphs Hardware World Wide Web Online search has become a daily activity and a source of a variety of valuable information, from the finest granularity such as finding the address of a specific restaurant, to more complex tasks like looking for accessories compatible with an iPhone or planning a trip. The latter typically involves running multiple search queries to gather information about different places, reading online reviews to find out about hotels, and checking geographic proximity of places to visit. We refer to this information seeking activity as composite retrieval and propose to organize results into item bundles that together constitute an improved exploratory experience over ranked lists. Fil:Méndez-Díaz, I. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Fil:Zabala, P. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. CONF info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_97814503_v_n_p79_AmerYahia
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-134
collection Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic Complementarity
Composite retrieval
Diversity
Maximum edge subgraph
Complementarity
Daily activity
Diversity
Geographic proximity
Information seeking
Multiple search
Online reviews
Subgraphs
Hardware
World Wide Web
spellingShingle Complementarity
Composite retrieval
Diversity
Maximum edge subgraph
Complementarity
Daily activity
Diversity
Geographic proximity
Information seeking
Multiple search
Online reviews
Subgraphs
Hardware
World Wide Web
Amer-Yahia, S.
Bonchi, F.
Castillo, C.
Feuerstein, E.
Méndez-Díaz, I.
Zabala, P.
Complexity and algorithms for composite retrieval
topic_facet Complementarity
Composite retrieval
Diversity
Maximum edge subgraph
Complementarity
Daily activity
Diversity
Geographic proximity
Information seeking
Multiple search
Online reviews
Subgraphs
Hardware
World Wide Web
description Online search has become a daily activity and a source of a variety of valuable information, from the finest granularity such as finding the address of a specific restaurant, to more complex tasks like looking for accessories compatible with an iPhone or planning a trip. The latter typically involves running multiple search queries to gather information about different places, reading online reviews to find out about hotels, and checking geographic proximity of places to visit. We refer to this information seeking activity as composite retrieval and propose to organize results into item bundles that together constitute an improved exploratory experience over ranked lists.
format CONF
author Amer-Yahia, S.
Bonchi, F.
Castillo, C.
Feuerstein, E.
Méndez-Díaz, I.
Zabala, P.
author_facet Amer-Yahia, S.
Bonchi, F.
Castillo, C.
Feuerstein, E.
Méndez-Díaz, I.
Zabala, P.
author_sort Amer-Yahia, S.
title Complexity and algorithms for composite retrieval
title_short Complexity and algorithms for composite retrieval
title_full Complexity and algorithms for composite retrieval
title_fullStr Complexity and algorithms for composite retrieval
title_full_unstemmed Complexity and algorithms for composite retrieval
title_sort complexity and algorithms for composite retrieval
url http://hdl.handle.net/20.500.12110/paper_97814503_v_n_p79_AmerYahia
work_keys_str_mv AT ameryahias complexityandalgorithmsforcompositeretrieval
AT bonchif complexityandalgorithmsforcompositeretrieval
AT castilloc complexityandalgorithmsforcompositeretrieval
AT feuersteine complexityandalgorithmsforcompositeretrieval
AT mendezdiazi complexityandalgorithmsforcompositeretrieval
AT zabalap complexityandalgorithmsforcompositeretrieval
_version_ 1807314497330741248

Ejemplares similares