Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2012
DOI: 10.1145/2339530.2339642
|View full text |Cite
|
Sign up to set email alerts
|

Online learning to diversify from implicit feedback

Abstract: In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these diversification mechanisms are largely hand-coded or relied on expensive training data provided by experts. To overcome this problem, we propose an online learning model and algorithms for learning diversified recommendations and retrieval functions from implicit feedback. In our model, the learning algorithm presents a ranking to the use… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
41
0
2

Year Published

2013
2013
2019
2019

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 52 publications
(47 citation statements)
references
References 14 publications
1
41
0
2
Order By: Relevance
“…The first source is likely to increase and other data sources are fined due to fewer numbers of user feedback. Raman et al have proposed online learning-based ranking algorithm to create a balance between relevance and diversity [32]. At each stage, a user is provided with the results of ranking algorithms.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The first source is likely to increase and other data sources are fined due to fewer numbers of user feedback. Raman et al have proposed online learning-based ranking algorithm to create a balance between relevance and diversity [32]. At each stage, a user is provided with the results of ranking algorithms.…”
Section: Related Workmentioning
confidence: 99%
“…At each stage, a user is provided with the results of ranking algorithms. Theoretically, the efficiency of the algorithm has increased and the algorithm is resistant to noise [32]. DBGD ranking algorithm is online and based on reinforcement learning [33,34].…”
Section: Related Workmentioning
confidence: 99%
“…Recently, coactive learning [14] has been applied to the problem of intrinsic diversity. As opposed to our problem (i.e., extrinsic diversity [1]) intrinsic diversity is diversity required by a single individual among their various different interests.…”
Section: Related Workmentioning
confidence: 99%
“…As done in previous work [14], we assume that the utility functions U i (x t , y t ) is linear in its parameters v i ∈ R m .…”
Section: Submodular Utility Modelmentioning
confidence: 99%
See 1 more Smart Citation