{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T17:29:23Z","timestamp":1755797363482,"version":"3.44.0"},"reference-count":59,"publisher":"Association for Computing Machinery (ACM)","issue":"4","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2025,8,31]]},"abstract":"<jats:p>While accuracy has long been prioritized as the primary metric for Recommender Systems (RSs), it is increasingly accepted that the system\u2019s overall quality is not solely determined by this factor. Reachability, the ease with which users can navigate the whole content catalog through recommendations, emerges as a pivotal yet under-explored concept: not only it ensures a smooth experience for users, but it also provides more equitable exposure for the items, avoiding that only a small fraction of popular items get the bulk of the attention. Despite its importance, the few existing studies analyze reachability without attempting a proper optimization.<\/jats:p>\n          <jats:p>In this article, we study the problem of optimizing the overall reachability of a RS while maintaining high-quality recommendations. We model a user browsing session as a random walk on a recommendation graph, where the links and the transition probabilities are defined based on the relevance score of the recommendation list that the user gets at every step. In this setting, reachability is modeled as the expected length of a path to reach a given item. We introduce two optimization problems, one discrete and one continuous, and characterize their theoretical properties. We then devise two algorithms that outperform non-trivial baseline methods in enhancing reachability while maintaining a high Normalized Discounted Cumulative Gain (nDCG) score. Our experimental results show that, in some settings, our methods are able to improve the reachability metric by 80% while only compromising nDCG by 5%. Moreover, our empirical analysis shows that optimizing for reachability provides positive effects also on other prevalent \u201cbeyond-accuracy\u201d metrics.<\/jats:p>","DOI":"10.1145\/3744658","type":"journal-article","created":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:20:44Z","timestamp":1750281644000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing Reachability in Graph-Based Recommender Systems"],"prefix":"10.1145","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9917-1501","authenticated-orcid":false,"given":"Alex","family":"Mart\u00ednez","sequence":"first","affiliation":[{"name":"Eurecat Centre Tecnol\u00f2gic de Catalunya, Barcelona, Spain and Universitat de Barcelona, Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6696-9637","authenticated-orcid":false,"given":"Federico","family":"Cinus","sequence":"additional","affiliation":[{"name":"CENTAI, Turin, Italy  and University of Rome La Sapienza, Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9464-8315","authenticated-orcid":false,"given":"Francesco","family":"Bonchi","sequence":"additional","affiliation":[{"name":"CENTAI, Turin, Italy  and Eurecat Centre Tecnol\u00f2gic de Catalunya, Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1484-539X","authenticated-orcid":false,"given":"Jordi","family":"Vitri\u00e0","sequence":"additional","affiliation":[{"name":"Universitat de Barcelona, Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,8,18]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-29337-X"},{"key":"e_1_3_2_3_2","unstructured":"Himan Abdollahpouri Masoud Mansoury Robin Burke and Bamshad Mobasher. 2019. The unfairness of popularity bias in recommendation. arXiv:1907.13286. Retrieved from https:\/\/arxiv.org\/abs\/1907.13286"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/2559952"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599434"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3002803"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3166071"},{"key":"e_1_3_2_8_2","unstructured":"Richard L. Burden and J. Douglas Faires. 1997. Numerical Analysis. Brooks."},{"issue":"1","key":"e_1_3_2_9_2","doi-asserted-by":"crossref","first-page":"013107","DOI":"10.1063\/1.2137622","article-title":"Topology of music recommendation networks","volume":"16","author":"Cano Pedro","year":"2006","unstructured":"Pedro Cano, Oscar Celma, Markus Koppenberger, and Javier M. Buld\u00fa. 2006. Topology of music recommendation networks. Chaos: An Interdisciplinary Journal of Nonlinear Science 16, 1 (2006), 013107-1\u2013 013107\u20136.","journal-title":"Chaos: An Interdisciplinary Journal of Nonlinear Science"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/1722149.1722154"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/1454008.1454038"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-015-0447-5"},{"issue":"1","key":"e_1_3_2_13_2","first-page":"390","article-title":"Edge manipulation approaches for k-core minimization: Metrics and analytics","volume":"35","author":"Chen Chen","year":"2021","unstructured":"Chen Chen, Qiuyu Zhu, Renjie Sun, Xiaoyang Wang, and Yanping Wu. 2021. Edge manipulation approaches for k-core minimization: Metrics and analytics. IEEE Transactions on Knowledge and Data Engineering 35, 1 (2021), 390\u2013403.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-020-00343-6"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1609\/icwsm.v16i1.19275"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599489"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959190"},{"key":"e_1_3_2_18_2","first-page":"2265","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Curmei Mihaela","year":"2021","unstructured":"Mihaela Curmei, Sarah Dean, and Benjamin Recht. 2021. Quantifying availability and discovery in recommender systems via stochastic reachability. In Proceedings of the International Conference on Machine Learning. PMLR, 2265\u20132275."},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3351095.3372866"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2024.100618"},{"issue":"4","key":"e_1_3_2_21_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3643857","article-title":"Overcoming diverse undesired effects in recommender systems: A deontological approach","volume":"15","author":"Duran Paula G.","year":"2024","unstructured":"Paula G. Duran, Pere Gilabert, Santi Segu\u00ed, and Jordi Vitri\u00e0. 2024. Overcoming diverse undesired effects in recommender systems: A deontological approach. ACM Transactions on Intelligent Systems and Technology 15, 4 (2024), 1\u201323.","journal-title":"ACM Transactions on Intelligent Systems and Technology"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.3389\/fdata.2023.1251072"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/2645710.2645737"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512143"},{"key":"e_1_3_2_25_2","unstructured":"Maur\u00edcio Gruppi Benjamin D. Horne and Sibel Adali. 2022. NELA-GT-2022: A large multi-labelled news dataset for the study of misinformation in news articles. arXiv:2203.05659. Retrieved from https:\/\/arxiv.org\/abs\/2203.05659"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441825"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-022-00875-8"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1080\/1369118X.2016.1271900"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3351095.3372879"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.22"},{"key":"e_1_3_2_31_2","first-page":"855","volume-title":"Proceedings of the International Conference on Machine Learning. PMLR","author":"Iyer Rishabh","year":"2013","unstructured":"Rishabh Iyer, Stefanie Jegelka, and Jeff Bilmes. 2013. Fast semidifferential-based submodular function optimization. In Proceedings of the International Conference on Machine Learning. PMLR, 855\u2013863."},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582418"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1038\/35036627"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/2926720"},{"key":"e_1_3_2_35_2","unstructured":"Dieter Kraft. 1988. A software package for sequential quadratic programming. Forschungsbericht- Deutsche Forschungs- und Versuchsanstalt fur Luft- und Raumfahrt DFVLR-FB 88\u201328 (1988) 33 pages."},{"key":"e_1_3_2_36_2","first-page":"1","volume-title":"Proceedings of the 15th International Conference on Knowledge Technologies and Data-Driven Business","author":"Lamprecht Daniel","year":"2015","unstructured":"Daniel Lamprecht, Florian Geigl, Tomas Karas, Simon Walk, Denis Helic, and Markus Strohmaier. 2015. Improving recommender system navigability through diversification: A case study of IMDb. In Proceedings of the 15th International Conference on Knowledge Technologies and Data-Driven Business, 1\u20138."},{"key":"e_1_3_2_37_2","unstructured":"Kristina Lerman and Laurie Jones. 2006. Social browsing on Flickr. arXiv:cs\/0612047. Retrieved from https:\/\/arxiv.org\/abs\/cs\/0612047"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.103"},{"key":"e_1_3_2_39_2","first-page":"126","volume-title":"Proceedings of the 2018 SIAM International Conference on Data Mining","author":"Medya Sourav","year":"2018","unstructured":"Sourav Medya, Arlei Silva, Ambuj Singh, Prithwish Basu, and Ananthram Swami. 2018. Group centrality maximization via network design. In Proceedings of the 2018 SIAM International Conference on Data Mining. SIAM, 126\u2013134."},{"key":"e_1_3_2_40_2","first-page":"272","volume-title":"Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization","author":"Meyerson Adam","year":"2009","unstructured":"Adam Meyerson and Brian Tagiku. 2009. Minimizing average shortest path distances via shortcut edge addition. In Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization. Springer, 272\u2013285."},{"issue":"1","key":"e_1_3_2_41_2","first-page":"60","article-title":"The small world problem","volume":"2","author":"Milgram Stanley","year":"1967","unstructured":"Stanley Milgram. 1967. The small world problem. Psychology Today 2, 1 (1967), 60\u201367.","journal-title":"Psychology Today"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.98.2.404"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2568012"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063952"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/3460231.3474234"},{"key":"e_1_3_2_47_2","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/1.9781611974010.4","volume-title":"Proceedings of the 2015 SIAM International Conference on Data Mining","author":"Parotsidis Nikos","year":"2015","unstructured":"Nikos Parotsidis, Evaggelia Pitoura, and Panayiotis Tsaparas. 2015. Selecting shortcuts for a smaller world. In Proceedings of the 2015 SIAM International Conference on Data Mining. SIAM, 28\u201336."},{"issue":"15","key":"e_1_3_2_48_2","first-page":"510","article-title":"The matrix cookbook","volume":"7","author":"Petersen Kaare Brandt","year":"2008","unstructured":"Kaare Brandt Petersen and Michael Syskind Pedersen. 2008. The matrix cookbook. Technical University of Denmark 7, 15 (2008), 510.","journal-title":"Technical University of Denmark"},{"key":"e_1_3_2_49_2","volume-title":"Numerical Recipes 3rd Edition: The Art of Scientific Computing","author":"Press William H.","year":"2007","unstructured":"William H. Press. 2007. Numerical Recipes 3rd Edition: The Art of Scientific Computing. Cambridge University Press."},{"issue":"3","key":"e_1_3_2_50_2","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1002\/jgt.3190110315","article-title":"Diameter increase caused by edge deletion","volume":"11","author":"Schoone Anneke A.","year":"1987","unstructured":"Anneke A. Schoone, Hans L. Bodlaender, and Jan Van Leeuwen. 1987. Diameter increase caused by edge deletion. Journal of Graph Theory 11, 3 (1987), 409\u2013427.","journal-title":"Journal of Graph Theory"},{"key":"e_1_3_2_51_2","unstructured":"Klaus Seyerlehner Peter Knees Dominik Schnitzer and Gerhard Widmer. 2009. Browsing music recommendation networks. In Proceedings of the 2009 International Society for Music Information Retrieval (ISMIR) 129\u2013134."},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-017-0762-9"},{"key":"e_1_3_2_53_2","first-page":"16857","article-title":"MPNet: Masked and permuted pre-training for language understanding","volume":"33","author":"Song Kaitao","year":"2020","unstructured":"Kaitao Song, Xu Tan, Tao Qin, Jianfeng Lu, and Tie-Yan Liu. 2020. MPNet: Masked and permuted pre-training for language understanding. In Proceedings of the Advances in Neural Information Processing Systems, Vol. 33, 16857\u201316867.","journal-title":"Proceedings of the Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3072165"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1137\/100783352"},{"key":"e_1_3_2_56_2","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/B978-0-12-442450-0.50018-3","volume-title":"Social Networks","author":"Travers Jeffrey","year":"1977","unstructured":"Jeffrey Travers and Stanley Milgram. 1977. An experimental study of the small world problem. In Social Networks. Samuel Leinhardt (Ed.), Elsevier, 179\u2013197."},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1145\/3240323.3240347"},{"key":"e_1_3_2_58_2","doi-asserted-by":"crossref","unstructured":"Joe Whittaker Se\u00e1n Looney Alastair Reed and Fabio Votta. 2021. Recommender systems and the amplification of extremist content. Internet Policy Review 10 2 (2021) 1\u201329.","DOI":"10.14763\/2021.2.1565"},{"key":"e_1_3_2_59_2","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/3298689.3346997","volume-title":"Proceedings of the 13th ACM Conference on Recommender Systems (RecSys \u201919)","author":"Zhao Zhe","year":"2019","unstructured":"Zhe Zhao, Lichan Hong, Li Wei, Jilin Chen, Aniruddh Nath, Shawn Andrews, Aditee Kumthekar, Maheswaran Sathiamoorthy, Xinyang Yi, and Ed Chi. 2019. Recommending what video to watch next: A multitask ranking system. In Proceedings of the 13th ACM Conference on Recommender Systems (RecSys \u201919), 43\u201351."},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-020-0135-9"}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3744658","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,18]],"date-time":"2025-08-18T17:49:52Z","timestamp":1755539392000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3744658"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,18]]},"references-count":59,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,8,31]]}},"alternative-id":["10.1145\/3744658"],"URL":"https:\/\/doi.org\/10.1145\/3744658","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"type":"print","value":"2157-6904"},{"type":"electronic","value":"2157-6912"}],"subject":[],"published":{"date-parts":[[2025,8,18]]},"assertion":[{"value":"2024-12-13","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-05-22","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-08-18","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}