TY - GEN
T1 - GSL-Mash
T2 - 22nd International Conference on Service-Oriented Computing, ICSOC 2024
AU - Liu, Sihao
AU - Liu, Mingyi
AU - Jiang, Tianyu
AU - Yu, Shuang
AU - Xu, Hanchuan
AU - Wang, Zhongjie
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.
PY - 2025
Y1 - 2025
N2 - The proliferation of Web APIs has facilitated the creation of numerous software applications through the integration of diverse services, commonly referred to as mashups. However, the growing complexity and number of available Web APIs pose significant challenges in API services selection. Current service recommendation models, predominantly based on Graph Neural Networks (GNNs), often underperform due to the simplistic and overly complex APIs co-occurrence graphs they utilize, which impede both efficiency and performance. This paper introduces a novel model, GSL-Mash, which incorporates graph structure learning (GSL) to optimize graph data in service recommendations. By refining the graph structure to retain only pertinent connections, our model significantly reduces unnecessary complexity and noise, enhancing both the efficacy and accuracy of service recommendations. We validate GSL-Mash using real-world datasets from ProgrammableWeb, where it outperforms established baselines with up to 45.39% improvement on NDCG@10 metric. Additionally, we contribute to the academic and development communities by making our implementation publicly available. This study not only advances the technology of service recommendation systems but also sets a foundational approach for future research in optimizing graph-based service recommendation models.
AB - The proliferation of Web APIs has facilitated the creation of numerous software applications through the integration of diverse services, commonly referred to as mashups. However, the growing complexity and number of available Web APIs pose significant challenges in API services selection. Current service recommendation models, predominantly based on Graph Neural Networks (GNNs), often underperform due to the simplistic and overly complex APIs co-occurrence graphs they utilize, which impede both efficiency and performance. This paper introduces a novel model, GSL-Mash, which incorporates graph structure learning (GSL) to optimize graph data in service recommendations. By refining the graph structure to retain only pertinent connections, our model significantly reduces unnecessary complexity and noise, enhancing both the efficacy and accuracy of service recommendations. We validate GSL-Mash using real-world datasets from ProgrammableWeb, where it outperforms established baselines with up to 45.39% improvement on NDCG@10 metric. Additionally, we contribute to the academic and development communities by making our implementation publicly available. This study not only advances the technology of service recommendation systems but also sets a foundational approach for future research in optimizing graph-based service recommendation models.
KW - Graph Neural Network
KW - Graph Structure Learning
KW - Mashup creation
KW - Service recommendation
UR - https://www.scopus.com/pages/publications/85213004620
U2 - 10.1007/978-981-96-0808-9_14
DO - 10.1007/978-981-96-0808-9_14
M3 - 会议稿件
AN - SCOPUS:85213004620
SN - 9789819608072
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 176
EP - 191
BT - Service-Oriented Computing - 22nd International Conference, ICSOC 2024, Proceedings
A2 - Gaaloul, Walid
A2 - Sheng, Michael
A2 - Yu, Qi
A2 - Yangui, Sami
PB - Springer Science and Business Media Deutschland GmbH
Y2 - 3 December 2024 through 6 December 2024
ER -