{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T23:39:48Z","timestamp":1770421188825,"version":"3.49.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2022,8,5]],"date-time":"2022-08-05T00:00:00Z","timestamp":1659657600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,5]],"date-time":"2022-08-05T00:00:00Z","timestamp":1659657600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Open access funding provided by Universit\u00e0 degli Studi di Milano - Bicocca within the CRUI-CARE Agreement"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2023,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Metrics such as diversity and novelty have become important, beside accuracy, in the design of Recommender Systems (RSs), in response the increasing users' heterogeneity. Therefore, the design of RSs is now increasingly modelled as a multi-objective optimization problem (MOP) for whose solution Multi-objective evolutionary algorithms (MOEAs) have been increasingly considered. In this paper we focus on the k-top recommendation problem in which a solution is encoded as a matrix whose rows correspond to customers and column to items. The value of accuracy, novelty, and coverage for each candidate list, is evaluated as a sample and can be represented as a 3-d histogram which encodes the knowledge obtained from function evaluations. This enables to map the solution space into a space, whose elements are histograms, structured by the Wasserstein (WST) distance between histograms. The similarity between 2 users in this probabilistic space is given by the Wasserstein distance between their histograms. This enables the construction of the WST graph whose nodes are the users and the weights of the edges are the WST distance between users. The clustering of users takes then place in the WST-graph. In the optimization phase the difference between two top-k lists can be encoded as the WST distance between their 3-dimensional histograms. This enables to derive new selection operators which provide a better diversification (exploration). The new algorithm Multi-objective evolutionary optimization\/Wasserstein (MOEA\/WST), compared with the benchmark NSGA-II, yields better hypervolume and coverage, in particular at low generation counts.<\/jats:p>","DOI":"10.1007\/s12652-022-04356-0","type":"journal-article","created":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T10:06:09Z","timestamp":1662545169000},"page":"10849-10865","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Distributional learning in multi-objective optimization of recommender systems"],"prefix":"10.1007","volume":"14","author":[{"given":"Antonio","family":"Candelieri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4187-4209","authenticated-orcid":false,"given":"Andrea","family":"Ponti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilaria","family":"Giordani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Bosio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Archetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,5]]},"reference":[{"key":"4356_CR1","unstructured":"Abdollahpouri H, Mansoury M, Burke R, Mobasher B (2019) The unfairness of popularity bias in recommendation.\u00a0arXiv preprint arXiv:1907.13286"},{"issue":"2","key":"4356_CR2","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1111\/j.2517-6161.1982.tb01195.x","volume":"44","author":"J Aitchison","year":"1982","unstructured":"Aitchison J (1982) The statistical analysis of compositional data. J R Stat Soc: Series B (Methodologic) 44(2):139\u2013160","journal-title":"J R Stat Soc: Series B (Methodologic)"},{"key":"4356_CR3","unstructured":"Arjovsky M, Chintala S, Bottou L (2017) Wasserstein generative adversarial networks. In: International conference on machine learning. PMLR, pp 214\u2013223"},{"key":"4356_CR4","unstructured":"Atasu K, Mittelholzer T (2019) Linear-complexity data-parallel earth mover\u2019s distance approximations. In: International Conference on machine learning. PMLR, pp 364\u2013373"},{"key":"4356_CR5","unstructured":"Backurs A, Dong Y, Indyk P, Razenshteyn I, Wagner T (2020) Scalable nearest neighbour search for optimal transport. In: International Conference on machine learning, vol 119. PMLR, pp 497\u2013506"},{"key":"4356_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2021.100395","volume":"40","author":"TK Balaji","year":"2021","unstructured":"Balaji TK, Annavarapu CSR, Bablani A (2021) Machine learning algorithms for social media analysis: a survey. Comput Sci Rev 40:100395","journal-title":"Comput Sci Rev"},{"key":"4356_CR7","unstructured":"Beugnot G, Genevay A, Greenewald K, Solomon J (2021) Improving approximate optimal transport distances using quantization. In: de Campos CP, Maathuis MH, Quaeghebeur E (eds) Uncertainty in artificial intelligence, vol 161. AUAI Press, pp 290\u2013300"},{"key":"4356_CR8","doi-asserted-by":"publisher","first-page":"89497","DOI":"10.1109\/ACCESS.2020.2990567","volume":"8","author":"J Blank","year":"2020","unstructured":"Blank J, Deb K (2020) Pymoo: Multi-objective optimization in python. IEEE Access 8:89497\u201389509","journal-title":"IEEE Access"},{"issue":"4","key":"4356_CR9","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/2897824.2925918","volume":"35","author":"N Bonneel","year":"2016","unstructured":"Bonneel N, Peyr\u00e9 G, Cuturi M (2016) Wasserstein barycentric coordinates: histogram regression using optimal transport. ACM Trans Graph 35(4):71\u201381","journal-title":"ACM Trans Graph"},{"key":"4356_CR10","doi-asserted-by":"crossref","unstructured":"Castells P, Hurley NJ, Vargas S (2015) Novelty and diversity in recommender systems. In: Ricci F, Rokach L, Shapira B (eds) Recommender systems handbook. Springer, Boston, pp 881\u2013918","DOI":"10.1007\/978-1-4899-7637-6_26"},{"key":"4356_CR11","doi-asserted-by":"crossref","unstructured":"Christakopoulou K, Banerjee A (2018) Learning to interact with users: A collaborative-bandit approach. In: Proceedings of the 2018 SIAM International Conference on Data Mining, vol 2018. Society for Industrial and Applied Mathematics, pp 612\u2013620","DOI":"10.1137\/1.9781611975321.69"},{"issue":"1","key":"4356_CR12","first-page":"533","volume":"15","author":"M Cuturi","year":"2014","unstructured":"Cuturi M, Avis D (2014) Ground metric learning. J Mach Learn Res 15(1):533\u2013564","journal-title":"J Mach Learn Res"},{"key":"4356_CR13","unstructured":"Daulton S, Balandat M, Bakshy E (2020) Differentiable expected hypervolume improvement for parallel multi-objective Bayesian optimization. arXiv preprint arXiv:2006.05078"},{"issue":"78","key":"4356_CR14","first-page":"1","volume":"22","author":"R Flamary","year":"2021","unstructured":"Flamary R, Courty N, Gramfort A, Alaya MZ, Boisbunon A, ChambonVayer ST (2021) Pot: Python optimal transport. J Mach Learn Res 22(78):1\u20138","journal-title":"J Mach Learn Res"},{"key":"4356_CR15","unstructured":"Galichon A (2021) The unreasonable effectiveness of optimal transport in economics.\u00a0arXiv preprint arXiv:2107.04700"},{"issue":"4","key":"4356_CR16","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10287-020-00376-3","volume":"17","author":"BG Galuzzi","year":"2020","unstructured":"Galuzzi BG, Giordani I, Candelieri A, Perego R, Archetti F (2020) Hyperparameter optimization for recommender systems through Bayesian optimization. CMS 17(4):495\u2013515","journal-title":"CMS"},{"key":"4356_CR17","unstructured":"Gentile C, Li S, Kar P, Karatzoglou A, Zappella G, Etrue E (2017) On context-dependent clustering of bandits. In: International Conference on machine learning, vol 70. PMLR, pp 1253\u20131262"},{"key":"4356_CR18","first-page":"4052","volume":"44","author":"N Gillis","year":"2021","unstructured":"Gillis N, Leplat V, Tan V (2021) Distributionally robust and multi-objective nonnegative matrix factorization.\u00a0IEEE Trans Pattern Anal Mach Intell 44:4052\u20134064","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"4356_CR19","unstructured":"Guillou F, Gaudel R, Preux P (2015) Collaborative filtering as a multi-armed bandit. In: NIPS'15 Workshop: Machine Learning for eCommerce"},{"issue":"1","key":"4356_CR20","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10851-020-00996-z","volume":"63","author":"M Heitz","year":"2021","unstructured":"Heitz M, Bonneel N, Coeurjolly D, Cuturi M, Peyr\u00e9 G (2021) Ground metric learning on graphs. J Math Imaginf vis 63(1):89\u2013107","journal-title":"J Math Imaginf vis"},{"key":"4356_CR21","unstructured":"Hejazinia M, Eastman K, Ye S, Amirabadi A, Divvela R (2019) Accelerated learning from recommender systems using multi-armed bandit.\u00a0arXiv preprint arXiv:1908.06158"},{"key":"4356_CR22","first-page":"7400","volume":"32","author":"P Indyk","year":"2019","unstructured":"Indyk P, Vakilian A, Yuan Y (2019) Learning-based low-rank approximations. Adv Neural Inf Process Syst 32:7400\u20137410","journal-title":"Adv Neural Inf Process Syst"},{"key":"4356_CR23","unstructured":"Kantorovich L (1942) On the transfer of masses (in Russian). In: Doklady Akademii Nauk. pp 227\u2013229"},{"issue":"2","key":"4356_CR24","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10994-014-5446-z","volume":"99","author":"T Le","year":"2015","unstructured":"Le T, Cuturi M (2015) Adaptive Euclidean maps for histograms: generalized Aitchison embeddings. Mach Learn 99(2):169\u2013187","journal-title":"Mach Learn"},{"key":"4356_CR25","doi-asserted-by":"crossref","unstructured":"Li B, Qian C, Li J, Tang K, Yao X (2016) Search based recommender system using many-objective evolutionary algorithm. In: 2016 IEEE Congress on Evolutionary Computation (CEC), vol 2016. IEEE, pp 120\u2013126","DOI":"10.1109\/CEC.2016.7743786"},{"issue":"1","key":"4356_CR26","first-page":"012057","volume":"1864","author":"R Li","year":"2020","unstructured":"Li R, Qian F, Du X, Zhao S, Zhang Y (2020) A collaborative filtering recommendation framework based on Wasserstein GAN. J Phys Conf Ser 1864(1):012057","journal-title":"J Phys Conf Ser"},{"key":"4356_CR27","doi-asserted-by":"crossref","unstructured":"Lin Q, Wang X, Hu B, Ma L, Chen F, Li J, Coello Coello CA (2018) Multiobjective personalized recommendation algorithm using extreme point guided evolutionary computation.\u00a0Complexity 2018:1716352\u20131\u20131716352\u201318","DOI":"10.1155\/2018\/1716352"},{"key":"4356_CR28","first-page":"12060","volume":"32","author":"X Lin","year":"2019","unstructured":"Lin X, Zhen HL, Li Z, Zhang QF, Kwong S (2019) Pareto multi-task learning. Adv Neural Inf Process Syst 32:12060\u201312070","journal-title":"Adv Neural Inf Process Syst"},{"key":"4356_CR29","doi-asserted-by":"crossref","unstructured":"Ma C, Ma L, Zhang Y, Tang R, Liu X, Coates M (2020).Probabilistic metric learning with adaptive margin for top-k recommendation. In: Proceedings of the 26th ACM SIGKDD International Conference on knowledge discovery & data mining, pp 1036\u20131044","DOI":"10.1145\/3394486.3403147"},{"key":"4356_CR30","doi-asserted-by":"crossref","unstructured":"Meng Y, Yan X, Liu W, Wu H, Cheng J (2020) Wasserstein collaborative filtering for item cold-start recommendation. In: Proceedings of the 28th ACM Conference on user modeling, adaptation and personalization, vol 2020, pp 318\u2013322","DOI":"10.1145\/3340631.3394870"},{"key":"4356_CR31","unstructured":"Monge G (1781) M\u00e9moire sur la th\u00e9orie des d\u00e9blais et des remblais. Histoire de l\u2019Acad\u00e9mie Royale des Sciences de Paris"},{"key":"4356_CR32","doi-asserted-by":"crossref","unstructured":"Nguyen TV, Karatzoglou A, Baltrunas L (2014) Gaussian process factorization machines for context-aware recommendations. In: Proceedings of the 37th international ACM SIGIR Conference on research & development in information retrieval, vol 1, pp 63\u201372","DOI":"10.1145\/2600428.2609623"},{"issue":"3","key":"4356_CR33","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8121\/ab5877","volume":"53","author":"K \u00d6cal","year":"2019","unstructured":"\u00d6cal K, Grima R, Sanguinetti G (2019) Parameter estimation for biochemical reaction networks using Wasserstein distances. J Phys A Math Theor 53(3):034002","journal-title":"J Phys A Math Theor"},{"issue":"5\u20136","key":"4356_CR34","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1561\/2200000073","volume":"11","author":"G Peyr\u00e9","year":"2019","unstructured":"Peyr\u00e9 G, Cuturi M (2019) Computational optimal transport: with applications to data science. Found Trends\u00ae Mach Learn 11(5\u20136):355\u2013607","journal-title":"Found Trends\u00ae Mach Learn"},{"issue":"12","key":"4356_CR35","doi-asserted-by":"publisher","first-page":"1625","DOI":"10.3390\/w13121625","volume":"13","author":"A Ponti","year":"2021","unstructured":"Ponti A, Candelieri A, Archetti F (2021a) A new evolutionary approach to optimal sensor placement in water distribution networks. Water 13(12):1625","journal-title":"Water"},{"key":"4356_CR36","volume":"10","author":"A Ponti","year":"2021","unstructured":"Ponti A, Candelieri A, Archetti F (2021b) A Wasserstein distance based multiobjective evolutionary algorithm for the risk aware optimization of sensor placement. Intell Syst Appl 10:200047","journal-title":"Intell Syst Appl"},{"key":"4356_CR37","unstructured":"Rakotomamonjy A, Traor\u00e9 A, Berar M, Flamary R, Courty N (2018) Distance measure machines.\u00a0arXiv preprint arXiv:1803.00250"},{"issue":"4","key":"4356_CR38","first-page":"1","volume":"5","author":"MT Ribeiro","year":"2014","unstructured":"Ribeiro MT, Ziviani N, Moura ESD, Hata I, Lacerda A, Veloso A (2014) Multiobjective pareto-efficient approaches for recommender systems. ACM Trans Intellt Syst Technol (TIST) 5(4):1\u201320","journal-title":"ACM Trans Intellt Syst Technol (TIST)"},{"key":"4356_CR39","first-page":"21260","volume":"33","author":"N Si","year":"2020","unstructured":"Si N, Blanchet J, Ghosh S, Squillante M (2020) Quantifying the empirical Wasserstein distance to a set of measures: beating the curse of dimensionality. Adv Neural Inf Process Syst 33:21260\u201321270","journal-title":"Adv Neural Inf Process Syst"},{"key":"4356_CR40","unstructured":"Solomon J, Rustamov R, Guibas L, Butscher A (2014) Wasserstein propagation for semi-supervised learning. In: International Conference on machine learning, vol 32. PMLR, pp 306\u2013314"},{"key":"4356_CR41","doi-asserted-by":"crossref","unstructured":"Vanchinathan HP, Nikolic I, De Bona F, Krause A (2014) Explore-exploit in top-n recommender systems via Gaussian processes. In: Proceedings of the 8th ACM Conference on Recommender systems, vol 2014, pp 225\u2013232","DOI":"10.1145\/2645710.2645733"},{"key":"4356_CR42","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/978-3-540-71050-9","volume-title":"Optimal transport: old and new","author":"C Villani","year":"2009","unstructured":"Villani C (2009) Optimal transport: old and new, vol 338. Springer, Berlin, p 23"},{"issue":"2","key":"4356_CR43","first-page":"207","volume":"10","author":"KQ Weinberger","year":"2009","unstructured":"Weinberger KQ, Saul LK (2009) Distance metric learning for large margin nearest neighbor classification.\u00a0J Mach Learn Res 10(2):207\u2013244","journal-title":"J Mach Learn Res"},{"key":"4356_CR44","doi-asserted-by":"crossref","unstructured":"Wang C, Liu Q, Wu R, Chen E, Liu C, Huang X, Huang Z (2018a) Confidence-aware matrix factorization for recommender systems. In: Proceedings of the AAAI Conference on artificial intelligence, Vol. 32, No. 1, pp 434\u2013442","DOI":"10.1609\/aaai.v32i1.11251"},{"issue":"8","key":"4356_CR45","doi-asserted-by":"publisher","first-page":"1569","DOI":"10.1109\/TKDE.2018.2866041","volume":"31","author":"Q Wang","year":"2018","unstructured":"Wang Q, Zeng C, Zhou W, Li T, Iyengar SS, Shwartz L, Grabarnik GY (2018b) Online interactive collaborative filtering using multi-armed bandit with dependent arms. IEEE Trans Knowl Data Eng 31(8):1569\u20131580","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"4356_CR46","unstructured":"Zhang S, Yao L, Tay Y, Xu X, Zhang X, Zhu L (2018) Metric factorization: recommendation beyond matrix factorization.\u00a0arXiv preprint arXiv:1802.04606"},{"issue":"7","key":"4356_CR47","doi-asserted-by":"publisher","first-page":"2793","DOI":"10.1007\/s00521-020-05117-w","volume":"33","author":"X Zhang","year":"2021","unstructured":"Zhang X, Zhong J, Liu K (2021) Wasserstein autoencoders for collaborative filtering. Neural Comput Appl 33(7):2793\u20132802","journal-title":"Neural Comput Appl"},{"key":"4356_CR48","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.patrec.2021.06.015","volume":"150","author":"Z Zhao","year":"2021","unstructured":"Zhao Z, Nie J, Wang C, Huang L (2021) Sliced Wasserstein based canonical correlation analysis for cross-domain recommendation. Pattern Recogn Lett 150:33\u201339","journal-title":"Pattern Recogn Lett"},{"key":"4356_CR49","doi-asserted-by":"crossref","unstructured":"Zheng Y, Agnani M, Singh M (2017). Identification of grey sheep users by histogram intersection in recommender systems. In: International Conference on advanced data mining and applications, vol 10604. Springer, Cham, pp 148\u2013161","DOI":"10.1007\/978-3-319-69179-4_11"},{"issue":"10","key":"4356_CR50","doi-asserted-by":"publisher","first-page":"4511","DOI":"10.1073\/pnas.1000488107","volume":"107","author":"T Zhou","year":"2010","unstructured":"Zhou T, Kuscsik Z, Liu JG, Medo M, Wakeling JR, Zhang YC (2010) Solving the apparent diversity-accuracy dilemma of recommender systems. Proc Natl Acad Sci 107(10):4511\u20134515","journal-title":"Proc Natl Acad Sci"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-022-04356-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12652-022-04356-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-022-04356-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,3]],"date-time":"2024-10-03T10:54:16Z","timestamp":1727952856000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12652-022-04356-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,5]]},"references-count":50,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["4356"],"URL":"https:\/\/doi.org\/10.1007\/s12652-022-04356-0","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"value":"1868-5137","type":"print"},{"value":"1868-5145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,5]]},"assertion":[{"value":"29 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}