{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T17:05:49Z","timestamp":1763831149802,"version":"3.45.0"},"reference-count":49,"publisher":"Association for Computing Machinery (ACM)","issue":"2","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Recomm. Syst."],"published-print":{"date-parts":[[2026,6,30]]},"abstract":"<jats:p>The ranking task is the critical step performed during a recommendation process to predict the top-list of most-wanted products for users. Learn-to-rank algorithms have been developed to refine the ranking process. However, the underrepresentation of some demographic user categories leads to unwanted biased ranking performances that affect the fairness aspects of the recommendation. Bayesian Pairwise Ranking (BPR) is among the most popular ranking algorithms for its important ranking accuracy performance. BPR with machine learning recommendation models can unfairly perform for minority user groups. We tackle the unfairness in the recommendation by proposing the FEBPR method. Our proposal is a fair pairwise Bayesian ranking in which the data debiasing is performed by using adversarial learning fed by enriched embeddings. In our proposal, user and item embeddings are learned to obey the adversarial constraint and mislead the adversary classifier that should not be able to have a priori assumptions about user membership. Extensive experiments are performed on real-world datasets and show that the performances of the proposed debiasing method improve fairness ranking aspects, and therefore the recommendation fairness. It is also shown that our proposal outperforms state-of-the-art fairness ranking methods and presents an interesting tradeoff between the fairness aspects and ranking accuracy.<\/jats:p>","DOI":"10.1145\/3749106","type":"journal-article","created":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T11:08:04Z","timestamp":1752664084000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Fair Enhanced Bayesian Personalized Ranking Using Adversarial Learning"],"prefix":"10.1145","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6082-5608","authenticated-orcid":false,"given":"Armielle","family":"Noulapeu Ngaffo","sequence":"first","affiliation":[{"name":"University of Namur","place":["Namur, Belgium"]},{"name":"Department of Computer Engineering and Telecommunications, National Higher Polytechnic School of Douala","place":["Namur, Belgium"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6279-5601","authenticated-orcid":false,"given":"Julien","family":"Albert","sequence":"additional","affiliation":[{"name":"University of Namur","place":["Namur, Belgium"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7859-2750","authenticated-orcid":false,"given":"Beno\u00eet","family":"Frenay","sequence":"additional","affiliation":[{"name":"University of Namur","place":["Namur, Belgium"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8431-0377","authenticated-orcid":false,"given":"Gilles","family":"Perrouin","sequence":"additional","affiliation":[{"name":"University of Namur","place":["Namur, Belgium"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,11,22]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_2_2","DOI":"10.1145\/3292500.3330745"},{"key":"e_1_3_2_3_2","first-page":"405","volume-title":"The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval","year":"2018","unstructured":"Asia, Krishna, and Gerhard. 2018. Equity of attention: Amortizing individual fairness in rankings. In The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval. 405\u2013414."},{"doi-asserted-by":"publisher","key":"e_1_3_2_4_2","DOI":"10.1145\/3289600.3291002"},{"doi-asserted-by":"publisher","key":"e_1_3_2_5_2","DOI":"10.1145\/3564284"},{"doi-asserted-by":"publisher","key":"e_1_3_2_6_2","DOI":"10.1109\/BigData.2018.8622525"},{"doi-asserted-by":"publisher","key":"e_1_3_2_7_2","DOI":"10.1145\/3366423.3380196"},{"doi-asserted-by":"crossref","unstructured":"Haolun Wu Chen Ma Bhaskar Mitra Fernando Diaz and Xue Liu. 2022. A multi-objective optimization framework for multi-stakeholder fairness-aware recommendation. ACM Transactions on Information Systems 41 2 (2022) 1\u201329.","key":"e_1_3_2_8_2","DOI":"10.1145\/3564285"},{"volume-title":"SIGIR","year":"2020","unstructured":"Himank, Zhengxiao, and Thorsten. 2020. Fair learning-to-rank from implicit feedback. In SIGIR.","key":"e_1_3_2_9_2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_10_2","DOI":"10.1145\/3477495.3531718"},{"doi-asserted-by":"crossref","unstructured":"Rashidul Islam Kamrun Naher Keya Ziqian Zeng Shimei Pan and James Foulds. 2021. Debiasing career recommendations with neural fair collaborative filtering. In Proceedings of the Web Conference 2021. 3779\u20133790.","key":"e_1_3_2_11_2","DOI":"10.1145\/3442381.3449904"},{"key":"e_1_3_2_12_2","first-page":"86","article-title":"Deepfair: Deep learning for improving fairness in recommender systems","year":"2021","unstructured":"Jes\u00fas, Ra\u00fal, \u00c1ngel, and Fernando. 2021. Deepfair: Deep learning for improving fairness in recommender systems. International Journal of Interactive Multimedia and Artificial Intelligence (2021), 86\u201394. Retrieved from https:\/\/www.ijimai.org\/journal\/sites\/default\/files\/2021-05\/ijimai_6_6_9_0.pdf","journal-title":"International Journal of Interactive Multimedia and Artificial Intelligence"},{"key":"e_1_3_2_13_2","first-page":"515","volume-title":"Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval","year":"2017","unstructured":"Jun, Lantao, Weinan, Yu, Yinghui, Benyou, Peng, and Dell. 2017. Irgan: A minimax game for unifying generative and discriminative information retrieval models. In Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval. 515\u2013524."},{"key":"e_1_3_2_14_2","first-page":"344","article-title":"Rating-based collaborative filtering: Algorithms and evaluation","year":"2018","unstructured":"Kluver, Ekstrand, and Konstan. 2018. Rating-based collaborative filtering: Algorithms and evaluation. Social Information Access: Systems and Technologies (2018), 344\u2013390.","journal-title":"Social Information Access: Systems and Technologies"},{"doi-asserted-by":"publisher","key":"e_1_3_2_15_2","DOI":"10.1145\/3109859.3109887"},{"doi-asserted-by":"crossref","unstructured":"Siyi Lin Chongming Gao Jiawei Chen Sheng Zhou Binbin Hu Yan Feng Chun Chen and Can Wang. 2025. How do recommendation models amplify popularity bias? An analysis from the spectral perspective. In Proceedings of the Eighteenth ACM International Conference on Web Search and Data Mining. 659\u2013668.","key":"e_1_3_2_16_2","DOI":"10.1145\/3701551.3703579"},{"doi-asserted-by":"publisher","key":"e_1_3_2_17_2","DOI":"10.1145\/3672275"},{"unstructured":"Qi Liu Hao Jiang Fei Wang Yan Zhuang Le Wu Weibo Gao Enhong Chen and others. 2023. Fairlisa: Fair user modeling with limited sensitive attributes information. Advances in Neural Information Processing Systems 36 (2023) 41432\u201341450.","key":"e_1_3_2_18_2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_19_2","DOI":"10.1016\/j.ipm.2021.102722"},{"doi-asserted-by":"publisher","key":"e_1_3_2_20_2","DOI":"10.1145\/3397271.3401100"},{"doi-asserted-by":"publisher","key":"e_1_3_2_21_2","DOI":"10.1145\/3132847.3132938"},{"issue":"6","key":"e_1_3_2_22_2","first-page":"1","article-title":"Fairness in ranking, part i: Score-based ranking","volume":"55","year":"2022","unstructured":"Meike, Ke, and Julia. 2022. Fairness in ranking, part i: Score-based ranking. Comput. Surveys 55, 6 (2022), 1\u201336.","journal-title":"Comput. Surveys"},{"doi-asserted-by":"publisher","key":"e_1_3_2_23_2","DOI":"10.1145\/3533380"},{"issue":"12","key":"e_1_3_2_24_2","first-page":"4049","article-title":"Multirelational social recommendations via multigraph ranking","volume":"47","year":"2016","unstructured":"Mingsong, Jie, Guangquan, and Jinlong. 2016. Multirelational social recommendations via multigraph ranking. IEEE transactions on cybernetics 47, 12 (2016), 4049\u20134061.","journal-title":"IEEE transactions on cybernetics"},{"doi-asserted-by":"crossref","unstructured":"Mohamed Trabelsi Zhiyu Chen Brian D. Davison and Jeff Heflin. 2021. Neural ranking models for document retrieval. Information Retrieval Journal 24 6 (2021) 400\u2013444.","key":"e_1_3_2_25_2","DOI":"10.1007\/s10791-021-09398-0"},{"doi-asserted-by":"publisher","key":"e_1_3_2_26_2","DOI":"10.1145\/3477495.3531959"},{"key":"e_1_3_2_27_2","volume-title":"Proceedings of ESANN 2023 - European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning","author":"Ngaffo Noulapeu","year":"2023","unstructured":"Noulapeu Ngaffo, Albert, Fr\u00e9nay, and Perrouin. 2023. FairBayRank: A fair personalized bayesian ranker. In Proceedings of ESANN 2023 - European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning."},{"doi-asserted-by":"publisher","key":"e_1_3_2_28_2","DOI":"10.1007\/s11432-020-3404-y"},{"doi-asserted-by":"publisher","key":"e_1_3_2_29_2","DOI":"10.1145\/3474085.3475706"},{"doi-asserted-by":"crossref","unstructured":"Yehezkel S. Resheff Yanai Elazar Shimon Shahar and Oren Sar Shalom. 2018. Privacy and fairness in recommender systems via adversarial training of user representations. In International Conference on Pattern Recognition Applications and Methods. Retrieved from https:\/\/api.semanticscholar.org\/CorpusID:174800819","key":"e_1_3_2_30_2","DOI":"10.5220\/0007361204760482"},{"unstructured":"Sirui Yao and Bert Huang. 2017. Beyond Parity: Fairness objectives for collaborative filtering. In Neural Information Processing Systems. Retrieved from https:\/\/api.semanticscholar.org\/CorpusID:5668819","key":"e_1_3_2_31_2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_32_2","DOI":"10.1145\/3240323.3240372"},{"key":"e_1_3_2_33_2","first-page":"452","volume-title":"Uncertainty in Artificial Intelligence","year":"2014","unstructured":"Steffen, Christoph, Zeno, and Lars. 2014. Bayesian personalized ranking from implicit feedback. In Uncertainty in Artificial Intelligence. 452\u2013461."},{"doi-asserted-by":"publisher","key":"e_1_3_2_34_2","DOI":"10.1561\/1500000016"},{"key":"e_1_3_2_35_2","first-page":"669","volume-title":"5th International Conference on Computer Information Science and Application Technology (CISAT 2022)","volume":"12451","year":"2022","unstructured":"Wang and Hao. 2022. Pareto pairwise ranking for fairness enhancement of recommender systems. In 5th International Conference on Computer Information Science and Application Technology (CISAT 2022), Vol. 12451. SPIE, 669\u2013673."},{"doi-asserted-by":"publisher","key":"e_1_3_2_36_2","DOI":"10.1007\/978-3-030-47426-3_13"},{"doi-asserted-by":"publisher","key":"e_1_3_2_37_2","DOI":"10.1145\/3442381.3450015"},{"doi-asserted-by":"publisher","key":"e_1_3_2_38_2","DOI":"10.1145\/3531146.3533079"},{"doi-asserted-by":"publisher","key":"e_1_3_2_39_2","DOI":"10.1145\/3404835.3462882"},{"doi-asserted-by":"crossref","unstructured":"Yifan Wang Weizhi Ma Min Zhang Yiqun Liu and Shaoping Ma. 2023. A survey on the fairness of recommender systems. ACM Transactions on Information Systems 41 3 (2023) 1\u201343.","key":"e_1_3_2_40_2","DOI":"10.1145\/3547333"},{"doi-asserted-by":"crossref","unstructured":"Ying Liu and Jiajun Yang. 2015. Improving ranking-based recommendation by social information and negative similarity. Procedia Computer Science 55 (2015) 732\u2013740.","key":"e_1_3_2_41_2","DOI":"10.1016\/j.procs.2015.07.164"},{"doi-asserted-by":"publisher","key":"e_1_3_2_42_2","DOI":"10.1145\/3488560.3498487"},{"unstructured":"Yunqi Li Dingxian Wang H. Chen and Yongfeng Zhang. 2023. Transferable fairness for cold-start recommendation. ArXiv abs\/2301.10665 (2023). Retrieved from https:\/\/api.semanticscholar.org\/CorpusID:256231238","key":"e_1_3_2_43_2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_44_2","DOI":"10.1145\/3442381.3449866"},{"volume-title":"AAAI-23 Workshop on AI for Web Advertising.","year":"2023","unstructured":"Yunqi, Michiharu, Hanxiong, Dongwon, and Yongfeng. 2023. Fairness in job recommendation under quantity constraints. In AAAI-23 Workshop on AI for Web Advertising.","key":"e_1_3_2_45_2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_46_2","DOI":"10.1609\/aaai.v37i4.25617"},{"doi-asserted-by":"publisher","key":"e_1_3_2_47_2","DOI":"10.1145\/3397271.3401177"},{"unstructured":"Ziwei Zhu Jianling Wang and James Caverlee. 2021. Fairness-aware personalized ranking recommendation via adversarial learning. ArXiv abs\/2103.07849 (2021). Retrieved from https:\/\/api.semanticscholar.org\/CorpusID:232232994","key":"e_1_3_2_48_2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_49_2","DOI":"10.1145\/3404835.3462948"},{"key":"e_1_3_2_50_2","first-page":"1153","volume-title":"Proc. CIKM","year":"2018","unstructured":"Ziwei, Xia, and James. 2018. Fairness-aware tensor-based recommendation. In Proc. CIKM. 1153\u20131162."}],"container-title":["ACM Transactions on Recommender Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3749106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T16:51:07Z","timestamp":1763830267000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3749106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,22]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6,30]]}},"alternative-id":["10.1145\/3749106"],"URL":"https:\/\/doi.org\/10.1145\/3749106","relation":{},"ISSN":["2770-6699"],"issn-type":[{"type":"electronic","value":"2770-6699"}],"subject":[],"published":{"date-parts":[[2025,11,22]]},"assertion":[{"value":"2024-03-26","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-07-07","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-11-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}