Standard

Diversification for multi-domain result sets. / Bozzon, Alessandro; Brambilla, Marco; Fraternali, Piero; Tagliasacchi, Marco.

CIKM'11 - Proceedings of the 2011 ACM International Conference on Information and Knowledge Management. New York : Association for Computing Machinery (ACM), 2011. p. 1905-1908.

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

Harvard

Bozzon, A, Brambilla, M, Fraternali, P & Tagliasacchi, M 2011, Diversification for multi-domain result sets. in CIKM'11 - Proceedings of the 2011 ACM International Conference on Information and Knowledge Management. Association for Computing Machinery (ACM), New York, pp. 1905-1908, 20th ACM Conference on Information and Knowledge Management, CIKM'11, Glasgow, United Kingdom, 24/10/11. https://doi.org/10.1145/2063576.2063851

APA

Bozzon, A., Brambilla, M., Fraternali, P., & Tagliasacchi, M. (2011). Diversification for multi-domain result sets. In CIKM'11 - Proceedings of the 2011 ACM International Conference on Information and Knowledge Management (pp. 1905-1908). Association for Computing Machinery (ACM). https://doi.org/10.1145/2063576.2063851

Vancouver

Bozzon A, Brambilla M, Fraternali P, Tagliasacchi M. Diversification for multi-domain result sets. In CIKM'11 - Proceedings of the 2011 ACM International Conference on Information and Knowledge Management. New York: Association for Computing Machinery (ACM). 2011. p. 1905-1908 https://doi.org/10.1145/2063576.2063851

Author

Bozzon, Alessandro ; Brambilla, Marco ; Fraternali, Piero ; Tagliasacchi, Marco. / Diversification for multi-domain result sets. CIKM'11 - Proceedings of the 2011 ACM International Conference on Information and Knowledge Management. New York : Association for Computing Machinery (ACM), 2011. pp. 1905-1908

BibTeX

@inproceedings{ac7985017c6c407dbd72fd56bee9a434,
title = "Diversification for multi-domain result sets",
abstract = "Multi-domain search answers to queries spanning multiple entities, like {"}Find an affordable house in a city with low criminality index, good schools and medical services{"}, by producing ranked sets of entity combinations that maximize relevance, measured by a function expressing the user's preferences. Due to the combinatorial nature of results, good entity instances (e.g., inexpensive houses) tend to appear repeatedly in top-ranked combinations. To improve the quality of the result set, it is important to balance relevance (i.e., high values of the ranking function) with diversity, which promotes different, yet almost equally relevant, entities in the top-k combinations. This paper explores two different notions of diversity for multi-domain result sets, compares experimentally alternative algorithms for the trade-off between relevance and diversity, and performs a user study for evaluating the utility of diversification in multi-domain queries.",
keywords = "multi-domain search, result diversification",
author = "Alessandro Bozzon and Marco Brambilla and Piero Fraternali and Marco Tagliasacchi",
year = "2011",
doi = "10.1145/2063576.2063851",
language = "English",
isbn = "9781450307178",
pages = "1905--1908",
booktitle = "CIKM'11 - Proceedings of the 2011 ACM International Conference on Information and Knowledge Management",
publisher = "Association for Computing Machinery (ACM)",
address = "United States",
note = "20th ACM Conference on Information and Knowledge Management, CIKM'11 ; Conference date: 24-10-2011 Through 28-10-2011",

}

RIS

TY - GEN

T1 - Diversification for multi-domain result sets

AU - Bozzon, Alessandro

AU - Brambilla, Marco

AU - Fraternali, Piero

AU - Tagliasacchi, Marco

PY - 2011

Y1 - 2011

N2 - Multi-domain search answers to queries spanning multiple entities, like "Find an affordable house in a city with low criminality index, good schools and medical services", by producing ranked sets of entity combinations that maximize relevance, measured by a function expressing the user's preferences. Due to the combinatorial nature of results, good entity instances (e.g., inexpensive houses) tend to appear repeatedly in top-ranked combinations. To improve the quality of the result set, it is important to balance relevance (i.e., high values of the ranking function) with diversity, which promotes different, yet almost equally relevant, entities in the top-k combinations. This paper explores two different notions of diversity for multi-domain result sets, compares experimentally alternative algorithms for the trade-off between relevance and diversity, and performs a user study for evaluating the utility of diversification in multi-domain queries.

AB - Multi-domain search answers to queries spanning multiple entities, like "Find an affordable house in a city with low criminality index, good schools and medical services", by producing ranked sets of entity combinations that maximize relevance, measured by a function expressing the user's preferences. Due to the combinatorial nature of results, good entity instances (e.g., inexpensive houses) tend to appear repeatedly in top-ranked combinations. To improve the quality of the result set, it is important to balance relevance (i.e., high values of the ranking function) with diversity, which promotes different, yet almost equally relevant, entities in the top-k combinations. This paper explores two different notions of diversity for multi-domain result sets, compares experimentally alternative algorithms for the trade-off between relevance and diversity, and performs a user study for evaluating the utility of diversification in multi-domain queries.

KW - multi-domain search

KW - result diversification

UR - http://www.scopus.com/inward/record.url?scp=83055186827&partnerID=8YFLogxK

U2 - 10.1145/2063576.2063851

DO - 10.1145/2063576.2063851

M3 - Conference contribution

AN - SCOPUS:83055186827

SN - 9781450307178

SP - 1905

EP - 1908

BT - CIKM'11 - Proceedings of the 2011 ACM International Conference on Information and Knowledge Management

PB - Association for Computing Machinery (ACM)

CY - New York

T2 - 20th ACM Conference on Information and Knowledge Management, CIKM'11

Y2 - 24 October 2011 through 28 October 2011

ER -

ID: 45467813