Proceedings of the 37th International ACM SIGIR Conference on Research &Amp; Development in Information Retrieval 2014
DOI: 10.1145/2600428.2609634
|View full text |Cite
|
Sign up to set email alerts
|

Learning for search result diversification

Abstract: Search result diversification has gained attention as a way to tackle the ambiguous or multi-faceted information needs of users. Most existing methods on this problem utilize a heuristic predefined ranking function, where limited features can be incorporated and extensive tuning is required for different settings. In this paper, we address search result diversification as a learning problem, and introduce a novel relational learning-to-rank approach to formulate the task. However, the definitions of ranking fu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
58
2

Year Published

2015
2015
2022
2022

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 77 publications
(60 citation statements)
references
References 33 publications
0
58
2
Order By: Relevance
“…Diversity in search (both explicit and implicit) has seen a rich body of literature lately in [22,14,3,41,15,47,35,23]. Search result diversification aims to maximise the overall relevance of a document ranking to multiple query aspects, while minimising its redundancy with respect to these aspects.…”
Section: Search Results Diversificationmentioning
confidence: 99%
“…Diversity in search (both explicit and implicit) has seen a rich body of literature lately in [22,14,3,41,15,47,35,23]. Search result diversification aims to maximise the overall relevance of a document ranking to multiple query aspects, while minimising its redundancy with respect to these aspects.…”
Section: Search Results Diversificationmentioning
confidence: 99%
“…Query result diversification has been extensively studied for recent years. Most previous work on query result diversification can be classified into the following two categories: implicit and explicit [31,39]. Our problem belongs to the former category.…”
Section: Related Workmentioning
confidence: 99%
“…He et al [23] introduced a flexible algorithm to combine multiple external resources. Zhu et al [24] provided a learning-to-rank approach to promote diversity. Yu and Ren [25] treated the diversity task as a multiple subtopic knapsack problem and re-ranked the documents like filling up multiple subtopic knapsacks.…”
Section: Related Workmentioning
confidence: 99%