{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T15:23:20Z","timestamp":1783610600228,"version":"3.55.0"},"reference-count":43,"publisher":"Association for Computing Machinery (ACM)","issue":"7","license":[{"start":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T00:00:00Z","timestamp":1683158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["62176221, 62276216, 61876158, 61806170, 62276215"],"award-info":[{"award-number":["62176221, 62276216, 61876158, 61806170, 62276215"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2023,8,31]]},"abstract":"<jats:p>Clustering is a popular research topic in the field of data mining, in which the clustering method based on non-negative matrix factorization (NMF) has been widely employed. However, in the update process of NMF, there is no learning rate to guide the update as well as the update depends on the data itself, which leads to slow convergence and low clustering accuracy. To solve these problems, a generalized deep learning clustering (GDLC) algorithm based on NMF is proposed in this article. Firstly, a nonlinear constrained NMF (NNMF) algorithm is constructed to achieve sequential updates of the elements in the matrix guided by the learning rate. Then, the gradient values corresponding to the element update are transformed into generalized weights and generalized biases, by inputting the elements as well as their corresponding generalized weights and generalized biases into the nonlinear activation function to construct the GDLC algorithm. In addition, for improving the understanding of the GDLC algorithm, its detailed inference procedure and algorithm design are provided. Finally, the experimental results on eight datasets show that the GDLC algorithm has efficient performance.<\/jats:p>","DOI":"10.1145\/3584862","type":"journal-article","created":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T11:48:17Z","timestamp":1676893697000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["A Generalized Deep Learning Clustering Algorithm\u00a0Based on Non-Negative Matrix Factorization"],"prefix":"10.1145","volume":"17","author":[{"given":"Dexian","family":"Wang","sequence":"first","affiliation":[{"name":"Southwest Jiaotong University, Chengdu, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tianrui","family":"Li","sequence":"additional","affiliation":[{"name":"Southwest Jiaotong University, Chengdu, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7208-8855","authenticated-orcid":false,"given":"Ping","family":"Deng","sequence":"additional","affiliation":[{"name":"Xihua University, Chengdu, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8735-2812","authenticated-orcid":false,"given":"Fan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Southwest Jiaotong University, Chengdu, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9031-107X","authenticated-orcid":false,"given":"Wei","family":"Huang","sequence":"additional","affiliation":[{"name":"Southwest Jiaotong University, Chengdu, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7090-0325","authenticated-orcid":false,"given":"Pengfei","family":"Zhang","sequence":"additional","affiliation":[{"name":"Southwest Jiaotong University, Chengdu, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2910-3447","authenticated-orcid":false,"given":"Jia","family":"Liu","sequence":"additional","affiliation":[{"name":"Southwest Jiaotong University, Chengdu, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,5,4]]},"reference":[{"issue":"1998","key":"e_1_3_2_2_2","first-page":"1","article-title":"Linear discriminant analysis-a brief tutorial","volume":"18","author":"Balakrishnama Suresh","year":"1998","unstructured":"Suresh Balakrishnama and Aravind Ganapathiraju. 1998. Linear discriminant analysis-a brief tutorial. Institute for Signal and Information Processing 18, 1998 (1998), 1\u20138.","journal-title":"Institute for Signal and Information Processing"},{"issue":"8","key":"e_1_3_2_3_2","doi-asserted-by":"crossref","first-page":"1548","DOI":"10.1109\/TPAMI.2010.231","article-title":"Graph regularized nonnegative matrix factorization for data representation","volume":"33","author":"Cai Deng","year":"2010","unstructured":"Deng Cai, Xiaofei He, Jiawei Han, and Thomas S. Huang. 2010. Graph regularized nonnegative matrix factorization for data representation. IEEE Transactions on Pattern Analysis and Machine Intelligence 33, 8 (2010), 1548\u20131560.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.08.152"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107101"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2022.3154030"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.108040"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150420"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2012.2197827"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.26599\/BDMA.2019.9020020"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.4324\/9781410612403"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.107814"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/2601434"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2019.11.070"},{"key":"e_1_3_2_15_2","first-page":"19","article-title":"A tutorial overview of vector and matrix norms","author":"Kahan W.","year":"2013","unstructured":"W. Kahan. 2013. A tutorial overview of vector and matrix norms. University of California, Berkeley, CA, Lecture Notes (2013), 19.","journal-title":"University of California, Berkeley, CA, Lecture Notes"},{"key":"e_1_3_2_16_2","first-page":"66","volume-title":"Proceedings of the 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP\u201915)","author":"Roux Jonathan Le","year":"2015","unstructured":"Jonathan Le Roux, John R. Hershey, and Felix Weninger. 2015. Deep NMF for speech separation. In Proceedings of the 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP\u201915). IEEE, 66\u201370."},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature14539"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1038\/44565"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106238"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2014.2371895"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.isprsjprs.2019.12.002"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2585355"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2017.11.008"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330846"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107683"},{"key":"e_1_3_2_26_2","first-page":"233","volume-title":"Proceedings of the Optimizing Methods in Statistics","author":"Robbins Herbert","year":"1971","unstructured":"Herbert Robbins and David Siegmund. 1971. A convergence theorem for non negative almost supermartingales and some applications. In Proceedings of the Optimizing Methods in Statistics. Elsevier, 233\u2013257."},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1037\/h0042519"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1038\/323533a0"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.06.053"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2011.12.015"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2657007"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2977497"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.07.062"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2005.244"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2016.2539154"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/0169-7439(87)80084-9"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2005.845141"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107236"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2984552"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271697"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2014.02.029"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.image.2020.115984"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2620967"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2962679"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3584862","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3584862","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:08:45Z","timestamp":1750183725000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3584862"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,4]]},"references-count":43,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2023,8,31]]}},"alternative-id":["10.1145\/3584862"],"URL":"https:\/\/doi.org\/10.1145\/3584862","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,4]]},"assertion":[{"value":"2022-05-31","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-02-13","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-05-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}