{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:24:18Z","timestamp":1740169458941,"version":"3.37.3"},"reference-count":61,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003621","name":"Ministry of Science, ICT and Future Planning","doi-asserted-by":"publisher","award":["2017-0-00306"],"award-info":[{"award-number":["2017-0-00306"]}],"id":[{"id":"10.13039\/501100003621","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003621","name":"Ministry of Science, ICT and Future Planning","doi-asserted-by":"publisher","award":["NRF-2017R1C1B2012277"],"award-info":[{"award-number":["NRF-2017R1C1B2012277"]}],"id":[{"id":"10.13039\/501100003621","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1109\/tcyb.2018.2878069","type":"journal-article","created":{"date-parts":[[2018,11,8]],"date-time":"2018-11-08T19:41:59Z","timestamp":1541706119000},"page":"1023-1036","source":"Crossref","is-referenced-by-count":1,"title":["Nonparametric Estimation of Probabilistic Membership for Subspace Clustering"],"prefix":"10.1109","volume":"50","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8073-3321","authenticated-orcid":false,"given":"Jieun","family":"Lee","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9264-9135","authenticated-orcid":false,"given":"Hyeogjin","family":"Lee","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4941-4311","authenticated-orcid":false,"given":"Minsik","family":"Lee","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1792-0327","authenticated-orcid":false,"given":"Nojun","family":"Kwak","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.185"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2462360"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2500821"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.482"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2286106"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.35"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2536752"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.426"},{"key":"ref35","first-page":"277","article-title":"Structured sparse subspace clustering: A unified optimization framework","author":"li","year":"2015","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref34","first-page":"3547","article-title":"Robust subspace segmentation by simultaneously learning data representations and their affinity matrix","author":"guo","year":"2015","journal-title":"Proc 24th Int Conf Artif Intell"},{"key":"ref60","first-page":"437","article-title":"A public domain dataset for human activity recognition using smartphones","author":"anguita","year":"2013","journal-title":"Proc Eur Symp Artif Neural Netw"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"ref28","first-page":"320","article-title":"Noisy sparse subspace clustering","volume":"17","author":"wang","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref27","first-page":"89","article-title":"Noisy sparse subspace clustering","author":"wang","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref29","first-page":"64","article-title":"Provable subspace clustering: When LRR meets SSC","author":"wang","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.200"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126528"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298773"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2010.64"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974409"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2013.08.006"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995365"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126422"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33786-4_26"},{"key":"ref50","article-title":"Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application","author":"wang","year":"2013","journal-title":"arXiv preprint arXiv 1309 1541"},{"key":"ref51","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate \n$o(1\/k^{2})$","volume":"27","author":"nesterov","year":"1983","journal-title":"Soviet Math Doklady"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/34.291440"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"article-title":"Columbia object image library (COIL-20)","year":"1996","author":"nene","key":"ref57"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.92"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.382974"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2007.09.010"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0701-9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1085"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/358669.358692"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.482"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/11744085_8"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-012-0535-6"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383235"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206547"},{"key":"ref18","first-page":"663","article-title":"Robust subspace segmentation by low-rank representation","author":"liu","year":"2010","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.88"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.57"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2010.939739"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/WVM.1991.212809"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.244"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2001.937679"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008000628999"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1162\/089976699300016728"},{"key":"ref46","first-page":"2213","article-title":"Clustering partially observed graphs via convex optimization","volume":"15","author":"chen","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref45","first-page":"1","article-title":"Clustering using max-norm constrained optimization","author":"jalali","year":"2012","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39140-8_8"},{"key":"ref47","first-page":"1715","article-title":"Similarity-based clustering by left-stochastic matrix factorization","volume":"14","author":"arora","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref42","first-page":"1925","article-title":"Deep subspace clustering with sparsity prior","author":"peng","year":"2016","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298657"},{"key":"ref44","first-page":"526","article-title":"Correlation clustering: Maximizing agreements via semidefinite programming","author":"swamy","year":"2004","journal-title":"Proc ACM-SIAM Symp Discr Algorithms"},{"key":"ref43","first-page":"23","article-title":"Deep subspace clustering networks","author":"ji","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/8964604\/08527636.pdf?arnumber=8527636","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:21:06Z","timestamp":1651080066000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8527636\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3]]},"references-count":61,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2018.2878069","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"type":"print","value":"2168-2267"},{"type":"electronic","value":"2168-2275"}],"subject":[],"published":{"date-parts":[[2020,3]]}}}