pith. sign in

arxiv: 2606.00584 · v1 · pith:5A7KOMSGnew · submitted 2026-05-30 · 📊 stat.ML · cs.LG

Spectra-Guided Neural Tucker Factorization

Fusheng Wang , Yikai Hou This is my paper

Pith reviewed 2026-06-28 18:23 UTC · model grok-4.3

classification 📊 stat.ML cs.LG
keywords tensor completionTucker factorizationneural networksspectral embeddingspatiotemporal modelinghigh-dimensional incomplete data
0
0 comments X

The pith

SG-NTF maps scalar timestamps to a continuous spectral space to capture periodicities in high-dimensional incomplete tensor completion.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proposes Spectra-Guided Neural Tucker Factorization for completing high-dimensional and incomplete tensors. It replaces discrete time handling with a continuous spectral embedding of timestamps to abstract temporal periodicities. A Spatio-Temporal Co-Gating mechanism is introduced to modulate latent interactions based on spatiotemporal contexts. Real-world evaluations confirm that this yields completion accuracy on par with existing approaches but with greater parameter efficiency.

Core claim

SG-NTF circumvents discrete representational limits by mapping scalar timestamps into a continuous spectral space to abstract temporal periodicities, while a Spatio-Temporal Co-Gating mechanism explicitly filters latent interactions via multiplicative modulation on spatiotemporal contexts, resulting in competitive tensor completion accuracy with parameter efficiency on real-world HDI tensors.

What carries the argument

Spectra-guided mapping of timestamps into continuous spectral space paired with Spatio-Temporal Co-Gating in neural Tucker factorization.

If this is right

  • The method applies to real-world HDI tensors such as traffic or recommendation data.
  • It achieves competitive accuracy while using fewer parameters.
  • Temporal periodicities are handled without discrete representation constraints.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The spectral mapping could extend to other time-dependent tensor problems.
  • Controlled tests on synthetic data with known periods would validate the periodicity abstraction.
  • Co-gating modulation may apply to other neural factorization variants.

Load-bearing premise

Mapping scalar timestamps into a continuous spectral space successfully abstracts temporal periodicities without introducing artifacts that degrade completion quality on the target tensors.

What would settle it

Replacing the spectral mapping with discrete time embeddings and checking if accuracy decreases or parameters increase on the evaluated real-world tensors.

Figures

Figures reproduced from arXiv: 2606.00584 by Fusheng Wang, Yikai Hou.

Figure 1
Figure 1. Figure 1: Spectra-Guided Neural Tucker Factorization (SG-NTF) model. [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Performance of SG-NTF with different spectral dimensionalities [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Distribution of gating activations g [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
read the original abstract

This paper proposes Spectra-Guided Neural Tucker Factorization (SG-NTF) for High-Dimensional and Incomplete (HDI) tensor completion. Circumventing discrete representational limits, SG-NTF maps scalar timestamps into a continuous spectral space to abstract temporal periodicities. Concurrently, a Spatio-Temporal Co-Gating (STCG) mechanism explicitly filters latent interactions via multiplicative modulation on spatiotemporal contexts. Evaluations on real-world HDI tensors verify that SG-NTF maintains competitive completion accuracy with parameter efficiency.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The paper proposes Spectra-Guided Neural Tucker Factorization (SG-NTF) for High-Dimensional and Incomplete (HDI) tensor completion. It circumvents discrete representational limits by mapping scalar timestamps into a continuous spectral space to abstract temporal periodicities and introduces a Spatio-Temporal Co-Gating (STCG) mechanism that filters latent interactions via multiplicative modulation on spatiotemporal contexts. The central claim is that evaluations on real-world HDI tensors verify competitive completion accuracy together with parameter efficiency.

Significance. If the empirical claims hold with appropriate controls, the approach could provide a parameter-efficient neural method for incorporating temporal periodicities into Tucker-style tensor completion, addressing a practical limitation in existing discrete or non-spectral factorizations for time-stamped HDI data.

major comments (1)
  1. [Abstract] Abstract: the claim of 'competitive completion accuracy with parameter efficiency' is asserted without any quantitative results, baselines, error bars, dataset descriptions, or ablation controls, rendering the central empirical claim impossible to evaluate from the supplied text.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the detailed review and constructive comment on the abstract. We agree that the abstract's empirical claim requires more concrete support to allow evaluation from the text alone.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the claim of 'competitive completion accuracy with parameter efficiency' is asserted without any quantitative results, baselines, error bars, dataset descriptions, or ablation controls, rendering the central empirical claim impossible to evaluate from the supplied text.

    Authors: We agree that the abstract should be revised to include key quantitative evidence. In the updated manuscript, the abstract will be rewritten to report specific performance metrics (e.g., MAE/RMSE on the real-world HDI tensors), direct comparisons to baselines, parameter counts demonstrating efficiency, and brief dataset characterizations drawn from the experimental section. This will make the central claim evaluable without requiring the reader to consult the full text. revision: yes

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The abstract and available description provide only a high-level summary of SG-NTF with no equations, fitting procedures, derivation chain, or self-citations visible. No load-bearing steps exist that could reduce to inputs by construction, self-definition, or imported uniqueness. The central claim rests on empirical verification of accuracy and efficiency, which cannot be assessed for circularity without explicit mathematical content. This is the normal honest finding when no derivation is present to inspect.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only input supplies no explicit free parameters, axioms, or invented entities; all fields left empty.

pith-pipeline@v0.9.1-grok · 5596 in / 934 out tokens · 15395 ms · 2026-06-28T18:23:28.187964+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

102 extracted references · 1 canonical work pages · 1 internal anchor

  1. [1]

    Chen and L

    X. Chen and L. Sun: ’Bayesian Temporal Factorization for Multidimensional Time Series Prediction’, IEEE Trans. Pattern Anal. Mach. Intell., 2022, 44, (9), pp. 4659–4673

    2022

  2. [2]

    M. Tang, Z. Zheng, G. Kang, J. Liu, Y . Yang and T. Zhang.: ’Collaborative Web Service Quality Prediction via Exploiting Matrix Factorization and Network Map’, IEEE Trans. Netw. Serv. Manag., 2016, 13, (1), pp. 126–137

    2016

  3. [3]

    X. Luo, M. Zhou, Z. Wang, Y . Xia and Q. Zhu.: ’An Effective Scheme for QoS Estimation via Alternating Direction Method-Based Matrix Factorization’, IEEE Trans. Serv. Comput., 2019, 12, (4), pp. 503–518

    2019

  4. [4]

    Low-rank high-order tensor completion with applications in visual data,

    W. Qin, H. Wang, F. Zhang, J. Wang, X. Luo, and T. Huang, “Low-rank high-order tensor completion with applications in visual data,”IEEE Transactions on Image Processing, vol. 31, pp. 2433–2448, 2022

    2022

  5. [5]

    T. G. Kolda and B. W. Bader.: ’Tensor Decompositions and Applications’.SIAM Review, 2009, 51, (3), pp. 455–500

    2009

  6. [6]

    Zhang, H

    W. Zhang, H. Sun, X. Liu, and X. Guo.: ’Temporal QoS-Aware Web Service Recommendation via Non-Negative Tensor Factorization’. Proc. 23rd Int. Conf. World Wide Web, 2014, pp. 585–596

    2014

  7. [7]

    F. Ye, Z. Lin, C. Chen, Z. Zheng, and H. Huang.: ’Outlier-Resilient Web Service QoS Prediction’.Proc. Web Conf., 2021, pp. 3099–3110

    2021

  8. [8]

    Y . Hou, P. Tang, and X. Luo.: ’Multi-Aspect Self-Attending Neural Tucker Factorization for Spatiotemporal Representation Learning’.IEEE/CAA Journal of Automatica Sinica, 2026, 13, (4), pp. 986–988

    2026

  9. [9]

    P. Tang, Y . Hou, and X. Luo.: ’MPSANT: A Novel Multi-Projection Self-Attending Neural Tucker Factorization Model for High-Dimensional and Incomplete Data Representation Learning’.Information Fusion, 2026, 135, pp. 104449

    2026

  10. [10]

    Hou and P

    Y . Hou and P. Tang.: ’Temporal-Aware Neural Tucker Factorization for Traffic Data Imputation’. Proc. IEEE Int. Conf. Systems, Man, and Cybernetics, 2025, pp. 2679–2684

    2025

  11. [11]

    Zhang, J

    X. Zhang, J. He, X. Pan, Y . Chi and Y . Zhou.: ’Structured Low-Rank Tensor Completion for IoT Spatiotemporal High-Resolution Sensing Data Reconstruction’, IEEE Int.Things J., 2024, 11, (5), pp. 8299–8310

    2024

  12. [12]

    J. Mi, H. Wu, W. Li and X. Luo.: ’Spatio-Temporal Traffic Data Recovery via Latent Factorization of Tensors Based on Tucker Decomposition’. 2023 IEEE Int. Conf. Syst., Man, Cybern., 2023, pp. 1512–1517

    2023

  13. [13]

    X. Xu, M. Lin, X. Luo and Z. Xu.: ’HRST-LR: A Hessian Regularization Spatio-Temporal Low Rank Algorithm for Traffic Data Imputation’, IEEE Trans. Intell. Transp. Syst., 2023, 24, (10), pp. 11001–11017

    2023

  14. [14]

    M. Lin, J. Liu, H. Chen, X. Xu, X. Luo and Z. Xu.: ’A 3D Convolution-Incorporated Dimension Preserved Decompo-sition Model for Traffic Data Prediction’, IEEE Trans. Intell. Transp. Syst., 2025, 26, (1), pp. 673–690

    2025

  15. [15]

    G. C. Iba ˜nez, L. J. de la Cruz Llopis, A. C. Diaconeasa, A. B. Guill ´en and M. Aguilar Igartua.: ’MobilitApp: A Deep Learning-Based Tool for Transport Mode Detection to Support Sustainable Urban Mobility’, IEEE Access, 2025, 13, pp. 68439–68461

    2025

  16. [16]

    B. -Z. Li, X. -L. Zhao, X. Chen, M. Ding and R. Wen Liu.: ’Convolutional Low-Rank Tensor Representation for Structural Missing Traffic Data Imputation’, IEEE Trans. Intell. Transp. Syst., 2024, 25, (11), pp. 18847–18860

    2024

  17. [17]

    Cheng, N

    S. Cheng, N. Osman, S. Qu and L. Ballan.: ’FastSTI: A Fast Conditional Pseudo Numerical Diffusion Model for Spatio-Temporal Traffic Data Imputation’, IEEE Trans. Intell. Transp. Syst., 2024, 25, (12), pp. 20547–20560

    2024

  18. [18]

    H. Chen, M. Lin, L. Zhao, Z. Xu and X. Luo .: ’Fourth-Order Dimension Preserved Tensor Completion with Temporal Constraint for Missing Traffic Data Imputation’, IEEE Trans. Intell. Transp. Syst., 2025, 26, (5), pp. 6734–6748

    2025

  19. [19]

    Lu, B., et al.: ’A Diffusion Model for Traffic Data Imputation’, IEEE/CAA J. Autom. Sinica, 2025, 12, (3), pp. 606–617

    2025

  20. [20]

    NT-DPTC: A non-negative temporal dimension preserved tensor completion model for missing traffic data imputation,Information Sciences, 2024, 653: 119797

    Hong Chen, Mingwei Lin, Jiaqi Liu, Hengshuo Yang, Chao Zhang, Zeshui Xu. NT-DPTC: A non-negative temporal dimension preserved tensor completion model for missing traffic data imputation,Information Sciences, 2024, 653: 119797

    2024

  21. [21]

    A 3D Convolution-incorporated dimension preserved decomposition Model for Traffic Data Prediction, IEEE Transactions on Intelligent Transportation Systems, 2025, 26(01): 673-690

    Mingwei Lin, Jiaqi Liu, Hong Chen, Xiuqin Xu, Xin Luo, Zeshui Xu. A 3D Convolution-incorporated dimension preserved decomposition Model for Traffic Data Prediction, IEEE Transactions on Intelligent Transportation Systems, 2025, 26(01): 673-690

    2025

  22. [22]

    Latent Factor Analysis Model with Temporal Regularized Constraint for Road Traffic Data Imputation,IEEE Transactions on Intelligent Transportation Systems, 2025, 26(01): 724-741

    Hengshuo Yang, Mingwei Lin, Hong Chen, Xin Luo, Zeshui Xu. Latent Factor Analysis Model with Temporal Regularized Constraint for Road Traffic Data Imputation,IEEE Transactions on Intelligent Transportation Systems, 2025, 26(01): 724-741

    2025

  23. [23]

    Robust low-rank latent feature analysis for spatiotemporal signal recovery,

    D. Wu, Z. Li, Z. Yu, Y . He, X. Luo, “Robust low-rank latent feature analysis for spatiotemporal signal recovery,”IEEE Trans. Neural Netw. Learn. Syst., 2023

    2023

  24. [24]

    D. Wu, Z. Li, Z. Yu, Y . He, X. Luo.: ’Robust Low-Rank Latent Feature Analysis for Spatiotemporal Signal Recovery’, IEEE Trans. Neural Netw. Learn. Syst., 2025, 36, (2), pp. 2829–2842

    2025

  25. [25]

    Yan Zhen, Junyi Fang, Xiaoming Zhao, Jiawang Ge, Yifei Xiao.: ’Temporal Convolution Network Based on Attention Mechanism for Well Production Prediction’, J. Pet. Sci. Eng, 2022, 218

    2022

  26. [26]

    X. Luo, M. Chen, H. Wu, Z. Liu, H.: ’Adjusting learning depth in nonnegative latent factorization of tensors for accurately modeling temporal patterns in dynamic QoS data’, IEEE Trans. Autom. Sci. and Eng., 2021, 18, (4), pp. 2142–2155

    2021

  27. [27]

    X. Luo, H. Wu and Z. Li.: ’Neulft: A Novel Approach to Nonlinear Canonical Polyadic Decomposition on High-Dimensional Incomplete Tensors’, IEEE Trans. Knowl. Data Eng., 2023, 35, (6), pp. 6148–6166

    2023

  28. [28]

    P. Tang, T. Ruan, H. Wu, and X. Luo.: ’Temporal pattern-aware QoS prediction by biased non-negative Tucker factorization of tensors’, Neurocomputing, 2024, 582, pp. 127447. 7

    2024

  29. [29]

    M. Chen, R. Wang, Y . Qiao and X. Luo .: ’A Generalized Nesterov’s Accelerated Gradient-Incorporated Non-Negative Latent-Factorization-of-Tensors Model for Efficient Representation to Dynamic QoS Data’, IEEE Trans. Emerging Top. Comput. Intell., 2024, 8, (3), pp. 2386–2400

    2024

  30. [30]

    Peng and H

    Z. Peng and H. Wu.: ’Non-Negative Latent Factorization of Tensors Model Based onβ-Divergence for Time-Aware QoS Prediction’. IEEE Int. Conf. Networking, Sens. Control, 2022, pp. 1–6

    2022

  31. [31]

    M. Chen, L. Tao, J. Lou, and X. Luo.: ’Latent-Factorizat-ion-of-Tensors-Incorporated Battery Cycle Life Prediction’, IEEE/CAA J. Autom. Sinica, 2025, 12, (3), pp. 633–635

    2025

  32. [32]

    A tensor-based approach for the qos evaluation in service-oriented environments,

    X. Su, M. Zhang, Y . Liang, Z. Cai, L. Guo, and Z. Ding, “A tensor-based approach for the qos evaluation in service-oriented environments,”IEEE Transactions on Network and Service Management, vol. 18, no. 3, pp. 3843–3857, 2021

    2021

  33. [33]

    A posterior-neighborhood-regularized latent factor model for highly accurate web service qos prediction,

    D. Wu, Q. He, X. Luo, M. Shang, Y . He, and G. Wang, “A posterior-neighborhood-regularized latent factor model for highly accurate web service qos prediction,”IEEE Transactions on Services Computing, vol. 15, no. 2, pp. 793–805, 2019

    2019

  34. [34]

    X. Luo, M. Zhou, Y . Xia and Q. Zhu.: ’Predicting Web Service QoS via Matrix-Factorization-Based Collaborative Filtering Under Non-Negativity Constraint’. 2014 23rd Wireless Optical Commun. Conf., 2014, pp. 1–6

    2014

  35. [35]

    X. Luo, M. Zhou, Z. Wang, Y . Xia and Q. Zhu.: ’An Effective Scheme for QoS Estimation via Alternating Direction Method-Based Matrix Factorization’, IEEE Trans. Surv. Comput., 2019, 12, (4), pp. 503–518

    2019

  36. [36]

    X. Luo, M. Zhou, Y . Xia and Q. Zhu.: ’An Efficient Non-Negative Matrix-Factorization-Based Approach to Collaborative Filtering for Recommender Systems’, IEEE Trans. Ind. Inf., 2014, 10, (2), pp. 1273–1284

    2014

  37. [37]

    An Inherently Nonnegative Latent Factor Model for High-Dimensional and Sparse Matrices from Industrial Applications,

    X. Luo, M. Zhou, S. Li and M. Shang, “An Inherently Nonnegative Latent Factor Model for High-Dimensional and Sparse Matrices from Industrial Applications,”IEEE Transactions on Industrial Informatics, vol. 14, no. 5, pp. 2011-2022, May 2018

    2011

  38. [38]

    Accelerated Non-negative Latent Factor Analysis on High-Dimensional and Sparse Matrices via Generalized Momentum Method,

    Z. Liu, X. Luo, S. Li and M. Shang, “Accelerated Non-negative Latent Factor Analysis on High-Dimensional and Sparse Matrices via Generalized Momentum Method,” in2018 IEEE International Conference on Systems, Man, and Cybernetics (SMC), Miyazaki, Japan, 2018

    2018

  39. [39]

    H. Wu, X. Luo and M. Zhou.: ’Advancing Non-Negative Laent Factorization of Tensors With Diversified Regularization Schemes’, IEEE Trans. Serv. Comput., 2022, 15, (3), pp. 1334–1344

    2022

  40. [40]

    H. Wu, X. Luo and M. Zhou.: ’Neural Latent Factorization of Tensors for Dynamically Weighted Directed Networks Analysis’. 2021 IEEE Int. Conf. Syst., Man, Cybern., 2021, pp. 3061–3066

    2021

  41. [41]

    H. Wu, X. Luo and M. Zhou.: ’Discovering Hidden Pattern in Large-Scale Dynamically Weighted Directed Network via Latent Factorization of Tensors’, 2021 IEEE 17th Int. Conf. Autom. Sci. Eng., 2021, pp. 1533–1538

    2021

  42. [42]

    H. Wu, Y . Qiao and X. Luo.: ’A Fine-Grained Regulariz-ation Scheme for Non-Negative Latent Factorization of High-Dimensional and Incomplete Tensors’, IEEE Trans. Surv. Co-mput., 2024, 17, (6), pp. 3006–3021

    2024

  43. [43]

    Tang and X

    P. Tang and X. Luo .: ’Neural Tucker Factorization’, IEEE/CAA J. Autom. Sinica, 2024, 12, (0), pp. 1–3

    2024

  44. [44]

    X. Luo, H. Wu, H. Yuan, and M. Zhou.: ’Temporal Pattern-Aware QoS Prediction via Biased Non-Negative Latent Factorization of Tensors’, IEEE Trans. Cybern., 2020, 50, (5), pp. 1798–1809

    2020

  45. [45]

    H. Wu, X. Luo and M. Zhou.: ’Advancing Non-Negative Latent Factorization of Tensors With Diversified Regulariza-tion Schemes’, IEEE Trans. Serv. Comput., 2022, 15, (3), pp. 1334–1344

    2022

  46. [46]

    X. He, L. Liao, H. Zhang, L. Nie, X. Hu, and T.-S. Chua.: ’Neural Collaborative Filtering’. Proc. 26th Int. Conf. World Wide Web, 2017, pp. 173–182

    2017

  47. [47]

    A Two-Stream Light Graph Convolution Network-based Latent Factor Model for Accurate Cloud Service QoS Estimation,

    F. Bi, T. He and X. Luo, “A Two-Stream Light Graph Convolution Network-based Latent Factor Model for Accurate Cloud Service QoS Estimation,” in2022 IEEE International Conference on Data Mining (ICDM), Orlando, FL, USA, 2022

    2022

  48. [48]

    A PID-incorporated Latent Factorization of Tensors Approach to Dynamically Weighted Directed Network Analysis,

    H. Wu, X. Luo, M. Zhou, M. J. Rawa, K. Sedraoui and A. Albeshri, “A PID-incorporated Latent Factorization of Tensors Approach to Dynamically Weighted Directed Network Analysis,”IEEE/CAA J. Autom. Sinica, vol. 9, no. 3, pp. 533-546, March 2022

    2022

  49. [49]

    A Fast Non-Negative Latent Factor Model Based on Generalized Momentum Method,

    X. Luo, Z. Liu, S. Li, M. Shang and Z. Wang, “A Fast Non-Negative Latent Factor Model Based on Generalized Momentum Method,”IEEE Trans. Syst. , Man, Cybern.: Syst., vol. 51, no. 1, pp. 610-620, Jan. 2021

    2021

  50. [50]

    A generalized nesterov-accelerated second-order latent factor model for high-dimensional and incomplete data,

    W. Li, R. Wang, and X. Luo, “A generalized nesterov-accelerated second-order latent factor model for high-dimensional and incomplete data,”IEEE Transactions on Neural Networks and Learning Systems, 2023

    2023

  51. [51]

    Assimilating Second-Order Information for Building Non-Negative Latent Factor Analysis-Based Recommenders,

    W. Li, Q. He, X. Luo and Z. Wang, “Assimilating Second-Order Information for Building Non-Negative Latent Factor Analysis-Based Recommenders,” IEEE Transactions on Systems, Man, and Cybernetics: Systems, vol. 52, no. 1, pp. 485-497, Jan. 2022

    2022

  52. [52]

    Efficient Representation to Dynamic QoS Data via Generalized Nesterov’s Accelerated Gradient-incorporated Biased Non- negative Latent Factorization of Tensors,

    M. Chen and X. Luo, “Efficient Representation to Dynamic QoS Data via Generalized Nesterov’s Accelerated Gradient-incorporated Biased Non- negative Latent Factorization of Tensors, ” in2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC), Melbourne, Australia, 2021

    2021

  53. [53]

    An Adaptive Alternating-direction-method-based Nonnegative Latent Factor Model,

    Y . Zhong, W. Li, Z. Liu and X. Luo, “An Adaptive Alternating-direction-method-based Nonnegative Latent Factor Model,” in2023 IEEE International Conference on Data Mining Workshops (ICDMW), Shanghai, China, 2023

    2023

  54. [54]

    Efficient and High-quality Recommendations via Momentum-incorporated Parallel Stochastic Gradient Descent-Based Learning,

    X. Luo, W. Qin, A. Dong, K. Sedraoui and M. Zhou, “Efficient and High-quality Recommendations via Momentum-incorporated Parallel Stochastic Gradient Descent-Based Learning,”IEEE/CAA Journal of Automatica Sinica, vol. 8, no. 2, pp. 402-411, February 2021

    2021

  55. [55]

    Generalized nesterov’s acceleration-incorporated, non-negative and adaptive latent factor analysis,

    X. Luo, Y . Zhou, Z. Liu, L. Hu, and M. Zhou, “Generalized nesterov’s acceleration-incorporated, non-negative and adaptive latent factor analysis,” IEEE Transactions on Services Computing, vol. 15, no. 5, pp. 2809–2823, 2021

    2021

  56. [56]

    Convergence analysis of single latent factor-dependent, nonnegative, and multiplicative update-based nonnegative latent factor models,

    Z. Liu, X. Luo, and Z. Wang, “Convergence analysis of single latent factor-dependent, nonnegative, and multiplicative update-based nonnegative latent factor models,”IEEE Transactions on Neural Networks and Learning Systems, vol. 32, no. 4, pp. 1737–1749, 2020

    2020

  57. [57]

    Symmetric nonnegative matrix factorization-based community detection models and their convergence analysis,

    X. Luo, Z. Liu, L. Jin, Y . Zhou, and M. Zhou, “Symmetric nonnegative matrix factorization-based community detection models and their convergence analysis,”IEEE Transactions on Neural Networks and Learning Systems, vol. 33, no. 3, pp. 1203–1215, 2021

    2021

  58. [58]

    Hierarchical particle swarm optimization-incorporated latent factor analysis for large-scale incomplete matrices,

    J. Chen, X. Luo, and M. Zhou, “Hierarchical particle swarm optimization-incorporated latent factor analysis for large-scale incomplete matrices,”IEEE Transactions on Big Data, vol. 8, no. 6, pp. 1524–1536, 2021

    2021

  59. [59]

    A Generalized Nesterov-Accelerated Hessian-Vector-Based Latent Factor Analysis Model for QoS Prediction,

    W. Li, X. Luo and M. Zhou, “A Generalized Nesterov-Accelerated Hessian-Vector-Based Latent Factor Analysis Model for QoS Prediction,” in2021 IEEE 14th International Conference on Cloud Computing (CLOUD), Chicago, IL, USA, 2021

    2021

  60. [60]

    A Posterior-Neighborhood-Regularized Latent Factor Model for Highly Accurate Web Service QoS Prediction,

    D. Wu, Q. He, X. Luo, M. Shang, Y . He and G. Wang, “A Posterior-Neighborhood-Regularized Latent Factor Model for Highly Accurate Web Service QoS Prediction,”IEEE Trans. Surv. Comput., vol. 15, no. 2, pp. 793-805, 1 March-April 2022

    2022

  61. [61]

    Pseudo Gradient-Adjusted Particle Swarm Optimization for Accurate Adaptive Latent Factor Analysis,

    X. Luo, J. Chen, Y . Yuan and Z. Wang, “Pseudo Gradient-Adjusted Particle Swarm Optimization for Accurate Adaptive Latent Factor Analysis,”IEEE Trans. Syst. , Man, Cybern.: Syst., vol. 54, no. 4, pp. 2213-2226, April 2024

    2024

  62. [62]

    Generating Highly Accurate Predictions for Missing QoS Data via Aggregating Nonnegative Latent Factor Models,

    X. Luo, M. Zhou, Y . Xia, Q. Zhu, A. C. Ammari and A. Alabdulwahab, “Generating Highly Accurate Predictions for Missing QoS Data via Aggregating Nonnegative Latent Factor Models,”IEEE Trans. Neural Netw. Learn. Syst., vol. 27, no. 3, pp. 524-537, March 2016

    2016

  63. [63]

    Incorporation of Efficient Second-Order Solvers Into Latent Factor Models for Accurate Prediction of Missing QoS Data,

    X. Luoet al., “Incorporation of Efficient Second-Order Solvers Into Latent Factor Models for Accurate Prediction of Missing QoS Data,”IEEE Trans. Cybern., vol. 48, no. 4, pp. 1216-1228, April 2018

    2018

  64. [64]

    A Data-Characteristic-Aware Latent Factor Model for Web Services QoS Prediction,

    D. Wu, X. Luo, M. Shang, Y . He, G. Wang and X. Wu, “A Data-Characteristic-Aware Latent Factor Model for Web Services QoS Prediction,”IEEE Transactions on Knowledge and Data Engineering, vol. 34, no. 6, pp. 2525-2538, 1 June 2022

    2022

  65. [65]

    A Differential Evolution-Enhanced Position-Transitional Approach to Latent Factor Analysis,

    J. Chen, R. Wang, D. Wu and X. Luo, “A Differential Evolution-Enhanced Position-Transitional Approach to Latent Factor Analysis,”IEEE Transactions on Emerging Topics in Computational Intelligence, vol. 7, no. 2, pp. 389-401, April 2023

    2023

  66. [66]

    Algorithms of Unconstrained Non-Negative Latent Factor Analysis for Recommender Systems,

    X. Luo, M. Zhou, S. Li, D. Wu, Z. Liu and M. Shang, “Algorithms of Unconstrained Non-Negative Latent Factor Analysis for Recommender Systems,” IEEE Transactions on Big Data, vol. 7, no. 1, pp. 227-240, 1 March 2021

    2021

  67. [67]

    Nonnegative Latent Factor Analysis-Incorporated and Feature-Weighted Fuzzy Double c-Means Clustering for Incomplete Data,

    Y . Song, M. Li, Z. Zhu, G. Yang and X. Luo, “Nonnegative Latent Factor Analysis-Incorporated and Feature-Weighted Fuzzy Double c-Means Clustering for Incomplete Data,”IEEE Transactions on Fuzzy Systems, vol. 30, no. 10, pp. 4165-4176, Oct. 2022. 8

    2022

  68. [68]

    A Nonlinear PID-Incorporated Adaptive Stochastic Gradient Descent Algorithm for Latent Factor Analysis,

    J. Li, X. Luo, Y . Yuan and S. Gao, “A Nonlinear PID-Incorporated Adaptive Stochastic Gradient Descent Algorithm for Latent Factor Analysis,”IEEE Transactions on Automation Science and Engineering, vol. 21, no. 3, pp. 3742-3756, July 2024

    2024

  69. [69]

    Alternating-Direction-Method of Multipliers-Based Adaptive Nonnegative Latent Factor Analysis,

    Y . Zhong, K. Liu, S. Gao and X. Luo, “Alternating-Direction-Method of Multipliers-Based Adaptive Nonnegative Latent Factor Analysis,”IEEE Transactions on Emerging Topics in Computational Intelligence, vol. 8, no. 5, pp. 3544-3558, Oct. 2024

    2024

  70. [70]

    A fuzzy pid-incorporated stochastic gradient descent algorithm for fast and accurate latent factor analysis,

    Y . Yuan, J. Li, and X. Luo, “A fuzzy pid-incorporated stochastic gradient descent algorithm for fast and accurate latent factor analysis,”IEEE Transactions on Fuzzy Systems, 2024

    2024

  71. [71]

    A momentum-accelerated hessian-vector-based latent factor analysis model,

    W. Li, X. Luo, H. Yuan, and M. Zhou, “A momentum-accelerated hessian-vector-based latent factor analysis model,”IEEE Transactions on Services Computing, vol. 16, no. 2, pp. 830–844, 2022

    2022

  72. [72]

    Adjusting learning depth in nonnegative latent factorization of tensors for accurately modeling temporal patterns in dynamic qos data,

    X. Luo, M. Chen, H. Wu, Z. Liu, H. Yuan, and M. Zhou, “Adjusting learning depth in nonnegative latent factorization of tensors for accurately modeling temporal patterns in dynamic qos data,”IEEE Transactions on Automation Science and Engineering, vol. 18, no. 4, pp. 2142–2155, 2021

    2021

  73. [73]

    Advancing Non-Negative Latent Factorization of Tensors With Diversified Regularization Schemes,

    H. Wu, X. Luo and M. Zhou, “Advancing Non-Negative Latent Factorization of Tensors With Diversified Regularization Schemes,”IEEE Trans. Serv. Comput., vol. 15, no. 3, pp. 1334-1344, 1 May-June 2022

    2022

  74. [74]

    Large-scale and scalable latent factor analysis via distributed alternative stochastic gradient descent for recommender systems,

    X. Shi, Q. He, X. Luo, Y . Bai, and M. Shang, “Large-scale and scalable latent factor analysis via distributed alternative stochastic gradient descent for recommender systems,”IEEE Transactions on Big Data, vol. 8, no. 2, pp. 420–431, 2020

    2020

  75. [75]

    A multilayered-and-randomized latent factor model for high-dimensional and sparse matrices,

    Y . Yuan, Q. He, X. Luo, and M. Shang, “A multilayered-and-randomized latent factor model for high-dimensional and sparse matrices,”IEEE transactions on big data, vol. 8, no. 3, pp. 784–794, 2020

    2020

  76. [77]

    An l 1-and-l 2-norm-oriented latent factor model for recommender systems,

    D. Wu, M. Shang, X. Luo, and Z. Wang, “An l 1-and-l 2-norm-oriented latent factor model for recommender systems,”IEEE Transactions on Neural Networks and Learning Systems, vol. 33, no. 10, pp. 5775–5788, 2021

    2021

  77. [78]

    A distributed adaptive second-order latent factor analysis model,

    J. Wang, W. Li, and X. Luo, “A distributed adaptive second-order latent factor analysis model,”IEEE/CAA Journal of Automatica Sinica, 2024

    2024

  78. [79]

    Mmlf: Multi-metric latent feature analysis for high-dimensional and incomplete data,

    D. Wu, P. Zhang, Y . He, and X. Luo,“Mmlf: Multi-metric latent feature analysis for high-dimensional and incomplete data,”IEEE Transactions on Services Computing, 2023

    2023

  79. [80]

    Adaptive divergence-based non-negative latent factor analysis of high-dimensional and incomplete matrices from industrial applications,

    Y . Yuan, X. Luo, and M. Zhou, “Adaptive divergence-based non-negative latent factor analysis of high-dimensional and incomplete matrices from industrial applications,”IEEE Transactions on Emerging Topics in Computational Intelligence, 2024

    2024

  80. [81]

    An Adaptive Divergence-Based Non-Negative Latent Factor Model,

    Y . Yuan, R. Wang, G. Yuan and L. Xin, “An Adaptive Divergence-Based Non-Negative Latent Factor Model,”IEEE Transactions on Systems, Man, and Cybernetics: Systems, vol. 53, no. 10, pp. 6475-6487, Oct. 2023

    2023

Showing first 80 references.