{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T14:50:05Z","timestamp":1776351005006,"version":"3.51.2"},"reference-count":68,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T00:00:00Z","timestamp":1638230400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2020YFB2104000"],"award-info":[{"award-number":["2020YFB2104000"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Programs of National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61860206011, 62172157"],"award-info":[{"award-number":["61860206011, 62172157"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Swiss National Science Foundation NRP75 project","award":["407540_167266"],"award-info":[{"award-number":["407540_167266"]}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"crossref","award":["CSC201906130109"],"award-info":[{"award-number":["CSC201906130109"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM\/IMS Trans. Data Sci."],"published-print":{"date-parts":[[2021,11,30]]},"abstract":"<jats:p>Matrix factorization (MF) can extract the low-rank features and integrate the information of the data manifold distribution from high-dimensional data, which can consider the nonlinear neighborhood information. Thus, MF has drawn wide attention for low-rank analysis of sparse big data, e.g., Collaborative Filtering (CF) Recommender Systems, Social Networks, and Quality of Service. However, the following two problems exist: (1) huge computational overhead for the construction of the Graph Similarity Matrix (GSM) and (2) huge memory overhead for the intermediate GSM. Therefore, GSM-based MF, e.g., kernel MF, graph regularized MF, and so on, cannot be directly applied to the low-rank analysis of sparse big data on cloud and edge platforms. To solve this intractable problem for sparse big data analysis, we propose Locality Sensitive Hashing (LSH) aggregated MF (LSH-MF), which can solve the following problems: (1) The proposed probabilistic projection strategy of LSH-MF can avoid the construction of the GSM. Furthermore, LSH-MF can satisfy the requirement for the accurate projection of sparse big data. (2) To run LSH-MF for fine-grained parallelization and online learning on GPUs, we also propose CULSH-MF, which works on CUDA parallelization. Experimental results show that CULSH-MF can not only reduce the computational time and memory overhead but also obtain higher accuracy. Compared with deep learning models, CULSH-MF can not only save training time but also achieve the same accuracy performance.<\/jats:p>","DOI":"10.1145\/3497749","type":"journal-article","created":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T08:30:29Z","timestamp":1648197029000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Locality Sensitive Hash Aggregated Nonlinear Neighborhood Matrix Factorization for Online Sparse Big Data Analysis"],"prefix":"10.1145","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4735-794X","authenticated-orcid":false,"given":"Zixuan","family":"Li","sequence":"first","affiliation":[{"name":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2989-0679","authenticated-orcid":false,"given":"Hao","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2635-7716","authenticated-orcid":false,"given":"Kenli","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9392-2597","authenticated-orcid":false,"given":"Fan","family":"Wu","sequence":"additional","affiliation":[{"name":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4228-6735","authenticated-orcid":false,"given":"Lydia","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Electric Engineering, Mathematics and Computer Science, Distributed Systems, Delft University of Technology, Delft, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5224-4048","authenticated-orcid":false,"given":"Keqin","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Computer Science, State University of New York, New Paltz, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,3,25]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3133083"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2015.08.005"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.50"},{"key":"e_1_3_2_5_2","first-page":"4715","volume-title":"Advances in Neural Information Processing Systems","author":"Borgs Christian","year":"2017","unstructured":"Christian Borgs, Jennifer Chayes, Christina E. Lee, and Devavrat Shah. 2017. Thy friend is my friend: Iterative collaborative filtering for sparse matrix estimation. In Advances in Neural Information Processing Systems. 4715\u20134726."},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1690"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2904026"},{"key":"e_1_3_2_8_2","article-title":"Making online sketching hashing even faster","author":"Chen Xixian","year":"2019","unstructured":"Xixian Chen, Haiqin Yang, Shenglin Zhao, Michael R. Lyu, and Irwin King. 2019. Making online sketching hashing even faster. IEEE Trans. Knowl. Data Eng. 33, 3 (2019), 1089\u20131101.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2937282"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.5555\/2789272.2912091"},{"key":"e_1_3_2_11_2","first-page":"658","volume-title":"Advances in Neural Information Processing Systems","author":"Dosovitskiy Alexey","year":"2016","unstructured":"Alexey Dosovitskiy and Thomas Brox. 2016. Generating images with perceptual similarity metrics based on deep networks. In Advances in Neural Information Processing Systems. 658\u2013666."},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btz177"},{"key":"e_1_3_2_13_2","first-page":"1190","volume-title":"IEEE 35th International Conference on Data Engineering (ICDE)","author":"Fernandez Raul Castro","year":"2019","unstructured":"Raul Castro Fernandez, Jisoo Min, Demitri Nava, and Samuel Madden. 2019. Lazo: A cardinality-based method for coupled estimation of Jaccard similarity and containment. In IEEE 35th International Conference on Data Engineering (ICDE). IEEE, 1190\u20131201."},{"key":"e_1_3_2_14_2","first-page":"3348","volume-title":"Advances in Neural Information Processing Systems","author":"Fusi Nicolo","year":"2018","unstructured":"Nicolo Fusi, Rishit Sheth, and Melih Elibol. 2018. Probabilistic matrix factorization for automated machine learning. In Advances in Neural Information Processing Systems. 3348\u20133357."},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2018.10.020"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.01.054"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.5555\/3367032.3367228"},{"key":"e_1_3_2_18_2","article-title":"Structured low-rank matrix factorization: Global optimality, algorithms, and applications","author":"Haeffele Benjamin David","year":"2019","unstructured":"Benjamin David Haeffele and Ren\u00e9 Vidal. 2019. Structured low-rank matrix factorization: Global optimality, algorithms, and applications. IEEE Trans. Pattern Anal. Mach. Intell. 42, 6 (2019), 1468\u20131482.","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052569"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911489"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.47"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.22"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2752156"},{"key":"e_1_3_2_24_2","first-page":"11826","volume-title":"Advances in Neural Information Processing Systems","author":"Jha Susmit","year":"2019","unstructured":"Susmit Jha, Sunny Raj, Steven Fernandes, Sumit K. Jha, Somesh Jha, Brian Jalaian, Gunjan Verma, and Ananthram Swami. 2019. Attribution-based confidence metric for deep neural networks. In Advances in Neural Information Processing Systems. 11826\u201311837."},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/2906151"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2435785"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3054951"},{"key":"e_1_3_2_28_2","first-page":"1297","volume-title":"Advances in Neural Information Processing Systems","author":"Kawale Jaya","year":"2015","unstructured":"Jaya Kawale, Hung H. Bui, Branislav Kveton, Long Tran-Thanh, and Sanjay Chawla. 2015. Efficient Thompson sampling for online matrix-factorization recommendation. In Advances in Neural Information Processing Systems. 1297\u20131305."},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959165"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401944"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.11.003"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367572"},{"key":"e_1_3_2_33_2","first-page":"556","volume-title":"Advances in Neural Information Processing Systems","author":"Lee Daniel D.","year":"2001","unstructured":"Daniel D. Lee and H. Sebastian Seung. 2001. Algorithms for non-negative matrix factorization. In Advances in Neural Information Processing Systems. 556\u2013562."},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2718515"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.07.060"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.3047460"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2836464"},{"key":"e_1_3_2_38_2","doi-asserted-by":"crossref","DOI":"10.1109\/TCC.2017.2672554","article-title":"Multimedia processing pricing strategy in GPU-accelerated cloud computing","author":"Li H.","year":"2020","unstructured":"H. Li, K. Ota, M. Dong, A. Vasilakos, and K. Nagano. 2020. Multimedia processing pricing strategy in GPU-accelerated cloud computing. IEEE Trans. Cloud Comput. 8, 4 (2020), 1264\u20131273.","journal-title":"IEEE Trans. Cloud Comput."},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2585355"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2951386"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959182"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW.2015.7301269"},{"key":"e_1_3_2_43_2","article-title":"MTFH: A matrix tri-factorization hashing framework for efficient cross-modal retrieval","author":"Liu Xin","year":"2019","unstructured":"Xin Liu, Zhikai Hu, Haibin Ling, and Yiu-ming Cheung. 2019. MTFH: A matrix tri-factorization hashing framework for efficient cross-modal retrieval. IEEE Trans. Pattern Anal. Mach. Intell. (2019).","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","unstructured":"Xin Liu Tsuyoshi Murata Kyoung-Sook Kim Chatchawan Kotarasu and Chenyi Zhuang. 2019. A general view for network embedding as matrix factorization. In Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining (Melbourne VIC Australia) (WSDM\u201919). Association for Computing Machinery New York NY USA 375\u2013383. 10.1145\/3289600.3291029","DOI":"10.1145\/3289600.3291029"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242592"},{"key":"e_1_3_2_46_2","first-page":"1257","volume-title":"Advances in Neural Information Processing Systems","author":"Mnih Andriy","year":"2008","unstructured":"Andriy Mnih and Ruslan R. Salakhutdinov. 2008. Probabilistic matrix factorization. In Advances in Neural Information Processing Systems. 1257\u20131264."},{"key":"e_1_3_2_47_2","first-page":"3697","volume-title":"Advances in Neural Information Processing Systems","author":"Monti Federico","year":"2017","unstructured":"Federico Monti, Michael Bronstein, and Xavier Bresson. 2017. Geometric matrix completion with recurrent multi-graph neural networks. In Advances in Neural Information Processing Systems. 3697\u20133707."},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/3038228.3038240"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.16"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23528-8_20"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/3356316"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2018.2849563"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2327238"},{"key":"e_1_3_2_54_2","first-page":"1329","volume-title":"Advances in Neural Information Processing Systems","author":"Srebro Nathan","year":"2005","unstructured":"Nathan Srebro, Jason Rennie, and Tommi S. Jaakkola. 2005. Maximum-margin matrix factorization. In Advances in Neural Information Processing Systems. 1329\u20131336."},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1145\/2907294.2907297"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2016.2554555"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052598"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2016.2595569"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2017.2775230"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1145\/3078597.3078602"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/447"},{"key":"e_1_3_2_62_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972795.68"},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2638838"},{"key":"e_1_3_2_64_2","doi-asserted-by":"publisher","DOI":"10.14778\/2732967.2732973"},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.02.008"},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983841"},{"key":"e_1_3_2_67_2","article-title":"Covering-based web service quality prediction via neighborhood-aware matrix factorization","author":"Zhang Yiwen","year":"2019","unstructured":"Yiwen Zhang, Kaibin Wang, Qiang He, Feifei Chen, Shuiguang Deng, Zibin Zheng, and Yun Yang. 2019. Covering-based web service quality prediction via neighborhood-aware matrix factorization. IEEE Trans. Serv. Comput. (2019), 1\u201312.","journal-title":"IEEE Trans. Serv. Comput."},{"key":"e_1_3_2_68_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2018.09.010"},{"key":"e_1_3_2_69_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2017.2703636"}],"container-title":["ACM\/IMS Transactions on Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3497749","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3497749","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T13:56:08Z","timestamp":1776347768000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3497749"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,30]]},"references-count":68,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,11,30]]}},"alternative-id":["10.1145\/3497749"],"URL":"https:\/\/doi.org\/10.1145\/3497749","relation":{},"ISSN":["2691-1922"],"issn-type":[{"value":"2691-1922","type":"print"}],"subject":[],"published":{"date-parts":[[2021,11,30]]},"assertion":[{"value":"2020-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-11-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-03-25","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}