{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T16:07:41Z","timestamp":1784218061656,"version":"3.55.0"},"reference-count":37,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003968","name":"Iran National Science Foundation","doi-asserted-by":"publisher","award":["4034377"],"award-info":[{"award-number":["4034377"]}],"id":[{"id":"10.13039\/501100003968","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.asoc.2026.115619","type":"journal-article","created":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T15:40:28Z","timestamp":1780155628000},"page":"115619","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"PB","title":["Disentangling popularity and quality: An edge classification approach for fair recommendation"],"prefix":"10.1016","volume":"201","author":[{"given":"Nemat","family":"Gholinejad","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3436-0541","authenticated-orcid":false,"given":"Mostafa","family":"Haghir Chehreghani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.asoc.2026.115619_bib0005","series-title":"European Conference on Information Retrieval","first-page":"33","article-title":"Auditing consumer-and producer-fairness in graph collaborative filtering","author":"Anelli","year":"2023"},{"key":"10.1016\/j.asoc.2026.115619_bib0010","author":"Berg"},{"key":"10.1016\/j.asoc.2026.115619_bib0015","series-title":"Proceedings of the 28th ACM International Conference on Information and Knowledge Management, CIKM 2019, Beijing, China, November 3\u20137, 2019","first-page":"1231","article-title":"Adaptive algorithms for estimating betweenness and k-path centralities","author":"Chehreghani","year":"2019"},{"issue":"5","key":"10.1016\/j.asoc.2026.115619_bib0020","doi-asserted-by":"crossref","DOI":"10.1007\/s11704-023-2655-2","article-title":"How graph convolutions amplify popularity bias for recommendation?","volume":"18","author":"Chen","year":"2024","journal-title":"Front. Comput. Sci."},{"key":"10.1016\/j.asoc.2026.115619_bib0025","series-title":"AAAI Conference on Artificial Intelligence","first-page":"27","article-title":"Revisiting graph based collaborative filtering: a linear residual graph convolutional network approach","volume":"vol. 34","author":"Chen","year":"2020"},{"key":"10.1016\/j.asoc.2026.115619_bib0030","series-title":"Proceedings of the ACM Web Conference 2023","first-page":"1012","article-title":"Improving recommendation fairness via data augmentation","author":"Chen","year":"2023"},{"key":"10.1016\/j.asoc.2026.115619_bib0035","series-title":"Proceedings of the 15th ACM Conference on Recommender Systems","first-page":"321","article-title":"Debiased explainable pairwise ranking from implicit feedback","author":"Damak","year":"2021"},{"key":"10.1016\/j.asoc.2026.115619_bib0040","series-title":"Conference on Fairness, Accountability and Transparency","first-page":"172","article-title":"All the cool kids, how do they fit in?: Popularity and demographic biases in recommender evaluation and effectiveness","author":"Ekstrand","year":"2018"},{"key":"10.1016\/j.asoc.2026.115619_bib0045","series-title":"International Joint Conference on Artificial Intelligence, 17","first-page":"973","article-title":"The foundations of cost-sensitive learning","author":"Elkan","year":"2001"},{"key":"10.1016\/j.asoc.2026.115619_bib0050","series-title":"Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval","first-page":"112","article-title":"Graph trend filtering networks for recommendation","author":"Fan","year":"2022"},{"key":"10.1016\/j.asoc.2026.115619_bib0055","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2025.131956","article-title":"Heterophily-aware fair recommendation using graph convolutional networks","volume":"661","author":"Gholinejad","year":"2026","journal-title":"Neurocomputing"},{"key":"10.1016\/j.asoc.2026.115619_bib0060","series-title":"Proceedings of the 25th International Conference on World Wide Web","first-page":"507","article-title":"Ups and downs: modeling the visual evolution of fashion trends with one-class collaborative filtering","author":"He","year":"2016"},{"key":"10.1016\/j.asoc.2026.115619_bib0065","series-title":"Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval","first-page":"639","article-title":"Lightgcn: simplifying and powering graph convolution network for recommendation","author":"He","year":"2020"},{"key":"10.1016\/j.asoc.2026.115619_bib0070","author":"Kipf"},{"key":"10.1016\/j.asoc.2026.115619_bib0075","article-title":"Disentangled progressive negative sampling for graph collaborative filtering recommendation","author":"Li","year":"2025","journal-title":"Knowl.-based Syst."},{"issue":"4","key":"10.1016\/j.asoc.2026.115619_bib0080","first-page":":40:1","article-title":"Content augmented graph neural networks","volume":"19","author":"Nasrabadi","year":"2025","journal-title":"ACM Trans. Web"},{"key":"10.1016\/j.asoc.2026.115619_bib0085","series-title":"Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","first-page":"2388","article-title":"How powerful is graph filtering for recommendation","author":"Peng","year":"2024"},{"issue":"3","key":"10.1016\/j.asoc.2026.115619_bib0090","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3632751","article-title":"Less is more: removing redundancy of graph convolutional networks for recommendation","volume":"42","author":"Peng","year":"2024","journal-title":"ACM Trans. Inf. Syst."},{"key":"10.1016\/j.asoc.2026.115619_bib0095","series-title":"Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining","first-page":"231","article-title":"Fighting fire with fire: using antidote data to improve polarization and fairness of recommender systems","author":"Rastegarpanah","year":"2019"},{"key":"10.1016\/j.asoc.2026.115619_bib0100","author":"Rendle"},{"key":"10.1016\/j.asoc.2026.115619_bib0105","series-title":"Recommendersystemshandbook","author":"RicciF","year":"2011"},{"key":"10.1016\/j.asoc.2026.115619_bib0110","series-title":"NeurIPS 2019 Workshop on Causal Machine Learning","article-title":"Unbiased pairwise learning from implicit feedback","author":"Saito","year":"2019"},{"key":"10.1016\/j.asoc.2026.115619_bib0115","series-title":"The 2010 International Joint Conference on Neural Networks (IJCNN)","first-page":"1","article-title":"Cost-sensitive learning methods for imbalanced data","author":"Thai-Nghe","year":"2010"},{"key":"10.1016\/j.asoc.2026.115619_bib0120","series-title":"Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval","first-page":"165","article-title":"Neural graph collaborative filtering","author":"Wang","year":"2019"},{"key":"10.1016\/j.asoc.2026.115619_bib0125","series-title":"Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval","first-page":"1001","article-title":"Disentangled graph collaborative filtering","author":"Wang","year":"2020"},{"key":"10.1016\/j.asoc.2026.115619_bib0130","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2023.110806","article-title":"FGCR: fused graph context-aware recommender system","volume":"277","author":"Wei","year":"2023","journal-title":"Knowl.-based Syst."},{"key":"10.1016\/j.asoc.2026.115619_bib0135","series-title":"International Conference on Machine Learning","first-page":"6861","article-title":"Simplifying graph convolutional networks","author":"Wu","year":"2019"},{"key":"10.1016\/j.asoc.2026.115619_bib0140","series-title":"44th International ACM SIGIR Conference on Research and Development in Information Retrieval","first-page":"726","article-title":"Self-supervised graph learning for recommendation","author":"Wu","year":"2021"},{"key":"10.1016\/j.asoc.2026.115619_bib0145","series-title":"Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining","first-page":"661","article-title":"DGRec: graph neural network for recommendation with diversified embedding generation","author":"Yang","year":"2023"},{"key":"10.1016\/j.asoc.2026.115619_bib0150","series-title":"Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","first-page":"974","article-title":"Graph convolutional neural networks for web-scale recommender systems","author":"Ying","year":"2018"},{"key":"10.1016\/j.asoc.2026.115619_bib0155","series-title":"Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval","first-page":"1294","article-title":"Are graph augmentations necessary? Simple graph contrastive learning for recommendation","author":"Yu","year":"2022"},{"key":"10.1016\/j.asoc.2026.115619_bib0160","series-title":"45th International ACM SIGIR Conference on Research and Development in Information Retrieval","first-page":"50","article-title":"Investigating accuracy-novelty performance for graph-based collaborative filtering","author":"Zhao","year":"2022"},{"issue":"10","key":"10.1016\/j.asoc.2026.115619_bib0165","doi-asserted-by":"crossref","first-page":"9920","DOI":"10.1109\/TKDE.2022.3218994","article-title":"Popularity bias is not always evil: disentangling benign and harmful bias for recommendation","volume":"35","author":"Zhao","year":"2022","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.asoc.2026.115619_bib0170","series-title":"Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval","first-page":"7","article-title":"Adaptive popularity debiasing aggregator for graph collaborative filtering","author":"Zhou","year":"2023"},{"key":"10.1016\/j.asoc.2026.115619_bib0175","series-title":"Proceedings of the 14th ACM International Conference on Web Search and Data Mining","first-page":"85","article-title":"Popularity-opportunity bias in collaborative filtering","author":"Zhu","year":"2021"},{"key":"10.1016\/j.asoc.2026.115619_bib0180","series-title":"Proceedings of the 14th International Conference on World Wide Web","first-page":"22","article-title":"Improving recommendation lists through topic diversification","author":"Ziegler","year":"2005"},{"issue":"16","key":"10.1016\/j.asoc.2026.115619_bib0185","doi-asserted-by":"crossref","first-page":"24638","DOI":"10.1007\/s11227-024-06336-x","article-title":"Centrality-based and similarity-based neighborhood extension in graph neural networks","volume":"80","author":"Zohrabi","year":"2024","journal-title":"J. Supercomput."}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626010677?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626010677?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T15:47:48Z","timestamp":1784216868000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494626010677"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":37,"alternative-id":["S1568494626010677"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115619","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Disentangling popularity and quality: An edge classification approach for fair recommendation","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115619","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115619"}}