Electronic Science and Technology ›› 2025, Vol. 38 ›› Issue (3): 7-15.doi: 10.16180/j.cnki.issn1007-7820.2025.03.002
Previous Articles Next Articles
DONG Jiaying1, SONG Yan2(
), LI Ming3
Received:2023-08-28
Revised:2023-09-11
Online:2025-03-15
Published:2025-03-11
Supported by:CLC Number:
DONG Jiaying, SONG Yan, LI Ming. A Nonlinear Representation-Based Probabilistic Latent Factorization Tensor Model[J].Electronic Science and Technology, 2025, 38(3): 7-15.
"
| 输入:Λ,R,η,γ1,γ2,γ3 | |
|---|---|
| 初始化: 初始化:l=1,max_l=L while not converge and l≤L do 1. for each Yijk∈Λ er end for 2.根据式(10)更新 3.根据式(11)更新 4.根据式(12)更新 5.l=l+1 end while 6.根据式(13)更新uri、vrj、trk | Θ((|I|+|J|+|K|)×R) Θ(1) ×N ×|Λ| Θ(R) Θ(1) Θ(Λi×|I|×R) Θ(Λj×|J|×R) Θ(Λk×|K|×R) Θ(1) Θ((|I|+|J|+|K|)×R) |
| 输出:U,V,T |
Table 5.
Prediction error of M1~M5 on D1.1~D2.3(MAE/RMSE)"
| 数据集 | 评价 指标 | M1 | M2 | M3 | M4 | M5 |
|---|---|---|---|---|---|---|
| D1.1 | MAE RMSE | 1.061 3 1.425 4 | 3.579 2 3.749 5 | 8.248 5 12.056 8 | 4.089 3 16.085 1 | 1.060 9 1.342 5 |
| D1.2 | MAE RMSE | 1.097 3 1.489 4 | 3.498 1 3.668 8 | 6.113 8 7.757 1 | 2.205 9 8.173 6 | 1.072 8 1.369 0 |
| D1.3 | MAE RMSE | 1.102 8 1.496 7 | 3.406 6 3.578 8 | 6.509 1 8.210 4 | 1.653 2 5.954 7 | 1.093 0 1.388 2 |
| D2.1 | MAE RMSE | 2.670 1 2.852 1 | 16.888 2 32.291 1 | 6.816 4 9.137 4 | 5.352 4 26.023 9 | 1.096 7 1.401 8 |
| D2.2 | MAE RMSE | 2.666 8 2.847 7 | 3.291 0 3.448 8 | 6.283 1 7.901 3 | 2.037 7 11.578 8 | 1.102 2 1.409 8 |
| D2.3 | MAE RMSE | 2.667 2 2.847 9 | 3.517 0 3.671 4 | 6.041 0 7.603 9 | 1.483 2 7.823 7 | 1.084 5 1.388 9 |
Table 6.
Time cost of M1~M5 on D1.1~D2.3"
| 数据集 | 评价指标 | M1 | M2 | M3 | M4 | M5 |
|---|---|---|---|---|---|---|
| D1.1 | 总耗时/s 单次迭代耗时/s 迭代次数 | 156 2.771 56 | 926 1.852 500 | 5 376 10.752 500 | 942 1.884 500 | 124 3.284 38 |
| D1.2 | 总耗时/s 单次迭代耗时/s 迭代次数 | 623 17.800 35 | 3,405 6.809 500 | 22,775 45.550 500 | 3,903 7.805 500 | 515 13.271 39 |
| D1.3 | 总耗时/s 单次迭代耗时s 迭代次数 | 893 29.767 30 | 5 908 11.817 500 | 33 788 67.575 500 | 4,187 8.373 500 | 330 22.630 15 |
| D2.1 | 总耗时/s 单次迭代耗时/s 迭代次数 | 2 545 55.324 46 | 12 088 24.176 500 | 19 278 38.557 500 | 22 855 45.709 500 | 1 010 31.959 32 |
| D2.2 | 总耗时/s 单次迭代耗时/s 迭代次数 | 11 888 258.433 46 | 62 759 125.519 500 | 81 501 163.002 500 | 87 127 174.254 500 | 4 273 164.350 26 |
| D2.3 | 总耗时/s 单次迭代耗时/s 迭代次数 | 20 236 439.921 46 | 109 709 219.418 500 | 138 219 276.439 500 | 117 500 235.000 500 | 14 894 273.788 54 |
| [1] | Luo X, Chen M, Wu H, et al. Adjusting learning depth in nonnegative latent factorization of tensors for accurately modeling temporal patterns in dynamic QoS data[J]. IEEE Transactions on Automation Science and Engineering, 2021, 18(4):2142-2155. |
| [2] | Chen M, Wu H. Efficient representation to dynamic QoS data via momentum-incorporated biased nonnegative and adaptive latent factorization of tensors[C]. Beijing: International Conference on Cyber-Physical Social Intelligence,2021:1-6. |
| [3] | Zhang Y, Zheng Z, Lyu M R. WSPred:A time-aware personalized QoS prediction framework for Web services[C]. Hiroshima: IEEE the Twenty-second International Symposium on Software Reliability Engineering,2011:210-219. |
| [4] | Zhang W, Sun H, Liu X, et al. Temporal QoS-aware web service recommendation via non-negative tensor factorization[C]. New York: Proceedings of the Twenty-third International Conference on World Wide Web,2014:585-596. |
| [5] | Chen J, Yuan Y, Ruan T, et al. Hyper-parameter-evolutionary latent factor analysis for high-dimensional and sparse data from recommender systems[J]. Neurocomputing, 2021, 42(1):316-328. |
| [6] | Wu D, Luo X, He Y, et al. A prediction-sampling-based multilayer-structured latent factor model for accurate representation to high-dimensional and sparse data[J]. IEEE Transactions on Neural Networks and Learning Systems, 2024, 35(3):3845-3858. |
| [7] | Kolda T G, Bader B W. Tensor decompositions and applications[J]. SIAM Review, 2009, 51(3):455-500. |
| [8] | 程旗, 李捷, 高晓利, 等. 基于深度稀疏低秩分解的深度神经网络轻量化方法[J]. 控制与决策, 2023, 38(3):751-758. |
| Cheng Qi, Li Jie, Gao Xiaoli, et al. Lightweight method of deep neural network based on deep sparse low rank decomposition[J]. Control and Decision, 2023, 38(3): 751-758. | |
| [9] | Liu J, Musialski P, Wonka P, et al. Tensor completion for estimating missing values in visual data[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2013, 35(1):208-220. |
| [10] | Lu C, Feng J, Chen Y, et al. Tensor robust principal component analysis with a new tensor nuclear norm[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2020, 42(4):925-938. |
| [11] | Zhou P, Lu C, Feng J, et al. Tensor low-rank representation for data recovery and clustering[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2021, 43(5): 1718-1732. |
| [12] | Jiang B, Ding C, Tang J, et al. Image representation and learning with graph laplacian tucker tensor decomposition[J]. IEEE Transactions on Cybernetics, 2019, 49(4):1417-1426. |
| [13] | Luo X, Wu H, Yuan H, et al. Temporal pattern-aware QoS prediction via biased non-negative latent factorization of tensors[J]. IEEE Transactions on Cybernetics, 2020, 50(5): 1798-1809. |
| [14] | Wu H, Luo X, Zhou M C, et al. A PID-incorporated latent factorization of tensors approach to dynamically weighted directed network analysis[J]. IEEE/CAA Journal of Automatica Sinica, 2022, 9(3):533-546. |
| [15] | Luo X, Wu H, Li Z. NeuLFT:A novel approach to nonlinear canonical polyadic decomposition on high- dimensional incomplete tensors[J]. IEEE Transactions on Knowledge and Data Engineering, 2023, 35(6):6148-6166. |
| [16] | Mnih A, Salakhutdinov R R. Probabilistic matrix factorization[C]. Vancouver: Advances in Neural Information Processing Systems,2008:1257-1264. |
| [17] | Luo X, Zhou M, Li S, et al. Algorithms of unconstrained non-negative latent factor analysis for recommender systems[J]. IEEE Transactions on Big Data, 2021, 7(1): 227-240. |
| [18] | Qin W, Luo X, Zhou M C. Adaptive alternating stochastic gradient descent algorithms for large-scale latent factor analysis[C]. Chicago: IEEE International Conference on Services Computing,2021:285-290. |
| [19] | Song Y, Li M, Zhu Z, et al. Nonnegative latent factor analysis-incorporated and feature-weighted fuzzy double c-means clustering for incomplete data[J]. IEEE Transactions on Fuzzy Systems, 2022, 30(10):4165-4176. |
| [20] | Shani G, Gunawardana A. Evaluating recommendation systems. recommender systems handbook[M]. The 12th ed. Boston: Springer,2011:257-297. |
| [21] | Song Y, Li M, Luo X, et al. Improved symmetric and nonnegative matrix factorization models for undirected, sparse and large-scaled networks:A triple factorization based approach[J]. IEEE Transactions on Industrial Informatics, 2020, 16(5):3006-3017. |
| [22] | 陈柘, 刘嘉华, 赵斌, 等. 基于GCN和TCN的多因素城市路网出租车需求预测[J]. 控制与决策, 2023, 38(4): 1031-1038. |
| Chen Tuo, Liu Jiahua, Zhao Bin, et al. Multi-factor taxi demand forecasting for urban road network based on GCN and TCN[J]. Control and Decision, 2023, 38(4): 1031-1038. | |
| [23] | Luo X, Zhou M C, Li S, et al. Non-negativity constrained missing data estimation for high-dimensional and sparse matrices from industrial applications[J]. IEEE Transactions on Cybernetics, 2020, 50(5):1844-1855. |
| [24] | Liu Z, Luo X, Wang Z. Convergence analysis of single latent factor-dependent, nonnegative, and multiplicative update-based nonnegative latent factor models[J]. IEEE Transactions on Neural Networks and Learning Systems, 2021, 32(4):1737-1749. |
| [25] | Demsar J. Statistical comparisons of classifiers over multiple data sets[J]. Journal of Machine Learning Research, 2006, 7(7):1-30. |
| [1] | WANG Ziyi, CHEN Shiping. Self-Supervised Network Intrusion Detection Model Based on Graph Contrastive Learning [J]. Electronic Science and Technology, 2025, 38(3): 22-31. |
| [2] | SHI Zhicai. Research on the Security and Privacy Preserving Method of RFID Systems [J]. Electronic Science and Technology, 2025, 38(2): 78-83. |
| [3] | YAN Pingping, LI Hui, CHEN Yinchao, YANG Zhaoxu, GUO Xiaodan. An Airborne Unified Network Protocol Conformance Testing Technique Based on Time Trigger [J]. Electronic Science and Technology, 2025, 38(1): 14-22. |
| [4] | QIU Leilei, XU Xianghua, WANG Ran. A Grey-Box Fuzzing Method for Network Protocols Based on Message Sequence Attribution Optimization [J]. Electronic Science and Technology, 2024, 37(11): 39-46. |
| [5] | TAO Hongyu, XU Xianghua. Pluralistic Seed Selection-Based Hybrid Fuzzing [J]. Electronic Science and Technology, 2024, 37(11): 13-21. |
| [6] | ZHANG Di, LI Yunfa. Blockchain-Based Data Sharing Mechanism for Multi-Domain Internet of Things [J]. Electronic Science and Technology, 2024, 37(10): 55-63. |
| [7] | YANG Xiao, LI Gaolei. Persistent Clean-Label Backdoor Attack for Semi-Supervised Graph Node Classification [J]. Electronic Science and Technology, 2024, 37(9): 57-63. |
| [8] | WANG Shun, XU Xianghua, WANG Ran. Smart Contract Vulnerability Detection Method Based on Meta-Operation [J]. Electronic Science and Technology, 2024, 37(9): 64-71. |
| [9] | LU Zhenyang. Overview of Research on Network Security Situation Prediction Technology [J]. Electronic Science and Technology, 2024, 37(8): 92-96. |
| [10] | FANG Xiang. Research Progress in Network Security Situation Awareness Models [J]. Electronic Science and Technology, 2024, 37(6): 98-102. |
| [11] | WU Jiacheng, YU Xiao. A Review of Research on Cybersecurity Risk Assessment Methods [J]. Electronic Science and Technology, 2024, 37(3): 10-17. |
| [12] | GONG Zhi,LIU Chao,FU Qiang. Network Security Device Design Based on Red-Black Isolation Architecture [J]. Electronic Science and Technology, 2024, 37(2): 76-86. |
| [13] | BAI Rui,REN Zhu. Estimation and Performance Analysis of Unscented Kalman Filter with Randomly Missing Measurements [J]. Electronic Science and Technology, 2024, 37(2): 23-29. |
| [14] | LI Xiuwen,WANG Lei,REN Zhu. Security Detection of Extended Kalman Filter under Injection Attack [J]. Electronic Science and Technology, 2023, 36(10): 68-73. |
| [15] | LU Minlong,GUO Wei,ZHANG Xuanxiong. UWB/PDR Pedestrian Localization System Based on Adaptive UKF [J]. Electronic Science and Technology, 2023, 36(6): 41-49. |
|
||