{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:10:01Z","timestamp":1760609401628,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2021,10,7]],"date-time":"2021-10-07T00:00:00Z","timestamp":1633564800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,7]],"date-time":"2021-10-07T00:00:00Z","timestamp":1633564800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61603159"],"award-info":[{"award-number":["61603159"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61902160"],"award-info":[{"award-number":["61902160"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s10489-021-02826-0","type":"journal-article","created":{"date-parts":[[2021,10,7]],"date-time":"2021-10-07T06:06:49Z","timestamp":1633586809000},"page":"7653-7669","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Correntropy-based dual graph regularized nonnegative matrix factorization with Lp smoothness for data representation"],"prefix":"10.1007","volume":"52","author":[{"given":"Zhenqiu","family":"Shu","sequence":"first","affiliation":[]},{"given":"Zonghui","family":"Weng","sequence":"additional","affiliation":[]},{"given":"Zhengtao","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Congzhe","family":"You","sequence":"additional","affiliation":[]},{"given":"Zhen","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Songze","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Xiaojun","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,7]]},"reference":[{"key":"2826_CR1","doi-asserted-by":"crossref","unstructured":"Lei X, Tie J, Fujita H (2020) Relational completion based non-negative matrix factorization for predicting metabolite-disease associations. Knowledge-Based Syst 204:106238.","DOI":"10.1016\/j.knosys.2020.106238"},{"key":"2826_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.neucom.2017.04.067","volume":"266","author":"H Li","year":"2017","unstructured":"Li H, Zhang SJ, Liu G (2017) Graph-based discriminative nonnegative matrix factorization with label information. Neurocomputing 266:91\u2013100","journal-title":"Neurocomputing"},{"key":"2826_CR3","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/j.neucom.2017.08.053","volume":"275","author":"B Jiang","year":"2018","unstructured":"Jiang B, Ding C, Luo B (2018) Robust data representation using locally linear embedding guided PCA. Neurocomputing 275:523\u2013532","journal-title":"Neurocomputing"},{"key":"2826_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2019.08.060","volume":"508","author":"T Deng","year":"2020","unstructured":"Deng T, Ye D, Ma R et al (2020) Low-rank local tangent space embedding for subspace clustering. Inf Sci 508:1\u201321","journal-title":"Inf Sci"},{"key":"2826_CR5","first-page":"1","volume":"10","author":"Y Xue","year":"2021","unstructured":"Xue Y, Tang Y, Xu X et al (2021) Multi-objective feature selection with missing data in classification. IEEE Trans Emerg Topic Comput Intell 10:1\u201310","journal-title":"IEEE Trans Emerg Topic Comput Intell"},{"issue":"11","key":"2826_CR6","doi-asserted-by":"publisher","first-page":"3840","DOI":"10.1109\/TCYB.2016.2585355","volume":"47","author":"X Li","year":"2017","unstructured":"Li X, Cui G, Dong Y (2017) Graph regularized non-negative low-rank matrix factorization for image clustering. IEEE Trans Cybernetics 47(11):3840\u20133853","journal-title":"IEEE Trans Cybernetics"},{"key":"2826_CR7","doi-asserted-by":"crossref","unstructured":"Yang X, Jiang X, Tian C, et al (2020) Inverse projection group sparse representation for tumor classification: a low rank variation dictionary approach. Knowl Based Syst 196:105768.","DOI":"10.1016\/j.knosys.2020.105768"},{"issue":"8","key":"2826_CR8","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","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"5","key":"2826_CR9","doi-asserted-by":"publisher","first-page":"952","DOI":"10.1109\/TKDE.2019.2893956","volume":"32","author":"Z Zhang","year":"2019","unstructured":"Zhang Z, Zhang Y, Liu G et al (2019) Joint label prediction based semi-supervised adaptive concept factorization for robust data representation. IEEE Trans Knowl Data Eng 32(5):952\u2013970","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"2826_CR10","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1109\/TKDE.2019.2940576","volume":"33","author":"Z Zhang","year":"2021","unstructured":"Zhang Z, Zhang Y, Li S et al (2021) Flexible Auto-weighted Local-coordinate concept factorization: a robust framework for unsupervised clustering. IEEE Trans Knowl Data Eng 33(4):1523\u20131539","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2826_CR11","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 nonnegative matrix factorization. Nature 401:788\u2013791","journal-title":"Nature"},{"key":"2826_CR12","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/0010-0285(77)90016-0","volume":"6","author":"SE Palmer","year":"1977","unstructured":"Palmer SE (1977) Hierarchical structure in perceptual representation. Cogn Psychol 6:441\u2013474","journal-title":"Cogn Psychol"},{"key":"2826_CR13","doi-asserted-by":"crossref","unstructured":"Wachsmuth E, Oram M W, Perrett DI (1994) Recognition of objects and their component parts: responses of single units in the temporal cortex of the macaque 4:509\u2013522","DOI":"10.1093\/cercor\/4.5.509"},{"key":"2826_CR14","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1146\/annurev.ne.19.030196.003045","volume":"19","author":"N Logothetis","year":"1996","unstructured":"Logothetis N, Sheinberg D (1996) Visual object recognition. Annu Rev Neurosci 19:577\u2013621","journal-title":"Annu Rev Neurosci"},{"key":"2826_CR15","doi-asserted-by":"crossref","unstructured":"Leng C, Zhang H, Cai G (2018) A novel data clustering method based on smooth non-negative matrix factorization, in ICSM, pp 24\u201326.","DOI":"10.1007\/978-3-030-04375-9_35"},{"key":"2826_CR16","doi-asserted-by":"crossref","unstructured":"Chen P, He Y, Lu H, et al (2015) Constrained non-negative matrix factorization with graph Laplacian, International Conference on Neural Information Processing.","DOI":"10.1007\/978-3-319-26555-1_72"},{"key":"2826_CR17","doi-asserted-by":"publisher","first-page":"2030","DOI":"10.1109\/TIP.2011.2105496","volume":"20","author":"N Guan","year":"2011","unstructured":"Guan N, Tao D, Luo Z, Yuan B (2011) Manifold regularized discriminative nonnegative matrix factorization with fast gradient descent. IEEE Trans Image Process 20:2030\u20132048","journal-title":"IEEE Trans Image Process"},{"issue":"6","key":"2826_CR18","doi-asserted-by":"publisher","first-page":"2237","DOI":"10.1016\/j.patcog.2011.12.015","volume":"45","author":"F Shang","year":"2012","unstructured":"Shang F, Jiao LC, Wang F (2012) Graph dual regularization non-negative matrix factorization for co-clustering. Pattern Recogn 45(6):2237\u20132250","journal-title":"Pattern Recogn"},{"issue":"8","key":"2826_CR19","doi-asserted-by":"publisher","first-page":"1561","DOI":"10.1109\/TPAMI.2010.220","volume":"33","author":"R He","year":"2011","unstructured":"He R, Zheng W, Hu B (2011) Maximum correntropy criterion for robust face recognition. IEEE Trans Pattern Anal Mach Intell 33(8):1561\u20131576","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"2826_CR20","doi-asserted-by":"crossref","unstructured":"Zhou N, Dong B, et al (2019) Maximum correntropy criterion-based robust semi-supervised concept factorization for image representation. IEEE Trans Neural Networks Learn Syst.","DOI":"10.1109\/TNNLS.2019.2947156"},{"issue":"5","key":"2826_CR21","first-page":"172","volume":"204","author":"Y Wang","year":"2014","unstructured":"Wang Y, Wu S, Mao B et al (2014) Correntropy induced metric based graph regularized non-negative matrix factorization. Neurocomputing 204(5):172\u2013182","journal-title":"Neurocomputing"},{"key":"2826_CR22","unstructured":"Lee DD, Seung H (2011) Algorithms for non-negative matrix factorization. Adv Neural Inform Process Syst 13."},{"key":"2826_CR23","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1049\/iet-ipr.2016.0391","volume":"6","author":"Z Shu","year":"2017","unstructured":"Shu Z, Fan H et al (2017) Multiple Laplacian graph regularized low-rank representation with application to image representation. IET Image Proc 6:370\u2013378","journal-title":"IET Image Proc"},{"key":"2826_CR24","first-page":"1","volume":"99","author":"B Chen","year":"2019","unstructured":"Chen B, Wang X, Li Y et al (2019) Maximum correntropy criterion with variable center. IEEE Signal Process Lett 99:1\u20131","journal-title":"IEEE Signal Process Lett"},{"key":"2826_CR25","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.ins.2020.04.017","volume":"528","author":"Z Shu","year":"2020","unstructured":"Shu Z, Wu X, You C et al (2020) Rank-constrained nonnegative matrix factorization algorithm for data representation. Inf Sci 528:133\u2013146","journal-title":"Inf Sci"},{"key":"2826_CR26","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/TSP.2019.2952057","volume":"68","author":"Y He","year":"2019","unstructured":"He Y, Fei W, Li Y et al (2019) Robust matrix completion via maximum correntropy criterion and Half Quadratic optimization. IEEE Trans Signal Process 68:181\u2013195","journal-title":"IEEE Trans Signal Process"},{"key":"2826_CR27","first-page":"91","volume":"2","author":"Z Shu","year":"2019","unstructured":"Shu Z, Wu X et al (2019) The optimal graph regularized sparse coding with application to image representation. PRCV 2:91\u2013101","journal-title":"PRCV"},{"key":"2826_CR28","doi-asserted-by":"publisher","first-page":"3572","DOI":"10.1109\/TCSII.2020.2995419","volume":"99","author":"J Yang","year":"2020","unstructured":"Yang J, Cao J, Xue A (2020) Robust Maximum mixture correntropy criterion-based semi-supervised ELM with variable center. IEEE Trans Circuit Syst 99:3572\u20133576","journal-title":"IEEE Trans Circuit Syst"},{"issue":"8","key":"2826_CR29","doi-asserted-by":"publisher","first-page":"1561","DOI":"10.1109\/TPAMI.2010.220","volume":"33","author":"R He","year":"2011","unstructured":"He R, Zhen W, Hu B (2011) Maximum correntropy criterion for robust face recognition. IEEE Trans Pattern Anal Mach Intell 33(8):1561\u20131576","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"3","key":"2826_CR30","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1109\/TPAMI.2016.2554555","volume":"39","author":"G Trigeorgis","year":"2017","unstructured":"Trigeorgis G, Bousmalis K, Zafeiriou S et al (2017) A deep matrix factorization method for learning attribute representations[J]. IEEE Trans Pattern Anal Mach Intell 39(3):417\u2013429","journal-title":"IEEE Trans Pattern Anal Mach Intell"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02826-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02826-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02826-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,5]],"date-time":"2022-05-05T09:25:36Z","timestamp":1651742736000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02826-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,7]]},"references-count":30,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["2826"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02826-0","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2021,10,7]]},"assertion":[{"value":"8 September 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}