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

Xia Chen, Yugen Du, Guoxing Tang, Yingwei Luo, Benchi Ma
1/6/2025
cs.SEcs.LG

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{chen2025rahn,
  title  = {RAHN: A Reputation Based Hourglass Network for Web Service QoS Prediction},
  author = {Xia Chen and Yugen Du and Guoxing Tang and Yingwei Luo and Benchi Ma},
  year   = {2025},
  eprint = {2501.02843},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2501.02843v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2501.02843.svg)](https://codeofpaper.com/paper/2501.02843)

Discussion