Towards Fairness Exploration and Optimization for Digital Service Networks

IF 5.8 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Zhongxuan Han;Li Zhang;Chaochao Chen;Xiaolin Zheng;Yuyuan Li;Shuiguang Deng;Guanjie Cheng;Schahram Dustdar
{"title":"Towards Fairness Exploration and Optimization for Digital Service Networks","authors":"Zhongxuan Han;Li Zhang;Chaochao Chen;Xiaolin Zheng;Yuyuan Li;Shuiguang Deng;Guanjie Cheng;Schahram Dustdar","doi":"10.1109/TSC.2025.3595214","DOIUrl":null,"url":null,"abstract":"Digital service networks often face the challenge of <bold>S</b>ervice-<bold>O</b>riented <bold>F</b>airness (SOF), where service nodes with varying levels of activity may receive unequal treatment. This article takes the recommendation service system as a representative case to explore and mitigate the impact of SOF. The SOF issue in the recommendation service system can be abstracted as <bold>U</b>ser-<bold>O</b>riented <bold>F</b>airness (UOF), where service models often exhibit bias toward a small group of users, resulting in significant unfairness in the quality of recommendations. Existing research on UOF faces three major limitations, and no single approach effectively addresses all of them. <bold>Limitation 1:</b> Post-processing methods fail to address the root cause of the UOF issue. <bold>Limitation 2:</b> Some in-processing methods rely heavily on unstable user similarity calculations under severe data sparsity problems. <bold>Limitation 3:</b> Other in-processing methods overlook the disparate treatment of individual users within user groups. In this article, we propose a novel <bold>I</b>ndividual <bold>R</b>eweighting for <bold>U</b>ser-<bold>O</b>riented <bold>F</b>airness framework, namely IR-UOF, to address all the aforementioned limitations. The motivation behind IR-UOF is to <italic>introduce an in-processing strategy that addresses the UOF issue at the individual level without the need to explore user similarities.</i> We first conduct extensive experiments on three real-world recommendation service datasets using four backbone recommendation models to demonstrate the effectiveness of IR-UOF in mitigating UOF and improving recommendation fairness. Furthermore, we select two general digital service datasets to prove that IR-UOF can be extended to tackle the general SOF issue in other types of digital service networks. In summary, the IR-UOF framework achieves optimal model performance across all datasets, while improving fairness by at least 3.8% in recommendation systems and 24.7% in general service systems.","PeriodicalId":13255,"journal":{"name":"IEEE Transactions on Services Computing","volume":"18 5","pages":"3307-3320"},"PeriodicalIF":5.8000,"publicationDate":"2025-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Services Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11120441/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Digital service networks often face the challenge of Service-Oriented Fairness (SOF), where service nodes with varying levels of activity may receive unequal treatment. This article takes the recommendation service system as a representative case to explore and mitigate the impact of SOF. The SOF issue in the recommendation service system can be abstracted as User-Oriented Fairness (UOF), where service models often exhibit bias toward a small group of users, resulting in significant unfairness in the quality of recommendations. Existing research on UOF faces three major limitations, and no single approach effectively addresses all of them. Limitation 1: Post-processing methods fail to address the root cause of the UOF issue. Limitation 2: Some in-processing methods rely heavily on unstable user similarity calculations under severe data sparsity problems. Limitation 3: Other in-processing methods overlook the disparate treatment of individual users within user groups. In this article, we propose a novel Individual Reweighting for User-Oriented Fairness framework, namely IR-UOF, to address all the aforementioned limitations. The motivation behind IR-UOF is to introduce an in-processing strategy that addresses the UOF issue at the individual level without the need to explore user similarities. We first conduct extensive experiments on three real-world recommendation service datasets using four backbone recommendation models to demonstrate the effectiveness of IR-UOF in mitigating UOF and improving recommendation fairness. Furthermore, we select two general digital service datasets to prove that IR-UOF can be extended to tackle the general SOF issue in other types of digital service networks. In summary, the IR-UOF framework achieves optimal model performance across all datasets, while improving fairness by at least 3.8% in recommendation systems and 24.7% in general service systems.
面向数字业务网络公平性的探索与优化
数字服务网络经常面临面向服务的公平(SOF)的挑战,其中具有不同活动水平的服务节点可能会受到不平等的对待。本文以推荐服务系统为代表案例,探讨并缓解sofs的影响。推荐服务系统中的SOF问题可以抽象为面向用户的公平性(User-Oriented Fairness, UOF),即服务模型往往会对一小部分用户表现出偏见,从而导致推荐质量的显著不公平。现有的UOF研究面临三大局限,没有一种方法能有效解决所有问题。限制1:后处理方法不能解决UOF问题的根本原因。限制2:在严重的数据稀疏性问题下,一些处理中的方法严重依赖于不稳定的用户相似度计算。限制3:其他处理内方法忽略了用户组中单个用户的不同处理。在本文中,我们提出了一种新的面向用户的公平框架,即IR-UOF,以解决上述所有限制。IR-UOF背后的动机是引入一种处理内策略,在个人层面解决UOF问题,而不需要探索用户相似性。我们首先在三个真实世界的推荐服务数据集上使用四种骨干推荐模型进行了广泛的实验,以证明IR-UOF在缓解UOF和提高推荐公平性方面的有效性。此外,我们选择了两个通用数字业务数据集来证明IR-UOF可以扩展到解决其他类型数字业务网络中的通用软问题。总之,IR-UOF框架在所有数据集上实现了最优的模型性能,同时在推荐系统中提高了至少3.8%的公平性,在一般服务系统中提高了24.7%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Services Computing
IEEE Transactions on Services Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
11.50
自引率
6.20%
发文量
278
审稿时长
>12 weeks
期刊介绍: IEEE Transactions on Services Computing encompasses the computing and software aspects of the science and technology of services innovation research and development. It places emphasis on algorithmic, mathematical, statistical, and computational methods central to services computing. Topics covered include Service Oriented Architecture, Web Services, Business Process Integration, Solution Performance Management, and Services Operations and Management. The transactions address mathematical foundations, security, privacy, agreement, contract, discovery, negotiation, collaboration, and quality of service for web services. It also covers areas like composite web service creation, business and scientific applications, standards, utility models, business process modeling, integration, collaboration, and more in the realm of Services Computing.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信