{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T19:15:51Z","timestamp":1768418151474,"version":"3.49.0"},"reference-count":50,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T00:00:00Z","timestamp":1742601600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62307008"],"award-info":[{"award-number":["62307008"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Natural Science Foundation of Fujian Province of China","award":["2024J01067"],"award-info":[{"award-number":["2024J01067"]}]},{"name":"Young Top Talent of Young Eagle Program of Fujian Province, China","award":["F21E0011202B01"],"award-info":[{"award-number":["F21E0011202B01"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2025,4,30]]},"abstract":"<jats:p>High-dimensional and incomplete (HDI) data are involved frequently in big data-related industrial applications. Latent factor (LF) analysis aims at extracting the knowledge of great value from such extremely sparse HDI data efficiently. Non-negative LF models based on the single LF-dependent, non-negative, and multiplicative update rules exactly are the representative of LF analysis. However, these models face low generalization dilemma due to incompatible with general unconstrained optimization techniques. To address this issue, this article proposes a novel momentum-accelerated and biased unconstrained non-negative latent factor (MBUNLF) model, which matches with unconstrained optimization techniques. The proposed MBUNLF model is built on three main ideas: (a) Improving the generalization through a non-negative mapping function; (b) Capturing information among different entities through linear biases; (c) Accelerating convergence during the training process through generalized momentum method. Empirical studies on six datasets from industrial applications indicate that the proposed MBUNLF model outperforms nine state-of-the-art models when processing HDI data, reducing the root mean square error by 19.47% on average. It demonstrates the validity of the MBUNLF model in extracting non-negative LFs from HDI data.<\/jats:p>","DOI":"10.1145\/3717069","type":"journal-article","created":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T17:23:22Z","timestamp":1739467402000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Momentum-Accelerated and Biased Unconstrained Non-Negative Latent Factor Model for Handling High-Dimensional and Incomplete Data"],"prefix":"10.1145","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2026-7178","authenticated-orcid":false,"given":"Mingwei","family":"Lin","sequence":"first","affiliation":[{"name":"College of Computer and Cyber Security, Fujian Normal University, Fuzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-0234-5666","authenticated-orcid":false,"given":"Hengshuo","family":"Yang","sequence":"additional","affiliation":[{"name":"College of Computer and Cyber Security, Fujian Normal University, Fuzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6639-5269","authenticated-orcid":false,"given":"Xiuqin","family":"Xu","sequence":"additional","affiliation":[{"name":"College of Computer and Cyber Security, Fujian Normal University, Fuzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4766-5670","authenticated-orcid":false,"given":"Ling","family":"Lin","sequence":"additional","affiliation":[{"name":"College of Computer and Cyber Security, Fujian Normal University, Fuzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3547-2908","authenticated-orcid":false,"given":"Zeshui","family":"Xu","sequence":"additional","affiliation":[{"name":"Business School, Sichuan University, Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1348-5305","authenticated-orcid":false,"given":"Xin","family":"Luo","sequence":"additional","affiliation":[{"name":"College of Computer and Information Science, Southwest University, Chongqing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,3,22]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600425"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119797"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447395"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.5555\/1248547.1248548"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3003728"},{"issue":"8","key":"e_1_3_1_8_2","first-page":"8047","article-title":"Vicinal vertex allocation for matrix factorization in networks","volume":"52","author":"He Tiantian","year":"2021","unstructured":"Tiantian He, Lu Bai, and Yew-Soon Ong. 2021. Vicinal vertex allocation for matrix factorization in networks. IEEE Transactions on Cybernetics 52, 8 (2021), 8047\u20138060.","journal-title":"IEEE Transactions on Cybernetics"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2024.104129"},{"key":"e_1_3_1_10_2","first-page":"2641","article-title":"Learning conjoint attentions for graph neural nets","volume":"34","author":"He Tiantian","year":"2021","unstructured":"Tiantian He, Yew Soon Ong, and Lu Bai. 2021. Learning conjoint attentions for graph neural nets. In Advances in Neural Information Processing Systems, Vol. 34, 2641\u20132653.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052569"},{"issue":"3","key":"e_1_3_1_12_2","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1108\/IJICC-02-2024-0091","article-title":"Breast cancer pre-diagnosis based on incomplete picture fuzzy multi-granularity three-way decisions","volume":"17","author":"Hou Haonan","year":"2024","unstructured":"Haonan Hou, Chao Zhang, Fanghui Lu, and Panna Lu. 2024. Breast cancer pre-diagnosis based on incomplete picture fuzzy multi-granularity three-way decisions. International Journal of Intelligent Computing and Cybernetics 17, 3 (2024), 549\u2013576.","journal-title":"International Journal of Intelligent Computing and Cybernetics"},{"key":"e_1_3_1_13_2","first-page":"135","volume-title":"4th ACM Conference on Recommender Systems","author":"Jamali Mohsen","year":"2010","unstructured":"Mohsen Jamali and Martin Ester. 2010. A matrix factorization technique with trust propagation for recommendation in social networks. In 4th ACM Conference on Recommender Systems. ACM, New York, NY, 135\u2013142."},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2023.3241062"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/245108.245126"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3498366.3505833"},{"issue":"4","key":"e_1_3_1_18_2","doi-asserted-by":"crossref","first-page":"2362","DOI":"10.1109\/JBHI.2024.3357979","article-title":"Discovering consensus regions for interpretable identification of RNA n6-methyladenosine modification sites via graph contrastive clustering","volume":"28","author":"Li Guodong","year":"2024","unstructured":"Guodong Li, Bowei Zhao, Xiaorui Su, Yue Yang, Pengwei Hu, Xi Zhou, and Lun Hu. 2024. Discovering consensus regions for interpretable identification of RNA n6-methyladenosine modification sites via graph contrastive clustering. IEEE Journal of Biomedical and Health Informatics 28, 4 (2024), 2362\u20132372.","journal-title":"IEEE Journal of Biomedical and Health Informatics"},{"issue":"1","key":"e_1_3_1_19_2","first-page":"1","article-title":"A nonlinear PID-incorporated adaptive stochastic gradient descent algorithm for latent factor analysis","volume":"1","author":"Li Jinli","year":"2023","unstructured":"Jinli Li, Xin Luo, Ye Yuan, and Shangce Gao. 2023. A nonlinear PID-incorporated adaptive stochastic gradient descent algorithm for latent factor analysis. IEEE Transactions on Automation Science and Engineering 1, 1 (2023), 1\u201315.","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2023.126441"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2021.3077738"},{"issue":"1","key":"e_1_3_1_22_2","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1186\/s12859-019-3312-5","article-title":"Optimization and expansion of non-negative matrix factorization","volume":"21","author":"Lin Xihui","year":"2020","unstructured":"Xihui Lin and Paul C. Boutros. 2020. Optimization and expansion of non-negative matrix factorization. BMC Bioinformatics 21, 1 (2020), 7.","journal-title":"BMC Bioinformatics"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2961666"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2018.2875452"},{"issue":"5","key":"e_1_3_1_25_2","first-page":"2011","article-title":"An inherently nonnegative latent factor model for high-dimensional and sparse matrices from industrial applications","volume":"14","author":"Luo Xin","year":"2017","unstructured":"Xin Luo, MengChu Zhou, Shuai Li, and MingSheng Shang. 2017. An inherently nonnegative latent factor model for high-dimensional and sparse matrices from industrial applications. IEEE Transactions on Industrial Informatics 14, 5 (2017), 2011\u20132022.","journal-title":"IEEE Transactions on Industrial Informatics"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2916868"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2014.2308433"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2412037"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/1297231.1297235"},{"key":"e_1_3_1_30_2","first-page":"1257","article-title":"Probabilistic matrix factorization","volume":"20","author":"Mnih Andriy","year":"2007","unstructured":"Andriy Mnih and Russ R. Salakhutdinov. 2007. Probabilistic matrix factorization. In Advances in Neural Information Processing Systems, Vol. 20, 1257\u20131264.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_1_31_2","first-page":"188","volume-title":"2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)","author":"Ni Jianmo","year":"2019","unstructured":"Jianmo Ni, Jiacheng Li, and Julian McAuley. 2019. Justifying recommendations using distantly-labeled reviews and fine-grained aspects. In 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). Association for Computational Linguistics, Hong Kong, China, 188\u2013197."},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1002\/env.3170050203"},{"issue":"1","key":"e_1_3_1_33_2","first-page":"1","article-title":"Parallel adaptive stochastic gradient descent algorithms for latent factor analysis of high-dimensional and incomplete industrial data","volume":"1","author":"Qin Wen","year":"2023","unstructured":"Wen Qin, Xin Luo, Shuai Li, and MengChu Zhou. 2023. Parallel adaptive stochastic gradient descent algorithms for latent factor analysis of high-dimensional and incomplete industrial data. IEEE Transactions on Automation Science and Engineering 1, 1 (2023), 1\u201314.","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.csbj.2019.12.011"},{"issue":"7","key":"e_1_3_1_35_2","first-page":"3322","article-title":"Hierarchical latent context representation for context-aware recommendations","volume":"34","author":"Unger Moshe","year":"2022","unstructured":"Moshe Unger and Alexander Tuzhilin. 2022. Hierarchical latent context representation for context-aware recommendations. IEEE Transactions on Knowledge and Data Engineering 34, 7 (2022), 3322\u20133334.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"2","key":"e_1_3_1_36_2","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1109\/TC.2020.3046617","article-title":"Efficient processing of sparse tensor decomposition via unified abstraction and PE-interactive architecture","volume":"71","author":"Wang Bangyan","year":"2021","unstructured":"Bangyan Wang, Lei Deng, Zheng Qu, Shuangchen Li, Zheng Zhang, and Yuan Xie. 2021. Efficient processing of sparse tensor decomposition via unified abstraction and PE-interactive architecture. IEEE Transactions on Computers 71, 2 (2021), 266\u2013281.","journal-title":"IEEE Transactions on Computers"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1108\/IJICC-01-2024-0016"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2023.3279321"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2023.3338565"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.10.040"},{"issue":"3","key":"e_1_3_1_41_2","doi-asserted-by":"crossref","first-page":"1257","DOI":"10.1109\/TCBB.2020.3003941","article-title":"protein2vec: Predicting protein-protein interactions based on LSTM","volume":"19","author":"Zhang Jiongmin","year":"2020","unstructured":"Jiongmin Zhang, Man Zhu, and Ying Qian. 2020. protein2vec: Predicting protein-protein interactions based on LSTM. IEEE\/ACM Transactions on Computational Biology and Bioinformatics 19, 3 (2020), 1257\u20131266.","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2024.3365936"},{"key":"e_1_3_1_43_2","first-page":"549","volume-title":"2006 SIAM International Conference on Data Mining","author":"Zhang Sheng","year":"2006","unstructured":"Sheng Zhang, Weihong Wang, James Ford, and Fillia Makedon. 2006. Learning from incomplete ratings using non-negative matrix factorization. In 2006 SIAM International Conference on Data Mining. SIAM, 549\u2013553."},{"issue":"6","key":"e_1_3_1_44_2","doi-asserted-by":"crossref","first-page":"bbac384","DOI":"10.1093\/bib\/bbac384","article-title":"A geometric deep learning framework for drug repositioning over heterogeneous information networks","volume":"23","author":"Zhao Bo-Wei","year":"2022","unstructured":"Bo-Wei Zhao, Xiao-Rui Su, Peng-Wei Hu, Yu-Peng Ma, Xi Zhou, and Lun Hu. 2022. A geometric deep learning framework for drug repositioning over heterogeneous information networks. Briefings in Bioinformatics 23, 6 (2022), bbac384.","journal-title":"Briefings in Bioinformatics"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.011.1900587"},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/MITS.2019.2953557"},{"issue":"8","key":"e_1_3_1_47_2","doi-asserted-by":"crossref","first-page":"13275","DOI":"10.1109\/TITS.2021.3123276","article-title":"A novel prediction-based temporal graph routing algorithm for software-defined vehicular networks","volume":"23","author":"Zhao Liang","year":"2021","unstructured":"Liang Zhao, Zhuhui Li, Ahmed Y. Al-Dubai, Geyong Min, Jiajia Li, Ammar Hawbani, and Albert Y. Zomaya. 2021. A novel prediction-based temporal graph routing algorithm for software-defined vehicular networks. IEEE Transactions on Intelligent Transportation Systems 23, 8 (2021), 13275\u201313290.","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"issue":"1","key":"e_1_3_1_48_2","first-page":"1","article-title":"Overtaking feasibility prediction for mixed connected and connectionless vehicles","volume":"1","author":"Zhao Liang","year":"2024","unstructured":"Liang Zhao, Hui Qian, Ammar Hawbani, Ahmed Y. Al-Dubai, Zhiyuan Tan, Keping Yu, and Albert Y. Zomaya. 2024. Overtaking feasibility prediction for mixed connected and connectionless vehicles. IEEE Transactions on Intelligent Transportation Systems 1, 1 (2024), 1\u201316.","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"issue":"11","key":"e_1_3_1_49_2","doi-asserted-by":"crossref","first-page":"7871","DOI":"10.1109\/TII.2021.3059640","article-title":"Vehicular computation offloading for industrial mobile edge computing","volume":"17","author":"Zhao Liang","year":"2021","unstructured":"Liang Zhao, Kaiqi Yang, Zhiyuan Tan, Houbing Song, Ahmed Al-Dubai, Albert Y. Zomaya, and Xianwei Li. 2021. Vehicular computation offloading for industrial mobile edge computing. IEEE Transactions on Industrial Informatics 17, 11 (2021), 7871\u20137881.","journal-title":"IEEE Transactions on Industrial Informatics"},{"key":"e_1_3_1_50_2","first-page":"39","volume-title":"Pacific Rim International Conference on Artificial Intelligence","author":"Zhong Yurong","year":"2023","unstructured":"Yurong Zhong, Zhe Xie, Weiling Li, and Xin Luo. 2023. A dynamic linear bias incorporation scheme for nonnegative latent factor analysis. In Pacific Rim International Conference on Artificial Intelligence. Springer, Singapore, 39\u201351."},{"key":"e_1_3_1_51_2","first-page":"928","volume-title":"20th International Conference on Machine Learning (ICML \u201903)","author":"Zinkevich Martin","year":"2003","unstructured":"Martin Zinkevich. 2003. Online convex programming and generalized infinitesimal gradient ascent. In 20th International Conference on Machine Learning (ICML \u201903), 928\u2013936."}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3717069","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3717069","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:55Z","timestamp":1750295935000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3717069"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,22]]},"references-count":50,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,4,30]]}},"alternative-id":["10.1145\/3717069"],"URL":"https:\/\/doi.org\/10.1145\/3717069","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,22]]},"assertion":[{"value":"2024-06-02","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-02-04","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-03-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}