RAHN: A Reputation Based Hourglass Network for Web Service QoS Prediction (S)

As the homogenization of Web services becomes more and more common, the difficulty of service recommendation is gradually increasing.How to predict Quality of Service (QoS) more efficiently and accurately becomes an important challenge for service recommendation.Considering the excellent role of reputation and deep learning (DL) techniques in the field of QoS prediction, we propose a reputation and DL based QoS prediction network, RAHN, which contains the Reputation Calculation Module (RCM), the Latent Feature Extraction Module (LFEM), and the QoS Prediction Hourglass Network (QPHN).RCM obtains the user reputation and the service reputation by using a clustering algorithm and a Logit model.LFEM extracts latent features from known information to form an initial latent feature vector.QPHN aggregates latent feature vectors with different scales by using Attention Mechanism, and can be stacked multiple times to obtain the final latent feature vector for prediction.We evaluate RAHN on a real QoS dataset.The experimental results show that the Mean Absolute Error (MAE) and Root Mean Square Error (RMSE) of RAHN are smaller than the six baseline methods.

Authors

Institutions

Publication Details

Journal
Proceedings/Proceedings of the ... International Conference on Software Engineering and Knowledge Engineering
Published
2024-10-28
DOI
https://doi.org/10.18293/seke2024-024
Citations
2
Primary Topic
Recommender Systems and Techniques
Type
article
Field-Weighted Citation Impact
1.56
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

RAHN: A Reputation Based Hourglass Network for Web Service QoS Prediction (S)

Yugen Du, Yingwei Luo, Xia Chen, Benchi Ma et al.
2 citations
Proceedings/Proceedings of the ... International Conference on Software Engineering and Knowledge Engineering
Recommender Systems and Techniques
1.56
article

RAHN: A Reputation Based Hourglass Network for Web Service QoS Prediction (S)

Yugen Du, Yingwei Luo, Xia Chen, Benchi Ma, Guoxing Tang
article en
2 citations

Abstract

As the homogenization of Web services becomes more and more common, the difficulty of service recommendation is gradually increasing.How to predict Quality of Service (QoS) more efficiently and accurately becomes an important challenge for service recommendation.Considering the excellent role of reputation and deep learning (DL) techniques in the field of QoS prediction, we propose a reputation and DL based QoS prediction network, RAHN, which contains the Reputation Calculation Module (RCM), the Latent Feature Extraction Module (LFEM), and the QoS Prediction Hourglass Network (QPHN).RCM obtains the user reputation and the service reputation by using a clustering algorithm and a Logit model.LFEM extracts latent features from known information to form an initial latent feature vector.QPHN aggregates latent feature vectors with different scales by using Attention Mechanism, and can be stacked multiple times to obtain the final latent feature vector for prediction.We evaluate RAHN on a real QoS dataset.The experimental results show that the Mean Absolute Error (MAE) and Root Mean Square Error (RMSE) of RAHN are smaller than the six baseline methods.

Proceedings/Proceedings of the ... International Conference on Software Engineering and Knowledge EngineeringVol. 2024
Shanghai Key Laboratory of Trustworthy Computing (CN), East China Normal University (CN)
Industry, innovation and infrastructure
Openalex Percentile: Top 11%
Recommender Systems and Techniques
1.56
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.