2013 IEEE 37th Annual Computer Software and Applications Conference Workshops 2013
DOI: 10.1109/compsacw.2013.68
|View full text |Cite
|
Sign up to set email alerts
|

Enhancing Diversity-Accuracy Technique on User-Based Top-N Recommendation Algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(6 citation statements)
references
References 6 publications
0
6
0
Order By: Relevance
“…They also proposed a graph-theoretic approach to increase the diversity of recommended items based on maximum bipartite matching computations. Premchaiswadi et al ( 2013 ) proposed a total diversity effect ranking for improving diversity by considering the diversity effect of each item in the recommendation list. Sun et al ( 2020 ) proposed a recommendation method based on Bayesian graph convolutional neural networks.…”
Section: Related Workmentioning
confidence: 99%
“…They also proposed a graph-theoretic approach to increase the diversity of recommended items based on maximum bipartite matching computations. Premchaiswadi et al ( 2013 ) proposed a total diversity effect ranking for improving diversity by considering the diversity effect of each item in the recommendation list. Sun et al ( 2020 ) proposed a recommendation method based on Bayesian graph convolutional neural networks.…”
Section: Related Workmentioning
confidence: 99%
“…As for diversification strategies, its nature is a trade-off between diversity and accuracy. One common and easy-toconduct strategy is post-filtering, which recommends top N+ND accurate items first, and then removes ND items to achieve the highest diversity [31], or just select top N representative items after the clustering [32]. Another strategy regards this trade-off as a multi-objective optimization, which leverages swarm intelligence, simulated annealing, genetic algorithms, or other heuristic algorithms to re-rank the recommendation list and achieves a…”
Section: Related Work 21 Recommendation Approaches and Diversity Stra...mentioning
confidence: 99%
“…This section will fine-tune it to achieve the best recommendation performance. Specifically, for each length of L, Top 9 items were firstly recommended by 5 nearest neighbors, and 4 items were then filtered out by the diversification strategy (i.e., K = 5, N = 5, and ND = 4, referring to [31]). The average scores of F-Score, NDCG, Div, and T on total 22 non-repetitive pairs of (U, C) were shown in Figure 5.…”
Section: Implementation and Fine-tuning Of The Proposed Approachmentioning
confidence: 99%
See 1 more Smart Citation
“…Many research works [1,3,14,49] have been undertaken to propose novel diversification algorithms. Our proposed module can learn the diverse trends of user preference and provide recommendation with diversity.…”
Section: Recommendation Diversitymentioning
confidence: 99%