{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T14:03:31Z","timestamp":1781877811171,"version":"3.54.5"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"14","license":[{"start":{"date-parts":[[2022,6,14]],"date-time":"2022-06-14T00:00:00Z","timestamp":1655164800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,6,14]],"date-time":"2022-06-14T00:00:00Z","timestamp":1655164800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62003281"],"award-info":[{"award-number":["62003281"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["SWU020006"],"award-info":[{"award-number":["SWU020006"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005230","name":"Natural Science Foundation of Chongqing","doi-asserted-by":"publisher","award":["cstc2021jcyjmsxmX1169"],"award-info":[{"award-number":["cstc2021jcyjmsxmX1169"]}],"id":[{"id":"10.13039\/501100005230","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s00521-022-07200-w","type":"journal-article","created":{"date-parts":[[2022,6,14]],"date-time":"2022-06-14T18:04:40Z","timestamp":1655229880000},"page":"9995-10009","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Graph non-negative matrix factorization with alternative smoothed $$L_0$$ regularizations"],"prefix":"10.1007","volume":"35","author":[{"given":"Keyi","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hangjun","family":"Che","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinqi","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Man-Fai","family":"Leung","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,6,14]]},"reference":[{"issue":"4","key":"7200_CR1","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/0010-0285(77)90016-0","volume":"9","author":"SE Palmer","year":"1977","unstructured":"Palmer SE (1977) Hierarchical structure in perceptual representation. Cogn Psychol 9(4):441\u2013474","journal-title":"Cogn Psychol"},{"issue":"5","key":"7200_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1093\/cercor\/4.5.509","volume":"4","author":"E Wachsmuth","year":"1994","unstructured":"Wachsmuth E, Oram M, Perrett D (1994) Recognition of objects and their component parts: responses of single units in the temporal cortex of the macaque. Cereb Cortex 4(5):509\u2013522","journal-title":"Cereb Cortex"},{"issue":"6755","key":"7200_CR3","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"DD Lee","year":"1999","unstructured":"Lee DD, Seung HS (1999) Learning the parts of objects by non-negative matrix factorization. Nature 401(6755):788\u2013791","journal-title":"Nature"},{"issue":"5","key":"7200_CR4","doi-asserted-by":"publisher","first-page":"3007","DOI":"10.1109\/TGRS.2019.2946751","volume":"58","author":"X Lu","year":"2019","unstructured":"Lu X, Dong L, Yuan Y (2019) Subspace clustering constrained sparse nmf for hyperspectral unmixing. IEEE Trans Geosci Remote Sens 58(5):3007\u20133019","journal-title":"IEEE Trans Geosci Remote Sens"},{"issue":"20","key":"7200_CR5","doi-asserted-by":"publisher","first-page":"13745","DOI":"10.1007\/s00521-021-06014-6","volume":"33","author":"A Hassani","year":"2021","unstructured":"Hassani A, Iranmanesh A, Mansouri N (2021) Text mining using nonnegative matrix factorization and latent semantic analysis. Neural Comput Appl 33(20):13745\u201313766. https:\/\/doi.org\/10.1007\/s00521-021-06014-6. Accessed 2022-02-22","journal-title":"Neural Comput Appl"},{"issue":"8","key":"7200_CR6","doi-asserted-by":"publisher","first-page":"3952","DOI":"10.1109\/TCYB.2020.3000799","volume":"51","author":"N Yu","year":"2021","unstructured":"Yu N, Wu M-J, Liu J-X, Zheng C-H, Xu Y (2021) Correntropy-based hypergraph regularized nmf for clustering and feature selection on multi-cancer integrated data. IEEE Trans Cybern 51(8):3952\u20133963. https:\/\/doi.org\/10.1109\/TCYB.2020.3000799","journal-title":"IEEE Trans Cybern"},{"issue":"10","key":"7200_CR7","doi-asserted-by":"publisher","first-page":"3002","DOI":"10.1109\/JBHI.2020.2975199","volume":"24","author":"C-N Jiao","year":"2020","unstructured":"Jiao C-N, Gao Y-L, Yu N, Liu J-X, Qi L-Y (2020) Hyper-graph regularized constrained nmf for selecting differentially expressed genes and tumor classification. IEEE J Biomed Health Inf 24(10):3002\u20133011","journal-title":"IEEE J Biomed Health Inf"},{"key":"7200_CR8","first-page":"1457","volume":"5","author":"P Hoyer","year":"2004","unstructured":"Hoyer P (2004) Nonnegative matrix factorization with sparseness constraints. J Mach Learn Res JMLR 5:1457\u20131469","journal-title":"J Mach Learn Res JMLR"},{"issue":"3","key":"7200_CR9","doi-asserted-by":"publisher","first-page":"2391","DOI":"10.1109\/TGRS.2020.3006109","volume":"59","author":"L Dong","year":"2020","unstructured":"Dong L, Yuan Y, Luxs X (2020) Spectral-spatial joint sparse nmf for hyperspectral unmixing. IEEE Trans Geosci Remote Sens 59(3):2391\u20132402","journal-title":"IEEE Trans Geosci Remote Sens"},{"key":"7200_CR10","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.neucom.2019.11.070","volume":"382","author":"S Huang","year":"2020","unstructured":"Huang S, Xu Z, Kang Z, Ren Y (2020) Regularized nonnegative matrix factorization with adaptive local structure learning. Neurocomputing 382:196\u2013209","journal-title":"Neurocomputing"},{"key":"7200_CR11","first-page":"454","volume-title":"Int Symp Neural Netw","author":"H Che","year":"2019","unstructured":"Che H, Wang J, Zhang W (2019) A collaborative neurodynamic approach to sparse coding. Int Symp Neural Netw. Springer, New York, pp 454\u2013462"},{"key":"7200_CR12","doi-asserted-by":"crossref","unstructured":"Che H, Wang J (2018) A collaborative neurodynamic approach to symmetric nonnegative matrix factorization. In: International Conference on Neural Information Processing. Springer, new York, pp 453\u2013462","DOI":"10.1007\/978-3-030-04179-3_40"},{"key":"7200_CR13","doi-asserted-by":"publisher","unstructured":"Che H, Wang J, Cichocki A (2021) Bicriteria sparse nonnegative matrix factorization via two-timescale duplex neurodynamic optimization. IEEE Transactions on Neural Networks and Learning Systems, 1\u201311. https:\/\/doi.org\/10.1109\/TNNLS.2021.3125457","DOI":"10.1109\/TNNLS.2021.3125457"},{"issue":"8","key":"7200_CR14","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.1162\/neco_a_01294","volume":"32","author":"X Li","year":"2020","unstructured":"Li X, Wang J, Kwong S (2020) A discrete-time neurodynamic approach to sparsity-constrained nonnegative matrix factorization. Neural Comput 32(8):1531\u20131562","journal-title":"Neural Comput"},{"issue":"8","key":"7200_CR15","doi-asserted-by":"publisher","first-page":"4215","DOI":"10.1007\/s00521-017-3337-5","volume":"31","author":"X Dai","year":"2019","unstructured":"Dai X, Li C, He X, Li C (2019) Nonnegative matrix factorization algorithms based on the inertial projection neural network. Neural Comput Appl 31(8):4215\u20134229. https:\/\/doi.org\/10.1007\/s00521-017-3337-5. Accessed 2022-02-22","journal-title":"Neural Comput Appl"},{"issue":"8","key":"7200_CR16","doi-asserted-by":"publisher","first-page":"1548","DOI":"10.1109\/TPAMI.2010.231","volume":"33","author":"D Cai","year":"2011","unstructured":"Cai D, He X, Han J, Huang TS (2011) Graph regularized nonnegative matrix factorization for data representation. IEEE Trans Pattern Anal Mach Intell 33(8):1548\u20131560. https:\/\/doi.org\/10.1109\/TPAMI.2010.231","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"7200_CR17","doi-asserted-by":"crossref","unstructured":"Rajabi R, Ghassemian H (2013) Hyperspectral data unmixing using gnmf method and sparseness constraint. In: 2013 IEEE International Geoscience and Remote Sensing Symposium-IGARSS, pp. 1450\u20131453. IEEE","DOI":"10.1109\/IGARSS.2013.6723058"},{"issue":"12","key":"7200_CR18","doi-asserted-by":"publisher","first-page":"2131","DOI":"10.3390\/molecules22122131","volume":"22","author":"R Zhu","year":"2017","unstructured":"Zhu R, Liu J-X, Zhang Y-K, Guo Y (2017) A robust manifold graph regularized nonnegative matrix factorization algorithm for cancer gene clustering. Molecules 22(12):2131. https:\/\/doi.org\/10.3390\/molecules22122131","journal-title":"Molecules"},{"issue":"11","key":"7200_CR19","doi-asserted-by":"publisher","first-page":"7879","DOI":"10.1007\/s00521-018-3608-9","volume":"31","author":"X Dai","year":"2019","unstructured":"Dai X, Chen G, Li C (2019) A discriminant graph nonnegative matrix factorization approach to computer vision. Neural Comput Appl 31(11):7879\u20137889. https:\/\/doi.org\/10.1007\/s00521-018-3608-9. Accessed 2022-02-22","journal-title":"Neural Comput Appl"},{"issue":"4","key":"7200_CR20","doi-asserted-by":"publisher","first-page":"1258","DOI":"10.1016\/j.bbe.2021.08.009","volume":"41","author":"J Mu","year":"2021","unstructured":"Mu J, Dai L, Liu J-X, Shang J, Xu F, Liu X, Yuan S (2021) Automatic detection for epileptic seizure using graph-regularized nonnegative matrix factorization and bayesian linear discriminate analysis. Biocybern Biomed Eng 41(4):1258\u20131271","journal-title":"Biocybern Biomed Eng"},{"issue":"2","key":"7200_CR21","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10618-017-0543-9","volume":"32","author":"S Huang","year":"2018","unstructured":"Huang S, Wang H, Li T, Li T, Xu Z (2018) Robust graph regularized nonnegative matrix factorization for clustering. Data Min Knowl Disc 32(2):483\u2013503","journal-title":"Data Min Knowl Disc"},{"issue":"6","key":"7200_CR22","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1109\/TCBB.2015.2505294","volume":"13","author":"D Wang","year":"2016","unstructured":"Wang D, Liu J-X, Gao Y-L, Zheng C-H, Xu Y (2016) Characteristic gene selection based on robust graph regularized non-negative matrix factorization. IEEE\/ACM Trans Comput Biol Bioinf 13(6):1059\u20131067","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"issue":"1","key":"7200_CR23","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1109\/TSP.2008.2007606","volume":"57","author":"H Mohimani","year":"2008","unstructured":"Mohimani H, Babaie-Zadeh M, Jutten C (2008) A fast approach for overcomplete sparse decomposition based on smoothed $$l_{0}$$ norm. IEEE Trans Signal Process 57(1):289\u2013301","journal-title":"IEEE Trans Signal Process"},{"key":"7200_CR24","doi-asserted-by":"crossref","unstructured":"Wang Y, Li X, Wang J (2020) A neurodynamic approach to $$l_0$$-constrained optimization. In: 2020 12th International Conference on Advanced Computational Intelligence (ICACI), pp. 44\u201350. IEEE","DOI":"10.1109\/ICACI49185.2020.9177499"},{"key":"7200_CR25","doi-asserted-by":"crossref","unstructured":"Li X, Wang J, Kwong S (2020) Sparse nonnegative matrix factorization based on a hyperbolic tangent approximation of $$l_0$$ norm and neurodynamic optimization. In: 2020 12th International Conference on Advanced Computational Intelligence (ICACI), pp 542\u2013549. IEEE","DOI":"10.1109\/ICACI49185.2020.9177819"},{"key":"7200_CR26","unstructured":"Lee DD, Seung HS (2000) Algorithms for non-negative matrix factorization. In: Proceedings of the 13th International Conference on Neural Information Processing Systems. NIPS\u201900, pp. 535\u2013541. MIT Press, Cambridge, MA, USA"},{"key":"7200_CR27","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.neunet.2018.03.003","volume":"103","author":"H Che","year":"2018","unstructured":"Che H, Wang J (2018) A nonnegative matrix factorization algorithm based on a discrete-time projection neural network. Neural Netw 103:63\u201371","journal-title":"Neural Netw"},{"key":"7200_CR28","doi-asserted-by":"crossref","unstructured":"Guo Z, Wang J (2010) A neurodynamic optimization approach to constrained sparsity maximization based on alternative objective functions. In: The 2010 International Joint Conference on Neural Networks (IJCNN), pp. 1\u20138. IEEE","DOI":"10.1109\/IJCNN.2010.5596553"},{"key":"7200_CR29","doi-asserted-by":"crossref","unstructured":"Wang L, Ye P, Xiang J (2018) A modified algorithm based on smoothed $$l_0$$ norm in compressive sensing signal reconstruction. In: 2018 25th IEEE International Conference on Image Processing (ICIP), pp. 1812\u20131816. IEEE","DOI":"10.1109\/ICIP.2018.8451799"},{"issue":"11","key":"7200_CR30","doi-asserted-by":"publisher","first-page":"583","DOI":"10.3390\/sym10110583","volume":"10","author":"J Xiang","year":"2018","unstructured":"Xiang J, Yue H, Yin X, Ruan G (2018) A reweighted symmetric smoothed function approximating $$l_0$$-norm regularized sparse reconstruction method. Symmetry 10(11):583","journal-title":"Symmetry"},{"issue":"4","key":"7200_CR31","doi-asserted-by":"publisher","first-page":"1350","DOI":"10.1016\/j.patcog.2007.09.010","volume":"41","author":"C Boutsidis","year":"2008","unstructured":"Boutsidis C, Gallopoulos E (2008) Svd based initialization: a head start for nonnegative matrix factorization. Pattern Recogn 41(4):1350\u20131362. https:\/\/doi.org\/10.1016\/j.patcog.2007.09.010","journal-title":"Pattern Recogn"},{"key":"7200_CR32","unstructured":"Dua, D., Graff, C.: UCI Machine Learning Repository (2017). http:\/\/archive.ics.uci.edu\/ml"},{"key":"7200_CR33","doi-asserted-by":"publisher","unstructured":"Huang H-C, Chuang Y-Y, Chen C-S (2012) Affinity aggregation for spectral clustering. In: 2012 IEEE Conference on Computer Vision and Pattern Recognition, pp 773\u2013780. https:\/\/doi.org\/10.1109\/CVPR.2012.6247748","DOI":"10.1109\/CVPR.2012.6247748"},{"key":"7200_CR34","unstructured":"Du L, Zhou P, Shi L, Wang H, Fan M, Wang W, Shen Y-D (2015) Robust multiple kernel k-means using $$l_{2;1}$$-norm. In: Proceedings of the 24th International Conference on Artificial Intelligence, pp. 3476\u20133482 (2015). IJCAI"},{"issue":"6191","key":"7200_CR35","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1126\/science.1242072","volume":"344","author":"A Rodriguez","year":"2014","unstructured":"Rodriguez A, Laio A (2014) Clustering by fast search and find of density peaks. Science 344(6191):1492\u20131496","journal-title":"Science"},{"key":"7200_CR36","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.neucom.2011.09.02","volume":"80","author":"R Peharz","year":"2012","unstructured":"Peharz R, Pernkopf F (2012) Sparse nonnegative matrix factorization with $$l_0$$-constraints. Neurocomputing 80:38\u201346. https:\/\/doi.org\/10.1016\/j.neucom.2011.09.024 Special Issue on Machine Learning for Signal Processing 2010","journal-title":"Neurocomputing"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07200-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-022-07200-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07200-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T00:05:38Z","timestamp":1682381138000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-022-07200-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,14]]},"references-count":36,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["7200"],"URL":"https:\/\/doi.org\/10.1007\/s00521-022-07200-w","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,14]]},"assertion":[{"value":"10 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 June 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"All data, algorithms, and code generated or used during the study appear in https:\/\/github.com\/chen12304\/SGNMF.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}