A Biased Nonnegative Block Term Tensor Decomposition Model for Dynamic QoS Prediction

• URL: http://arxiv.org/abs/2605.04813v1
• Date: Wed, 06 May 2026 12:03:34 GMT
• Title: A Biased Nonnegative Block Term Tensor Decomposition Model for Dynamic QoS Prediction
• Abstract summary: latent feature analysis provides an effective way to model multidimensional data.<n>Most existing prediction methods are mainly based on Canonical Polyadic (CP) decomposition or Tucker decomposition.<n>This paper proposes a dynamic prediction framework based on the Biased Nonnegative Block Term Decomposition Model.
• Score: 4.308228155982687
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: With the rapid development of cloud computing and Web services, Quality of Service (QoS) has become a key criterion for service selection and recommendation. Tensor latent feature analysis provides an effective way to model multidimensional QoS data, and most existing QoS prediction methods are mainly based on Canonical Polyadic (CP) decomposition or Tucker decomposition. However, constrained by their inherent structural properties, these methods cannot accurately capture the complex and dynamic dependencies in user-service interactions, which limits their prediction performance. To address this issue, this paper proposes a dynamic QoS prediction framework based on the Biased Nonnegative Block Term Tensor Decomposition Model, termed BNBT. Specifically, the proposed framework is developed from three aspects: (1) block term tensor decomposition is employed to enhance the representation capability of latent feature learning; (2) linear bias terms are incorporated to further improve prediction accuracy; and (3) a tensor-oriented single-element-dependent nonnegative multiplicative update algorithm, called SLF-NMUT, is designed for efficient parameter estimation. Extensive experiments on real-world QoS datasets demonstrate that the proposed BNBT framework consistently outperforms several state-of-the-art QoS prediction methods in terms of prediction accuracy.

Related papers

• A Novel Approach to Temporal QoS Estimation via Extended Kalman Filter-Incorporated Latent Feature Analysis [20.92363732107246]
  We propose a novel Extended Kalman Filter-Enhanced Latent Feature Analysis (EKL) model to perform efficient and accurate temporal prediction.<n>Our proposed EKL surpasses existing state-of-the-art models with respect to both computational efficiency and prediction accuracy for missing temporal data.<n> Experimental evaluations conducted on real-world temporal datasets reveal that our proposed EKL surpasses existing state-of-the-art models with respect to both computational efficiency and prediction accuracy for missing temporal data.
  arXiv  Detail & Related papers  (2026-06-22T08:22:18Z)
• Matching Features, Not Tokens: Energy-Based Fine-Tuning of Language Models [102.20309135516186]
  Cross-entropy (CE) training provides dense and scalable supervision for language models.<n>We introduce a feature-matching objective for language-model fine-tuning.<n>To optimize this objective efficiently, we propose energy-based fine-tuning.
  arXiv  Detail & Related papers  (2026-03-12T17:57:50Z)
• SHARP-QoS: Sparsely-gated Hierarchical Adaptive Routing for joint Prediction of QoS [2.2567016485314797]
  Service-oriented computing relies on multiple Quality of Service (QoS) parameters that are essential to assess service optimality.<n>Existing methods often predict each parameter separately, requiring multiple similar models, which increases computational cost and leads to poor generalization.<n>This paper presents an unified strategy for joint prediction, called SHARP-QoS, that addresses these issues using three components.
  arXiv  Detail & Related papers  (2025-12-19T06:25:05Z)
• The Coverage Principle: How Pre-Training Enables Post-Training [70.25788947586297]
  We study how pre-training shapes the success of the final model.<n>We uncover a mechanism that explains the power of coverage in predicting downstream performance.
  arXiv  Detail & Related papers  (2025-10-16T17:53:50Z)
• Nonparametric Filtering, Estimation and Classification using Neural Jump ODEs [3.437372707846067]
  Neural Jump ODEs model the conditional expectation between observations by neural ODEs and jump at arrival of new observations.<n>They have demonstrated effectiveness for fully data-driven online forecasting in settings with irregular and partial observations.<n>This work extends the framework to input-output systems, enabling direct applications in online filtering and classification.
  arXiv  Detail & Related papers  (2024-12-04T12:31:15Z)
• Anomaly Resilient Temporal QoS Prediction using Hypergraph Convoluted Transformer Network [0.47248250311484113]
  Quality-of-Service (QoS) prediction is a critical task in the service lifecycle. Traditional methods often encounter data sparsity and cold-start issues. We introduce a real-time, trust-aware framework for temporal prediction.
  arXiv  Detail & Related papers  (2024-10-23T11:01:39Z)
• 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)
• Rigorous Probabilistic Guarantees for Robust Counterfactual Explanations [80.86128012438834]
  We show for the first time that computing the robustness of counterfactuals with respect to plausible model shifts is NP-complete. We propose a novel probabilistic approach which is able to provide tight estimates of robustness with strong guarantees.
  arXiv  Detail & Related papers  (2024-07-10T09:13:11Z)
• Structured Radial Basis Function Network: Modelling Diversity for Multiple Hypotheses Prediction [51.82628081279621]
  Multi-modal regression is important in forecasting nonstationary processes or with a complex mixture of distributions. A Structured Radial Basis Function Network is presented as an ensemble of multiple hypotheses predictors for regression problems. It is proved that this structured model can efficiently interpolate this tessellation and approximate the multiple hypotheses target distribution.
  arXiv  Detail & Related papers  (2023-09-02T01:27:53Z)
• \b{eta}-Divergence-Based Latent Factorization of Tensors model for QoS prediction [2.744577504320494]
  A nonnegative latent factorization of tensors (NLFT) model can well model the temporal pattern hidden in nonnegative quality-of-service (QoS) data. Existing NLFT models' objective function is based on Euclidean distance, which is only a special case of beta-divergence. This paper proposes a beta-divergence-based NLFT model (beta-NLFT) to achieve prediction accuracy gain.
  arXiv  Detail & Related papers  (2022-08-14T05:14:50Z)
• Unlabelled Data Improves Bayesian Uncertainty Calibration under Covariate Shift [100.52588638477862]
  We develop an approximate Bayesian inference scheme based on posterior regularisation. We demonstrate the utility of our method in the context of transferring prognostic models of prostate cancer across globally diverse populations.
  arXiv  Detail & Related papers  (2020-06-26T13:50:19Z)
• Providing reliability in Recommender Systems through Bernoulli Matrix Factorization [63.732639864601914]
  This paper proposes Bernoulli Matrix Factorization (BeMF) to provide both prediction values and reliability values. BeMF acts on model-based collaborative filtering rather than on memory-based filtering. The more reliable a prediction is, the less liable it is to be wrong.
  arXiv  Detail & Related papers  (2020-06-05T14:24:27Z)

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.