Dynamic QoS Prediction via a Non-Negative Tensor Snowflake Factorization

• URL: http://arxiv.org/abs/2504.18588v1
• Date: Thu, 24 Apr 2025 03:03:22 GMT
• Title: Dynamic QoS Prediction via a Non-Negative Tensor Snowflake Factorization
• Authors: YongHui Xia, Lan Wang, Hao Wu,
• Abstract summary: We propose a Non-negative Snowflake Factorization of tensors model to predict unobserved data.<n>A single latent factor-based, nonnegative update on tensor (SLF-NMUT) yields improved predictions for missing data.
• Score: 14.603788849701768
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Dynamic quality of service (QoS) data exhibit rich temporal patterns in user-service interactions, which are crucial for a comprehensive understanding of user behavior and service conditions in Web service. As the number of users and services increases, there is a large amount of unobserved QoS data, which significantly affects users'choice of services. To predict unobserved QoS data, we propose a Non-negative Snowflake Factorization of tensors model. This method designs a snowflake core tensor to enhance the model's learning capability. Additionally, it employs a single latent factor-based, nonnegative multiplication update on tensor (SLF-NMUT) for parameter learning. Empirical results demonstrate that the proposed model more accurately learns dynamic user-service interaction patterns, thereby yielding improved predictions for missing QoS data.

Related papers

• Multi-Head Self-Attending Neural Tucker Factorization [5.734615417239977]
  We introduce a neural network-based tensor factorization approach tailored for learning representations of high-dimensional and incomplete (HDI) tensors.<n>The proposed MSNTucF model demonstrates superior performance compared to state-of-the-art benchmark models in estimating missing observations.
  arXiv  Detail & Related papers  (2025-01-16T13:04:15Z)
• Web Service QoS Prediction via Extended Canonical Polyadic-based Tensor Network [2.2083091880368855]
  A Canonical Polyadic (CP)-based tensor network model has proven to be efficient for predicting dynamic data. Current CP-based tensor network models do not consider the correlation of users and services in the low-dimensional latent feature space. This paper proposes an Extended polyadic-based Network (ECTN) model to improve prediction accuracy.
  arXiv  Detail & Related papers  (2024-08-29T05:56:35Z)
• Federated Learning based Latent Factorization of Tensors for Privacy-Preserving QoS Prediction [3.3295360710329738]
  This article creatively designs a federated learning based on latent factorization of tensors (FL-LFT) It builds a data-oriented federated learning model to enable isolated users to collaboratively train a global LFT model while protecting user's privacy. Experiments on a dataset collected from the real world verify that FL-LFT shows a remarkable increase in prediction accuracy when compared to state-of-the-art federated learning approaches.
  arXiv  Detail & Related papers  (2024-07-29T09:30:00Z)
• 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)
• An ADMM-Incorporated Latent Factorization of Tensors Method for QoS Prediction [2.744577504320494]
  Quality of service (QoS) describes the performance of a web service dynamically with respect to the service requested by the service consumer. Latent factorization of tenors (LFT) is very effective for discovering temporal patterns in high dimensional and sparse (HiDS) tensors. Current LFT models suffer from a low convergence rate and rarely account for the effects of outliers.
  arXiv  Detail & Related papers  (2022-12-03T12:35:48Z)
• ClusterQ: Semantic Feature Distribution Alignment for Data-Free Quantization [111.12063632743013]
  We propose a new and effective data-free quantization method termed ClusterQ. To obtain high inter-class separability of semantic features, we cluster and align the feature distribution statistics. We also incorporate the intra-class variance to solve class-wise mode collapse.
  arXiv  Detail & Related papers  (2022-04-30T06:58:56Z)
• Preference Enhanced Social Influence Modeling for Network-Aware Cascade Prediction [59.221668173521884]
  We propose a novel framework to promote cascade size prediction by enhancing the user preference modeling. Our end-to-end method makes the user activating process of information diffusion more adaptive and accurate.
  arXiv  Detail & Related papers  (2022-04-18T09:25:06Z)
• Comparing Test Sets with Item Response Theory [53.755064720563]
  We evaluate 29 datasets using predictions from 18 pretrained Transformer models on individual test examples. We find that Quoref, HellaSwag, and MC-TACO are best suited for distinguishing among state-of-the-art models. We also observe span selection task format, which is used for QA datasets like QAMR or SQuAD2.0, is effective in differentiating between strong and weak models.
  arXiv  Detail & Related papers  (2021-06-01T22:33:53Z)
• What do we expect from Multiple-choice QA Systems? [70.86513724662302]
  We consider a top performing model on several Multiple Choice Question Answering (MCQA) datasets. We evaluate it against a set of expectations one might have from such a model, using a series of zero-information perturbations of the model's inputs.
  arXiv  Detail & Related papers  (2020-11-20T21:27:10Z)
• Explaining and Improving Model Behavior with k Nearest Neighbor Representations [107.24850861390196]
  We propose using k nearest neighbor representations to identify training examples responsible for a model's predictions. We show that kNN representations are effective at uncovering learned spurious associations. Our results indicate that the kNN approach makes the finetuned model more robust to adversarial inputs.
  arXiv  Detail & Related papers  (2020-10-18T16:55:25Z)
• An Uncertainty-based Human-in-the-loop System for Industrial Tool Wear Analysis [68.8204255655161]
  We show that uncertainty measures based on Monte-Carlo dropout in the context of a human-in-the-loop system increase the system's transparency and performance. A simulation study demonstrates that the uncertainty-based human-in-the-loop system increases performance for different levels of human involvement.
  arXiv  Detail & Related papers  (2020-07-14T15:47:37Z)

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.