Light Heterogeneous Hypergraph Contrastive Learning Based Service Recommendation for Mashup Creation

Mashup technology enables developers to create new applications more readily by combining existing services. As its popularity grows, research on service recommendation for mashup creation has gained increasing attention. Existing recommendation methods have the following limitations: either they are susceptible to data sparsity problems, or they exhibit over-smoothing when aggregating high-order neighbors, resulting in similar and non-specific node feature representations, or they only focus on bipartite graphs and neglect the rich heterogeneous information in the mashup-service ecosystem. To address these issues, we propose a service recommendation method for mashup creation based on <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">l</u>ight <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">h</u>eterogeneous hyper<underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">g</u>raph <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">c</u>ontrastive <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">l</u>earning (LHGCL). This method first constructs a heterogeneous hypergraph by combining mashup information, service information, the mashup-service interaction data, and their related attribute information. Then, it designs a light hypergraph neural network to capture the high-order relationships between mashups and services. Next, it applies contrastive learning to enhance the representations of mashups and services. Finally, it utilizes the enhanced feature vectors of mashups and services to predict mashup preferences for services. Comprehensive experiments conducted on the real-world ProgrammableWeb dataset demonstrate the superiority of the proposed method and the effectiveness of its key modules.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Services Computing
Published
2024-10-31
DOI
https://doi.org/10.1109/tsc.2024.3489417
Citations
3
Primary Topic
Recommender Systems and Techniques
Type
article
Field-Weighted Citation Impact
2.34

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Light Heterogeneous Hypergraph Contrastive Learning Based Service Recommendation for Mashup Creation

Zibin Zheng, Mingdong Tang, Fenfang Xie, J. Mai
3 citations
IEEE Transactions on Services Computing
Recommender Systems and Techniques
2.34
article

Light Heterogeneous Hypergraph Contrastive Learning Based Service Recommendation for Mashup Creation

Zibin Zheng, Mingdong Tang, Fenfang Xie, J. Mai
article en
3 citations

Abstract

Mashup technology enables developers to create new applications more readily by combining existing services. As its popularity grows, research on service recommendation for mashup creation has gained increasing attention. Existing recommendation methods have the following limitations: either they are susceptible to data sparsity problems, or they exhibit over-smoothing when aggregating high-order neighbors, resulting in similar and non-specific node feature representations, or they only focus on bipartite graphs and neglect the rich heterogeneous information in the mashup-service ecosystem. To address these issues, we propose a service recommendation method for mashup creation based on <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">l</u>ight <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">h</u>eterogeneous hyper<underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">g</u>raph <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">c</u>ontrastive <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">l</u>earning (LHGCL). This method first constructs a heterogeneous hypergraph by combining mashup information, service information, the mashup-service interaction data, and their related attribute information. Then, it designs a light hypergraph neural network to capture the high-order relationships between mashups and services. Next, it applies contrastive learning to enhance the representations of mashups and services. Finally, it utilizes the enhanced feature vectors of mashups and services to predict mashup preferences for services. Comprehensive experiments conducted on the real-world ProgrammableWeb dataset demonstrate the superiority of the proposed method and the effectiveness of its key modules.

IEEE Transactions on Services ComputingVol. 17(6)
Sun Yat-sen University (CN), Guangdong University of Foreign Studies (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 9%
Recommender Systems and Techniques
2.34
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.