基于相关图的应用程序接口推荐中的流行偏差,用于混搭创建

IF 7.2 4区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE ACM Transactions on Intelligent Systems and Technology Pub Date : 2024-04-02 DOI:10.1145/3654445
Chao Yan, Weiyi Zhong, Dengshuai Zhai, Arif Ali Khan, Wenwen Gong, Yanwei Xu, Baogui Xin
{"title":"基于相关图的应用程序接口推荐中的流行偏差,用于混搭创建","authors":"Chao Yan, Weiyi Zhong, Dengshuai Zhai, Arif Ali Khan, Wenwen Gong, Yanwei Xu, Baogui Xin","doi":"10.1145/3654445","DOIUrl":null,"url":null,"abstract":"<p>The explosive growth of the API economy in recent years has led to a dramatic increase in available APIs. Mashup development, a dominant approach for creating data-centric applications based on APIs, has experienced a surge in popularity. However, the vast array of choices poses a challenge for mashup developers when selecting appropriate API compositions to meet specific business requirements. Correlation graph-based recommendation approaches have been designed to assist developers in discovering related and compatible API compositions for mashup creation. Unfortunately, these approaches often suffer from popularity bias issues, leading to an inequality in API usage and potential disruptions to the entire API ecosystem. To address these challenges, our research begins with a theoretical analysis of the popularity bias introduced by correlation graph-based API recommendation approaches. Subsequently, we empirically validate the presence of popularity bias in API recommendations through a data-driven study. Finally, we introduce the <underline>p</underline>opularity <underline>b</underline>ias aware <underline>w</underline>eb <underline>A</underline>PI <underline>r</underline>ecommendation (<i>PB-WAR</i>) approach to mitigate popularity bias in correlation graph-based API recommendations. Experimental results over a real world dataset demonstrate that <i>PB-WAR</i> offers the optimal trade-off between accuracy and debiasing performance compared to other competitive methods.</p>","PeriodicalId":48967,"journal":{"name":"ACM Transactions on Intelligent Systems and Technology","volume":null,"pages":null},"PeriodicalIF":7.2000,"publicationDate":"2024-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Popularity Bias in Correlation Graph based API Recommendation for Mashup Creation\",\"authors\":\"Chao Yan, Weiyi Zhong, Dengshuai Zhai, Arif Ali Khan, Wenwen Gong, Yanwei Xu, Baogui Xin\",\"doi\":\"10.1145/3654445\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The explosive growth of the API economy in recent years has led to a dramatic increase in available APIs. Mashup development, a dominant approach for creating data-centric applications based on APIs, has experienced a surge in popularity. However, the vast array of choices poses a challenge for mashup developers when selecting appropriate API compositions to meet specific business requirements. Correlation graph-based recommendation approaches have been designed to assist developers in discovering related and compatible API compositions for mashup creation. Unfortunately, these approaches often suffer from popularity bias issues, leading to an inequality in API usage and potential disruptions to the entire API ecosystem. To address these challenges, our research begins with a theoretical analysis of the popularity bias introduced by correlation graph-based API recommendation approaches. Subsequently, we empirically validate the presence of popularity bias in API recommendations through a data-driven study. Finally, we introduce the <underline>p</underline>opularity <underline>b</underline>ias aware <underline>w</underline>eb <underline>A</underline>PI <underline>r</underline>ecommendation (<i>PB-WAR</i>) approach to mitigate popularity bias in correlation graph-based API recommendations. Experimental results over a real world dataset demonstrate that <i>PB-WAR</i> offers the optimal trade-off between accuracy and debiasing performance compared to other competitive methods.</p>\",\"PeriodicalId\":48967,\"journal\":{\"name\":\"ACM Transactions on Intelligent Systems and Technology\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":7.2000,\"publicationDate\":\"2024-04-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Transactions on Intelligent Systems and Technology\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1145/3654445\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Intelligent Systems and Technology","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1145/3654445","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

近年来,应用程序接口(API)经济的爆炸式增长导致可用的应用程序接口急剧增加。混搭开发是基于应用程序接口创建以数据为中心的应用程序的一种主流方法,因此大受欢迎。然而,在选择适当的 API 组合以满足特定业务需求时,大量的选择给混搭开发人员带来了挑战。基于关联图的推荐方法旨在帮助开发人员发现相关且兼容的 API 组合,以便创建混搭。遗憾的是,这些方法往往存在流行偏差问题,导致 API 使用的不平等,并对整个 API 生态系统造成潜在破坏。为了应对这些挑战,我们的研究首先从理论上分析了基于相关图的 API 推荐方法所带来的流行偏差。随后,我们通过数据驱动的研究从经验上验证了 API 推荐中存在的流行度偏差。最后,我们介绍了流行度偏差感知网络 API 推荐(PB-WAR)方法,以减轻基于相关图的 API 推荐中的流行度偏差。在真实世界数据集上的实验结果表明,与其他竞争方法相比,PB-WAR 在准确性和去偏差性能之间实现了最佳权衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Popularity Bias in Correlation Graph based API Recommendation for Mashup Creation

The explosive growth of the API economy in recent years has led to a dramatic increase in available APIs. Mashup development, a dominant approach for creating data-centric applications based on APIs, has experienced a surge in popularity. However, the vast array of choices poses a challenge for mashup developers when selecting appropriate API compositions to meet specific business requirements. Correlation graph-based recommendation approaches have been designed to assist developers in discovering related and compatible API compositions for mashup creation. Unfortunately, these approaches often suffer from popularity bias issues, leading to an inequality in API usage and potential disruptions to the entire API ecosystem. To address these challenges, our research begins with a theoretical analysis of the popularity bias introduced by correlation graph-based API recommendation approaches. Subsequently, we empirically validate the presence of popularity bias in API recommendations through a data-driven study. Finally, we introduce the popularity bias aware web API recommendation (PB-WAR) approach to mitigate popularity bias in correlation graph-based API recommendations. Experimental results over a real world dataset demonstrate that PB-WAR offers the optimal trade-off between accuracy and debiasing performance compared to other competitive methods.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
ACM Transactions on Intelligent Systems and Technology
ACM Transactions on Intelligent Systems and Technology COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-COMPUTER SCIENCE, INFORMATION SYSTEMS
CiteScore
9.30
自引率
2.00%
发文量
131
期刊介绍: ACM Transactions on Intelligent Systems and Technology is a scholarly journal that publishes the highest quality papers on intelligent systems, applicable algorithms and technology with a multi-disciplinary perspective. An intelligent system is one that uses artificial intelligence (AI) techniques to offer important services (e.g., as a component of a larger system) to allow integrated systems to perceive, reason, learn, and act intelligently in the real world. ACM TIST is published quarterly (six issues a year). Each issue has 8-11 regular papers, with around 20 published journal pages or 10,000 words per paper. Additional references, proofs, graphs or detailed experiment results can be submitted as a separate appendix, while excessively lengthy papers will be rejected automatically. Authors can include online-only appendices for additional content of their published papers and are encouraged to share their code and/or data with other readers.
期刊最新文献
A Survey of Trustworthy Federated Learning: Issues, Solutions, and Challenges DeepSneak: User GPS Trajectory Reconstruction from Federated Route Recommendation Models WC-SBERT: Zero-Shot Topic Classification Using SBERT and Light Self-Training on Wikipedia Categories Self-supervised Text Style Transfer using Cycle-Consistent Adversarial Networks Federated Learning Survey: A Multi-Level Taxonomy of Aggregation Techniques, Experimental Insights, and Future Frontiers
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1