A New System-Wide Diversity Measure for Recommendations with Efficient Algorithms

DOI10.1137/18M1226014zbMath1499.05586arXiv1812.03030OpenAlexW2984509164WikidataQ126794608 ScholiaQ126794608MaRDI QIDQ5025771

Arda Antikacioglu, R. Ravi, Tanvi Bajpai

Publication date: 3 February 2022

Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.03030

zbMATH Keywords

network flowrecommender systemssubgraph selectionsystem-wide diversity

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Uses Software

• RankSys

Cites Work

• An analysis of approximations for maximizing submodular set functions—I

This page was built for publication: A New System-Wide Diversity Measure for Recommendations with Efficient Algorithms