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

• URL: http://arxiv.org/abs/2501.02843v1
• Date: Mon, 06 Jan 2025 08:43:05 GMT
• Title: RAHN: A Reputation Based Hourglass Network for Web Service QoS Prediction
• Authors: Xia Chen, Yugen Du, Guoxing Tang, Yingwei Luo, Benchi Ma,
• Abstract summary: How to predict Quality of Service (QoS) more efficiently and accurately becomes an important challenge for service recommendation. We propose a reputation and deep learning (DL) based prediction network, RAHN, which contains the Reputation Calculation Module (RCM), the Latent Feature Extraction Module (LFEM), and the 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. QPHN aggregates latent feature vectors with different scales by using Attention Mechanism, and
• Score: 2.0475265337665336
• License:
• 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.

Related papers

• Query Performance Prediction using Relevance Judgments Generated by Large Language Models [53.97064615557883]
  We propose a QPP framework using automatically generated relevance judgments (QPP-GenRE) QPP-GenRE decomposes QPP into independent subtasks of predicting relevance of each item in a ranked list to a given query. This allows us to predict any IR evaluation measure using the generated relevance judgments as pseudo-labels.
  arXiv  Detail & Related papers  (2024-04-01T09:33:05Z)
• Sample Complexity of Preference-Based Nonparametric Off-Policy Evaluation with Deep Networks [58.469818546042696]
  We study the sample efficiency of OPE with human preference and establish a statistical guarantee for it. By appropriately selecting the size of a ReLU network, we show that one can leverage any low-dimensional manifold structure in the Markov decision process.
  arXiv  Detail & Related papers  (2023-10-16T16:27:06Z)
• Understanding, Predicting and Better Resolving Q-Value Divergence in Offline-RL [86.0987896274354]
  We first identify a fundamental pattern, self-excitation, as the primary cause of Q-value estimation divergence in offline RL. We then propose a novel Self-Excite Eigenvalue Measure (SEEM) metric to measure the evolving property of Q-network at training. For the first time, our theory can reliably decide whether the training will diverge at an early stage.
  arXiv  Detail & Related papers  (2023-10-06T17:57:44Z)
• ARRQP: Anomaly Resilient Real-time QoS Prediction Framework with Graph Convolution [0.16317061277456998]
  We introduce a real-time prediction framework (called ARRQP) with a specific emphasis on improving resilience to anomalies in the data. ARRQP integrates both contextual information and collaborative insights, enabling a comprehensive understanding of user-service interactions. Results on the benchmark WS-DREAM dataset demonstrate the framework's effectiveness in achieving accurate and timely predictions.
  arXiv  Detail & Related papers  (2023-09-22T04:37:51Z)
• Forward-Forward Algorithm for Hyperspectral Image Classification: A Preliminary Study [0.0]
  Forward-forward algorithm (FFA) computes local goodness functions to optimize network parameters. This study investigates the application of FFA for hyperspectral image classification.
  arXiv  Detail & Related papers  (2023-07-01T05:39:28Z)
• TPMCF: Temporal QoS Prediction using Multi-Source Collaborative Features [0.5161531917413706]
  Temporal Prediction is essential to identify a suitable service over time. Recent methods hardly achieved desired accuracy due to various limitations. This paper proposes a scalable strategy for Temporal Prediction using Multi-source Collaborative-Features.
  arXiv  Detail & Related papers  (2023-03-30T06:49:53Z)
• STIP: A SpatioTemporal Information-Preserving and Perception-Augmented Model for High-Resolution Video Prediction [78.129039340528]
  We propose a Stemporal Information-Preserving and Perception-Augmented Model (STIP) to solve the above two problems. The proposed model aims to preserve thetemporal information for videos during the feature extraction and the state transitions. Experimental results show that the proposed STIP can predict videos with more satisfactory visual quality compared with a variety of state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-06-09T09:49:04Z)
• Domain-Adjusted Regression or: ERM May Already Learn Features Sufficient for Out-of-Distribution Generalization [52.7137956951533]
  We argue that devising simpler methods for learning predictors on existing features is a promising direction for future research. We introduce Domain-Adjusted Regression (DARE), a convex objective for learning a linear predictor that is provably robust under a new model of distribution shift. Under a natural model, we prove that the DARE solution is the minimax-optimal predictor for a constrained set of test distributions.
  arXiv  Detail & Related papers  (2022-02-14T16:42:16Z)
• Robust lEarned Shrinkage-Thresholding (REST): Robust unrolling for sparse recover [87.28082715343896]
  We consider deep neural networks for solving inverse problems that are robust to forward model mis-specifications. We design a new robust deep neural network architecture by applying algorithm unfolding techniques to a robust version of the underlying recovery problem. The proposed REST network is shown to outperform state-of-the-art model-based and data-driven algorithms in both compressive sensing and radar imaging problems.
  arXiv  Detail & Related papers  (2021-10-20T06:15:45Z)
• FES: A Fast Efficient Scalable QoS Prediction Framework [0.9176056742068814]
  One of the primary objectives of designing a prediction algorithm is to achieve satisfactory prediction accuracy. The algorithm has to be faster in terms of prediction time so that it can be integrated into a real-time recommendation system. The existing algorithms on prediction often compromise on one goal while ensuring the others.
  arXiv  Detail & Related papers  (2021-03-12T19:28:17Z)
• A Probability Distribution and Location-aware ResNet Approach for QoS Prediction [8.491818037756488]
  We propose an advanced probability distribution and location-aware ResNet approach for Prediction(PLRes) The results indicate that PLRes model is effective for prediction and at the density of 5%-30%, it significantly outperforms a state-of-the-art approach LDCF by 12.35%-15.37% in terms of MAE.
  arXiv  Detail & Related papers  (2020-11-16T08:22:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.