Group Feature Aggregation for Web Service Recommendations

IF 5.4 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Network and Service Management Pub Date : 2024-08-19 DOI:10.1109/TNSM.2024.3444275
Yong Xiao;Jianxun Liu;Guosheng Kang;Buqing Cao
{"title":"Group Feature Aggregation for Web Service Recommendations","authors":"Yong Xiao;Jianxun Liu;Guosheng Kang;Buqing Cao","doi":"10.1109/TNSM.2024.3444275","DOIUrl":null,"url":null,"abstract":"Increasingly low barriers to Internet applications allow a large number of ordinary users to become developers or users of Web services. However, confronted with massive services and complex application scenarios, users often struggle to filter out satisfactory services, in fact, even professional users find it difficult to describe their requirements specifically and accurately in many cases. In order to aggregate more feature information and mitigate the negative impact of low-quality user requirement description, we propose a novel group feature aggregation service recommendation framework (GFASR). Concretely, we first calculate the semantic similarity between users, and create a group for each user according to the similarity ranking. Furthermore, on the basis of learning neural embeddings of users, candidate services, and groups, we employ a dual-attention mechanism to capture effective feature (such as requirement description, service history invoked information, etc.) and preference information of group members for each user, thereby supplementing or enhancing the user’s feature representation. Finally, we aggregate and propagate the information of all embeddings, and a neural and attentional factorization machine model is used to recommend services for users. Comparative experiments on a real dataset demonstrate that our method significantly outperforms the state-of-the-art service recommendation models.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 1","pages":"45-57"},"PeriodicalIF":5.4000,"publicationDate":"2024-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network and Service Management","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10638742/","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

Increasingly low barriers to Internet applications allow a large number of ordinary users to become developers or users of Web services. However, confronted with massive services and complex application scenarios, users often struggle to filter out satisfactory services, in fact, even professional users find it difficult to describe their requirements specifically and accurately in many cases. In order to aggregate more feature information and mitigate the negative impact of low-quality user requirement description, we propose a novel group feature aggregation service recommendation framework (GFASR). Concretely, we first calculate the semantic similarity between users, and create a group for each user according to the similarity ranking. Furthermore, on the basis of learning neural embeddings of users, candidate services, and groups, we employ a dual-attention mechanism to capture effective feature (such as requirement description, service history invoked information, etc.) and preference information of group members for each user, thereby supplementing or enhancing the user’s feature representation. Finally, we aggregate and propagate the information of all embeddings, and a neural and attentional factorization machine model is used to recommend services for users. Comparative experiments on a real dataset demonstrate that our method significantly outperforms the state-of-the-art service recommendation models.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
针对网络服务推荐的群体特征聚合
Internet应用程序的门槛越来越低,使得大量普通用户可以成为Web服务的开发人员或用户。然而,面对海量的服务和复杂的应用场景,用户往往难以过滤出满意的服务,甚至专业用户在很多情况下也难以具体准确地描述自己的需求。为了聚合更多的特征信息,减轻低质量用户需求描述的负面影响,我们提出了一种新的组特征聚合服务推荐框架(GFASR)。具体来说,我们首先计算用户之间的语义相似度,并根据相似度排序为每个用户创建一个组。此外,在学习用户、候选服务和组的神经嵌入的基础上,采用双关注机制捕获每个用户的有效特征(如需求描述、服务历史调用信息等)和组成员的偏好信息,从而补充或增强用户的特征表示。最后,我们对所有嵌入的信息进行聚合和传播,并使用神经和注意力分解机模型为用户推荐服务。在真实数据集上的对比实验表明,我们的方法明显优于最先进的服务推荐模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Network and Service Management
IEEE Transactions on Network and Service Management Computer Science-Computer Networks and Communications
CiteScore
9.30
自引率
15.10%
发文量
325
期刊介绍: IEEE Transactions on Network and Service Management will publish (online only) peerreviewed archival quality papers that advance the state-of-the-art and practical applications of network and service management. Theoretical research contributions (presenting new concepts and techniques) and applied contributions (reporting on experiences and experiments with actual systems) will be encouraged. These transactions will focus on the key technical issues related to: Management Models, Architectures and Frameworks; Service Provisioning, Reliability and Quality Assurance; Management Functions; Enabling Technologies; Information and Communication Models; Policies; Applications and Case Studies; Emerging Technologies and Standards.
期刊最新文献
Enhancing Anomaly Alert Prioritization Through Calibrated Standard Deviation Uncertainty Estimation With an Ensemble of Auto-Encoders REACH: Reinforcement Learning for Efficient Allocation in Community and Heterogeneous Networks Hybrid CNN-LSTM Model for DDoS Detection and Mitigation in Software-Defined Networks Shannon Entropy for Load-Balanced Cellular Network Planning: Data-Driven Voronoi Optimization of Base-Station Locations A Certificateless Dynamic Anonymous Authentication Scheme for Mobile Edge Computing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1