{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:53:53Z","timestamp":1777704833140,"version":"3.51.4"},"reference-count":26,"publisher":"SAGE Publications","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2021,6,21]]},"abstract":"<jats:p>As a successful improvement on Low Rank Representation (LRR), Latent Low Rank Representation (LatLRR) has been one of the state-of-the-art models for subspace clustering due to the capability of discovering the low dimensional subspace structures of data, especially when the data samples are insufficient and\/or extremely corrupted. However, the LatLRR method does not consider the nonlinear geometric structures within data, which leads to the loss of the locality information among data in the learning phase. Moreover, the coefficients of the learnt representation matrix can be negative, which lack the interpretability. To solve the above drawbacks of LatLRR, this paper introduces Laplacian, sparsity and non-negativity to LatLRR model and proposes a novel subspace clustering method, termed latent low rank representation with non-negative, sparse and laplacian constraints (NNSLLatLRR), in which we jointly take into account non-negativity, sparsity and laplacian properties of the learnt representation. As a result, the NNSLLatLRR can not only capture the global low dimensional structure and intrinsic non-linear geometric information of the data, but also enhance the interpretability of the learnt representation. Extensive experiments on two face benchmark datasets and a handwritten digit dataset show that our proposed method outperforms existing state-of-the-art subspace clustering methods.<\/jats:p>","DOI":"10.3233\/jifs-210274","type":"journal-article","created":{"date-parts":[[2021,4,16]],"date-time":"2021-04-16T13:21:07Z","timestamp":1618579267000},"page":"12151-12165","source":"Crossref","is-referenced-by-count":2,"title":["Robust subspace clustering based on latent low rank representation with non-negative sparse Laplacian constraints"],"prefix":"10.1177","volume":"40","author":[{"given":"Zhixuan","family":"Xu","sequence":"first","affiliation":[{"name":"College of Information Engineering, Yangzhou University, Yangzhou 225127, China"}]},{"given":"Caikou","family":"Chen","sequence":"additional","affiliation":[{"name":"College of Information Engineering, Yangzhou University, Yangzhou 225127, China"}]},{"given":"Guojiang","family":"Han","sequence":"additional","affiliation":[{"name":"College of Information Engineering, Yangzhou University, Yangzhou 225127, China"}]},{"given":"Jun","family":"Gao","sequence":"additional","affiliation":[{"name":"College of Information Engineering, Yangzhou University, Yangzhou 225127, China"}]}],"member":"179","reference":[{"issue":"11","key":"10.3233\/JIFS-210274_ref1","doi-asserted-by":"crossref","first-page":"2765","DOI":"10.1109\/TPAMI.2013.57","article-title":"Sparse subspace clustering: Algorithm, theory, and applications","volume":"35","author":"Elhamifar","year":"2013","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"2","key":"10.3233\/JIFS-210274_ref4","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1109\/TPAMI.2003.1177153","article-title":"Lambertian reflectance and linear subspaces","volume":"25","author":"Basri","year":"2003","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"2","key":"10.3233\/JIFS-210274_ref6","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1162\/089976699300016728","article-title":"Mixtures of probabilistic principal component analyzers","volume":"11","author":"Tipping","year":"1999","journal-title":"Neural Computation"},{"issue":"12","key":"10.3233\/JIFS-210274_ref9","doi-asserted-by":"crossref","first-page":"1945","DOI":"10.1109\/TPAMI.2005.244","article-title":"Generalized principal component analysis (gpca)","volume":"27","author":"Vidal","year":"2005","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"4","key":"10.3233\/JIFS-210274_ref10","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","article-title":"A tutorial on spectral clustering","volume":"17","author":"Von Luxburg","year":"2007","journal-title":"Statistics and Computing"},{"issue":"1","key":"10.3233\/JIFS-210274_ref11","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1109\/TPAMI.2012.88","article-title":"Robust recovery of subspace structures by low-rank representation","volume":"35","author":"Liu","year":"2012","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"10.3233\/JIFS-210274_ref14","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.neucom.2019.02.055","article-title":"Robust subspace clustering via symmetry constrained latent low rank representation with converted nuclear norm","volume":"340","author":"Fang","year":"2019","journal-title":"Neurocomputing"},{"key":"10.3233\/JIFS-210274_ref15","doi-asserted-by":"crossref","first-page":"2479","DOI":"10.1016\/j.neucom.2017.11.021","article-title":"Subspace clustering based on latent low rank representation with frobenius norm minimization","volume":"275","author":"Yu","year":"2018","journal-title":"Neurocomputing"},{"key":"10.3233\/JIFS-210274_ref16","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.jvcir.2015.06.012","article-title":"Towards robust subspace recovery via sparsity-constrained latent low-rank representation","volume":"37","author":"Li","year":"2016","journal-title":"Journal of Visual Communication and Image Representation"},{"issue":"6755","key":"10.3233\/JIFS-210274_ref17","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","article-title":"Learning the parts of objects by non-negative matrix factorization","volume":"401","author":"Lee","year":"1999","journal-title":"Nature"},{"key":"10.3233\/JIFS-210274_ref18","first-page":"8","volume":"1","author":"Liu","year":"2010","journal-title":"Icml"},{"key":"10.3233\/JIFS-210274_ref20","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1016\/j.neucom.2013.06.013","article-title":"Low-rank representation with local constraint for graph construction","volume":"122","author":"Zheng","year":"2013","journal-title":"Neurocomputing"},{"issue":"7","key":"10.3233\/JIFS-210274_ref21","doi-asserted-by":"crossref","first-page":"4009","DOI":"10.1109\/TGRS.2012.2226730","article-title":"Graph-regularized low-rank representation for destriping of hyperspectral images","volume":"51","author":"Lu","year":"2013","journal-title":"IEEE Transactions on Geoscience and Remote Sensing"},{"issue":"3","key":"10.3233\/JIFS-210274_ref22","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1109\/TPAMI.2015.2462360","article-title":"Laplacian regularized low-rank representation and its applications","volume":"38","author":"Yin","year":"2015","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"5","key":"10.3233\/JIFS-210274_ref23","doi-asserted-by":"crossref","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","article-title":"The power of convex relaxation: Near-optimal matrix completion","volume":"56","author":"Cand\u00e8s","year":"2010","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.3233\/JIFS-210274_ref25","first-page":"5","article-title":"Provable subspace clustering: When lrr meets ssc","volume":"1","author":"Wang","year":"2013","journal-title":"NIPS"},{"issue":"12","key":"10.3233\/JIFS-210274_ref26","doi-asserted-by":"crossref","first-page":"8187","DOI":"10.1007\/s00521-019-04317-3","article-title":"Graph constraint-based robust latent space low-rank and sparse subspace clustering","volume":"32","author":"Xiao","year":"2020","journal-title":"Neural Computing and Applications"},{"key":"10.3233\/JIFS-210274_ref27","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.neucom.2012.02.021","article-title":"Local and global structure preserving based feature selection","volume":"89","author":"Ren","year":"2012","journal-title":"Neurocomputing"},{"issue":"4","key":"10.3233\/JIFS-210274_ref29","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","article-title":"A singular value thresholding algorithm for matrix completion","volume":"20","author":"Cai","year":"2010","journal-title":"SIAM Journal on Optimization"},{"issue":"281","key":"10.3233\/JIFS-210274_ref30","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1090\/S0025-5718-2012-02598-1","article-title":"Linearized augmented lagrangian and alternating direction methods for nuclear norm minimization","volume":"82","author":"Yang","year":"2013","journal-title":"Mathematics of Computation"},{"issue":"5","key":"10.3233\/JIFS-210274_ref31","doi-asserted-by":"crossref","first-page":"684","DOI":"10.1109\/TPAMI.2005.92","article-title":"Acquiring linear subspaces for face recognition under variable lighting","volume":"27","author":"Lee","year":"2005","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"10.3233\/JIFS-210274_ref32","unstructured":"Samaria F.S. , Harter A.C. , Parameterisation of a stochastic model for human face identification, in: Proceedings of 1994 IEEE workshop on applications of computer vision, IEEE, 1994, pp. 138\u2013142."},{"issue":"11","key":"10.3233\/JIFS-210274_ref33","doi-asserted-by":"crossref","first-page":"2278","DOI":"10.1109\/5.726791","article-title":"Gradient-based learning applied to document recognition","volume":"86","author":"LeCun","year":"1998","journal-title":"Proceedings of the IEEE"},{"issue":"12","key":"10.3233\/JIFS-210274_ref34","doi-asserted-by":"crossref","first-page":"4918","DOI":"10.1109\/TIP.2015.2472277","article-title":"Dual graph regularized latent low-rank representation for subspace clustering","volume":"24","author":"Yin","year":"2015","journal-title":"IEEE Transactions on Image Processing"},{"key":"10.3233\/JIFS-210274_ref35","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/j.neucom.2018.08.017","article-title":"Symmetric low-rank representation with adaptive distance penalty for semi-supervised learning","volume":"316","author":"Wang","year":"2018","journal-title":"Neurocomputing"},{"key":"10.3233\/JIFS-210274_ref37","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.neunet.2018.08.007","article-title":"Low-rank representation with adaptive graph regularization","volume":"108","author":"Wen","year":"2018","journal-title":"Neural Networks"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-210274","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:42:07Z","timestamp":1777455727000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-210274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,21]]},"references-count":26,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.3233\/jifs-210274","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,21]]}}}