{"title":"面向数字业务网络公平性的探索与优化","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":"{\"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}","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}
Towards Fairness Exploration and Optimization for Digital Service Networks
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.
期刊介绍:
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.