Abstract
Recommendation fairness has become a significant topic recently. One obstacle to it is popularity bias. Previous works reduce the bias by eliminating popularity difference entirely. However, items with higher quality should be assigned with higher popularity. Completely excluding popularity will cripple recommender on recommendation accuracy and unfairly treat items with high quality. For this reason, we argue that the popularity of items should not be avoided at all costs but instead calibrated based on their quality, which is a depiction of items’ natural properties. To this end, we propose the Quality Recommendation (QR) framework. Specifically, we separate item embedding into quality embedding and non-popularity ID embedding. The former efficiently encodes quality related features and the latter eliminates stereotype of specific items’ popularity. To evaluate model vulnerability to popularity-quality discrepancy, we propose a novel evaluation method. Its core idea is simulate this discrepancy at the training stage. Experiments on datasets show the effective fairness and recommendation performance of our proposed methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abdollahpouri, H., Burke, R., Mobasher, B.: Controlling popularity bias in learning-to-rank recommendation. In: Proceedings of the Eleventh ACM Conference on Recommender Systems, pp. 42–46. RecSys ’17, New York, NY, USA (2017)
Beutel, A., et al.: Fairness in recommendation ranking through pairwise comparisons. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 2212–2220. KDD ’19, New York, NY, USA (2019)
Bonner, S., Vasile, F.: Causal embeddings for recommendation. In: Proceedings of the 12th ACM Conference on Recommender Systems, pp. 104–112. RecSys ’18, New York, NY, USA (2018)
Celma, O., Cano, P.: From hits to niches? or how popular artists can bias music recommendation and discovery. In: Proceedings of the 2nd KDD Workshop on Large-Scale Recommender Systems and the Netflix Prize Competition. NETFLIX ’08, New York, NY, USA (2008)
Chen, C., Zhang, M., Liu, Y., Ma, S.: Neural attentional rating regression with review-level explanations. In: Proceedings of the 2018 World Wide Web Conference, pp. 1583–1592. WWW ’18, Republic and Canton of Geneva, CHE (2018)
Jannach, D., Lerche, L., Kamehkhosh, I., Jugovac, M.: What recommenders recommend: an analysis of recommendation biases and possible countermeasures. User Model. User-Adap. Inter. 25(5), 427–491 (2015)
Liang, D., Charlin, L., Blei, D.M.: Causal inference for recommendation. In: Causation: Foundation to Application, Workshop at UAI. AUAI (2016)
Liu, D., Li, J., Du, B., Chang, J., Gao, R.: Daml: dual attention mutual learning between ratings and reviews for item recommendation. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 344–352. KDD ’19, New York, NY, USA (2019)
Mnih, A., Salakhutdinov, R.R.: Probabilistic matrix factorization. In: Advances in Neural Information Processing Systems 20 (2007)
Park, Y.J., Tuzhilin, A.: The long tail of recommender systems and how to leverage it. In: Proceedings of the 2008 ACM Conference on Recommender Systems, pp. 11–18. RecSys ’08, New York, NY, USA (2008)
Ren, W., Wang, L., Liu, K., Guo, R., Lim, E., Fu, Y.: Mitigating popularity bias in recommendation with unbalanced interactions: A gradient perspective. In: IEEE International Conference on Data Mining, ICDM 2022, Orlando, FL, USA, November 28 - Dec. 1, 2022., pp. 438–447. IEEE (2022)
Rendle, S., Freudenthaler, C., Gantner, Z., Schmidt-Thieme, L.: BPR: Bayesian personalized ranking from implicit feedback. CoRR abs/1205.2618 (2012)
Singh, A., Joachims, T.: Fairness of exposure in rankings. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 2219–2228. KDD ’18, New York, NY, USA (2018)
Steck, H.: Item popularity and recommendation accuracy. In: Proceedings of the Fifth ACM Conference on Recommender Systems, pp. 125–132. RecSys ’11, New York, NY, USA (2011)
Wei, T., Feng, F., Chen, J., Wu, Z., Yi, J., He, X.: Model-Agnostic Counterfactual Reasoning for Eliminating Popularity Bias in Recommender System, pp. 1791–1800. New York, NY, USA (2021)
Xv, G., Lin, C., Li, H., Su, J., Ye, W., Chen, Y.: Neutralizing popularity bias in recommendation models. In: Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 2623–2628. SIGIR ’22 (2022)
Zehlike, M., Bonchi, F., Castillo, C., Hajian, S., Megahed, M., Baeza-Yates, R.: Fa*ir: A fair top-k ranking algorithm. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, pp. 1569–1578. CIKM ’17, New York, NY, USA (2017)
Zhang, Y., et al.: Causal intervention for leveraging popularity bias in recommendation. In: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 11–20 (2021)
Zhao, Z., et al.: Popularity bias is not always evil: disentangling benign and harmful bias for recommendation. IEEE Trans. Knowl. Data Eng. 1–13 (2022)
Zheng, L., Noroozi, V., Yu, P.S.: Joint deep modeling of users and items using reviews for recommendation. In: Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, pp. 425–434. WSDM ’17, New York, NY, USA (2017)
Zheng, Y., Gao, C., Li, X., He, X., Li, Y., Jin, D.: Disentangling User Interest and Conformity for Recommendation with Causal Embedding, p. 2980–2991. New York, NY, USA (2021)
Zhu, Z., He, Y., Zhao, X., Zhang, Y., Wang, J., Caverlee, J.: Popularity-opportunity bias in collaborative filtering. In: Proceedings of the 14th ACM International Conference on Web Search and Data Mining, pp. 85–93. WSDM ’21, New York, NY, USA (2021)
Zhu, Z., Hu, X., Caverlee, J.: Fairness-aware tensor-based recommendation. In: Proceedings of the 27th ACM International Conference on Information and Knowledge Management, pp. 1153–1162. CIKM ’18, New York, NY, USA (2018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Guo, Z., Zhu, Y., Wang, Z., Jing, M. (2023). Calibrating Popularity Bias Based on Quality for Recommendation Fairness. In: Yang, X., et al. Advanced Data Mining and Applications. ADMA 2023. Lecture Notes in Computer Science(), vol 14180. Springer, Cham. https://doi.org/10.1007/978-3-031-46677-9_26
Download citation
DOI: https://doi.org/10.1007/978-3-031-46677-9_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-46676-2
Online ISBN: 978-3-031-46677-9
eBook Packages: Computer ScienceComputer Science (R0)