{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:54:33Z","timestamp":1760597673901,"version":"3.37.3"},"reference-count":59,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100002367","name":"Strategic Priority Research Program of the Chinese Academy of Sciences (CAS)","doi-asserted-by":"publisher","award":["XDB02000000"],"award-info":[{"award-number":["XDB02000000"]}],"id":[{"id":"10.13039\/501100002367","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011347","name":"State Key Laboratory of Software Development Environment","doi-asserted-by":"crossref","award":["SKLSDE-2015ZX-14"],"award-info":[{"award-number":["SKLSDE-2015ZX-14"]}],"id":[{"id":"10.13039\/501100011347","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"crossref","award":["2012CB316300"],"award-info":[{"award-number":["2012CB316300"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61473289","61175003"],"award-info":[{"award-number":["61473289","61175003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Youth Innovation Promotion Association through CAS","award":["2015190"],"award-info":[{"award-number":["2015190"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1109\/tnnls.2015.2500600","type":"journal-article","created":{"date-parts":[[2015,12,1]],"date-time":"2015-12-01T19:04:02Z","timestamp":1448996642000},"page":"2643-2655","source":"Crossref","is-referenced-by-count":35,"title":["Information Theoretic Subspace Clustering"],"prefix":"10.1109","volume":"27","author":[{"given":"Ran","family":"He","sequence":"first","affiliation":[]},{"given":"Liang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Zhenan","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Yingya","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/030600862"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/BTAS.2013.6712752"},{"key":"ref33","first-page":"1813","article-title":"Efficient and robust feature selection via joint $\\ell _{2,1}$ -norms minimization","author":"nie","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1214\/12-STS394"},{"key":"ref31","first-page":"1167","article-title":"An efficient approach to sparse linear discriminant analysis","author":"merchante","year":"2012","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref30","first-page":"199","article-title":"Structured sparse canonical correlation analysis","author":"chen","year":"2012","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref37","first-page":"1380","article-title":"Co-regularized ensemble for feature selection","author":"han","year":"2013","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.398"},{"key":"ref35","first-page":"1589","article-title":"$\\ell _{2,1}$ -norm regularized discriminative feature selection for unsupervised learning","author":"yang","year":"2011","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref34","first-page":"1294","article-title":"Joint feature selection and subspace learning","author":"gu","year":"2011","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref28","first-page":"1612","article-title":"A family of penalty functions for structured sparsity","author":"micchelli","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref27","first-page":"366","article-title":"Structured sparse principal component analysis","author":"jenatton","year":"2010","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref29","first-page":"1","article-title":"A general framework for structured sparsity via proximal optimization","author":"argyriou","year":"2012","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.57"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2001.937679"},{"key":"ref20","first-page":"2504","article-title":"$\\ell _{2,1}$ regularized correntropy for robust feature selection","author":"he","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"article-title":"Pairwise fused lasso","year":"2011","author":"petry","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.93"},{"key":"ref24","first-page":"663","article-title":"Robust subspace segmentation by low-rank representation","author":"liu","year":"2010","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref23","first-page":"2423","article-title":"Sparse semi-supervised learning using conjugate functions","volume":"11","author":"sun","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1561\/2200000015"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995328"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2012.2204435"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2014.2319308"},{"key":"ref59","first-page":"519","article-title":"Efficient subspace segmentation via quadratic programming","author":"wang","year":"2011","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.170"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-008-0178-9"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/11744085_8"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.268"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.92"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.382974"},{"key":"ref52","first-page":"612","article-title":"Linearized alternating direction method with adaptive penalty for low-rank representation","author":"lin","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref10","first-page":"461","article-title":"Efficient dense subspace clustering","author":"ji","year":"2014","journal-title":"Proc IEEE Winter Conf Appl Comput Vis"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.482"},{"key":"ref40","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1109\/TPAMI.2013.102","article-title":"Half-quadratic-based iterative minimization for robust sparse representation","volume":"36","author":"he","year":"2014","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.484"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2013.2253123"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.440"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.114"},{"key":"ref16","first-page":"2744","article-title":"Probabilistic low-rank subspace clustering","author":"babacan","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1199"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2286106"},{"key":"ref19","first-page":"1","article-title":"Noisy sparse subspace clustering","author":"wang","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206547"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2006.882016"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.88"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.191"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995365"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126422"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.896065"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33786-4_26"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.3724\/SP.J.1001.2012.03977"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023709501986"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/34.982897"},{"key":"ref47","doi-asserted-by":"crossref","first-page":"1561","DOI":"10.1109\/TPAMI.2010.220","article-title":"Maximum correntropy criterion for robust face recognition","volume":"33","author":"he","year":"2011","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/83.551699"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/34.120331"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553526"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.76"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/7745987\/07342943.pdf?arnumber=7342943","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T02:34:32Z","timestamp":1633919672000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7342943\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":59,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2015.2500600","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"type":"print","value":"2162-237X"},{"type":"electronic","value":"2162-2388"}],"subject":[],"published":{"date-parts":[[2016,12]]}}}