用于Web API推荐的超图卷积网络

Gang Xiao, Jiahuan Fei, Dongliu Li, Cece Wang, Zhenbo Cheng, Jiawei Lu
{"title":"用于Web API推荐的超图卷积网络","authors":"Gang Xiao, Jiahuan Fei, Dongliu Li, Cece Wang, Zhenbo Cheng, Jiawei Lu","doi":"10.1109/IRI58017.2023.00037","DOIUrl":null,"url":null,"abstract":"With the development of service-oriented computing, Mashup technology has emerged that uses web API as reusable components to create new products. How to achieve efficient and accurate service recommendation has attracted the attention of researchers in the field of service computing. The call relationship between mashups and APIs in real service data is intricate, and the information carried by the service further increases the complexity of the relationship between them. Most existing mashup recommendation models hardly mine such complex relationships effectively. To this end, this paper proposes the MRHN method. This method uses motifs to extract the hypergraph structure from services. While studying the complex relationship between service data, it also solves the problem of data sparsity, and uses the hypergraph convolutional network to extract the features of Mashup. Further, the weights of channels are adjusted using channel error attention mechanism. Finally, the performance of the proposed method is comprehensively evaluated. The experimental results show that compared with the existing service recommendation methods, the proposed method has significantly improved in terms of evaluation indicators such as NDCG and HR.","PeriodicalId":290818,"journal":{"name":"2023 IEEE 24th International Conference on Information Reuse and Integration for Data Science (IRI)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"MRHN: Hypergraph Convolutional Network for Web API Recommendation\",\"authors\":\"Gang Xiao, Jiahuan Fei, Dongliu Li, Cece Wang, Zhenbo Cheng, Jiawei Lu\",\"doi\":\"10.1109/IRI58017.2023.00037\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the development of service-oriented computing, Mashup technology has emerged that uses web API as reusable components to create new products. How to achieve efficient and accurate service recommendation has attracted the attention of researchers in the field of service computing. The call relationship between mashups and APIs in real service data is intricate, and the information carried by the service further increases the complexity of the relationship between them. Most existing mashup recommendation models hardly mine such complex relationships effectively. To this end, this paper proposes the MRHN method. This method uses motifs to extract the hypergraph structure from services. While studying the complex relationship between service data, it also solves the problem of data sparsity, and uses the hypergraph convolutional network to extract the features of Mashup. Further, the weights of channels are adjusted using channel error attention mechanism. Finally, the performance of the proposed method is comprehensively evaluated. The experimental results show that compared with the existing service recommendation methods, the proposed method has significantly improved in terms of evaluation indicators such as NDCG and HR.\",\"PeriodicalId\":290818,\"journal\":{\"name\":\"2023 IEEE 24th International Conference on Information Reuse and Integration for Data Science (IRI)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 IEEE 24th International Conference on Information Reuse and Integration for Data Science (IRI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IRI58017.2023.00037\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE 24th International Conference on Information Reuse and Integration for Data Science (IRI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IRI58017.2023.00037","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随着面向服务计算的发展,Mashup技术出现了,它使用web API作为可重用组件来创建新产品。如何实现高效、准确的服务推荐一直是服务计算领域研究人员关注的问题。实际服务数据中mashup与api之间的调用关系错综复杂,服务所携带的信息进一步增加了它们之间关系的复杂性。大多数现有的mashup推荐模型很难有效地挖掘这种复杂的关系。为此,本文提出了MRHN方法。该方法利用motif从服务中提取超图结构。在研究服务数据之间复杂关系的同时,也解决了数据稀疏性问题,利用超图卷积网络提取Mashup的特征。此外,利用信道错误注意机制对信道权值进行调整。最后,对所提方法的性能进行了综合评价。实验结果表明,与现有的服务推荐方法相比,所提方法在NDCG、HR等评价指标上均有显著提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
MRHN: Hypergraph Convolutional Network for Web API Recommendation
With the development of service-oriented computing, Mashup technology has emerged that uses web API as reusable components to create new products. How to achieve efficient and accurate service recommendation has attracted the attention of researchers in the field of service computing. The call relationship between mashups and APIs in real service data is intricate, and the information carried by the service further increases the complexity of the relationship between them. Most existing mashup recommendation models hardly mine such complex relationships effectively. To this end, this paper proposes the MRHN method. This method uses motifs to extract the hypergraph structure from services. While studying the complex relationship between service data, it also solves the problem of data sparsity, and uses the hypergraph convolutional network to extract the features of Mashup. Further, the weights of channels are adjusted using channel error attention mechanism. Finally, the performance of the proposed method is comprehensively evaluated. The experimental results show that compared with the existing service recommendation methods, the proposed method has significantly improved in terms of evaluation indicators such as NDCG and HR.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信