ARRQP: Anomaly Resilient Real-time QoS Prediction Framework with Graph
Convolution
- URL: http://arxiv.org/abs/2310.02269v1
- Date: Fri, 22 Sep 2023 04:37:51 GMT
- Title: ARRQP: Anomaly Resilient Real-time QoS Prediction Framework with Graph
Convolution
- Authors: Suraj Kumar, Soumi Chattopadhyay
- Abstract summary: 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.
- Score: 0.16317061277456998
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In the realm of modern service-oriented architecture, ensuring Quality of
Service (QoS) is of paramount importance. The ability to predict QoS values in
advance empowers users to make informed decisions. However, achieving accurate
QoS predictions in the presence of various issues and anomalies, including
outliers, data sparsity, grey-sheep instances, and cold-start scenarios,
remains a challenge. Current state-of-the-art methods often fall short when
addressing these issues simultaneously, resulting in performance degradation.
In this paper, we introduce a real-time QoS prediction framework (called ARRQP)
with a specific emphasis on improving resilience to anomalies in the data.
ARRQP utilizes the power of graph convolution techniques to capture intricate
relationships and dependencies among users and services, even when the data is
limited or sparse. ARRQP integrates both contextual information and
collaborative insights, enabling a comprehensive understanding of user-service
interactions. By utilizing robust loss functions, ARRQP effectively reduces the
impact of outliers during the model training. Additionally, we introduce a
sparsity-resilient grey-sheep detection method, which is subsequently treated
separately for QoS prediction. Furthermore, we address the cold-start problem
by emphasizing contextual features over collaborative features. Experimental
results on the benchmark WS-DREAM dataset demonstrate the framework's
effectiveness in achieving accurate and timely QoS predictions.
Related papers
- Learning Graph Structures and Uncertainty for Accurate and Calibrated Time-series Forecasting [65.40983982856056]
We introduce STOIC, that leverages correlations between time-series to learn underlying structure between time-series and to provide well-calibrated and accurate forecasts.
Over a wide-range of benchmark datasets STOIC provides 16% more accurate and better-calibrated forecasts.
arXiv Detail & Related papers (2024-07-02T20:14:32Z) - Large Language Model Meets Graph Neural Network in Knowledge Distillation [7.686812700685084]
We propose a temporal-aware framework for predicting Quality of Service (QoS) in service-oriented architectures.
Our proposed TOGCL framework significantly outperforms state-of-the-art methods across multiple metrics, achieving improvements of up to 38.80%.
arXiv Detail & Related papers (2024-02-08T18:33:21Z) - DISTINQT: A Distributed Privacy Aware Learning Framework for QoS Prediction for Future Mobile and Wireless Networks [2.114401279266792]
Beyond 5G and 6G networks are expected to support new and challenging use cases and applications that depend on a certain level of Quality of Service (QoS) to operate smoothly.
Predictions in a timely manner is of high importance, especially for safety-critical applications as in the case of vehicular communications.
DisTINQT is a novel multi-headed input-aware distributed learning framework for prediction.
arXiv Detail & Related papers (2024-01-15T13:00:48Z) - 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) - Normalizing Flow-based Neural Process for Few-Shot Knowledge Graph
Completion [69.55700751102376]
Few-shot knowledge graph completion (FKGC) aims to predict missing facts for unseen relations with few-shot associated facts.
Existing FKGC methods are based on metric learning or meta-learning, which often suffer from the out-of-distribution and overfitting problems.
In this paper, we propose a normalizing flow-based neural process for few-shot knowledge graph completion (NP-FKGC)
arXiv Detail & Related papers (2023-04-17T11:42:28Z) - Compressed Regression over Adaptive Networks [58.79251288443156]
We derive the performance achievable by a network of distributed agents that solve, adaptively and in the presence of communication constraints, a regression problem.
We devise an optimized allocation strategy where the parameters necessary for the optimization can be learned online by the agents.
arXiv Detail & Related papers (2023-04-07T13:41:08Z) - 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) - Task-Specific Normalization for Continual Learning of Blind Image
Quality Models [105.03239956378465]
We present a simple yet effective continual learning method for blind image quality assessment (BIQA)
The key step in our approach is to freeze all convolution filters of a pre-trained deep neural network (DNN) for an explicit promise of stability.
We assign each new IQA dataset (i.e., task) a prediction head, and load the corresponding normalization parameters to produce a quality score.
The final quality estimate is computed by black a weighted summation of predictions from all heads with a lightweight $K$-means gating mechanism.
arXiv Detail & Related papers (2021-07-28T15:21:01Z) - Interpretable Social Anchors for Human Trajectory Forecasting in Crowds [84.20437268671733]
We propose a neural network-based system to predict human trajectory in crowds.
We learn interpretable rule-based intents, and then utilise the expressibility of neural networks to model scene-specific residual.
Our architecture is tested on the interaction-centric benchmark TrajNet++.
arXiv Detail & Related papers (2021-05-07T09:22:34Z) - 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.