{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T04:49:27Z","timestamp":1743742167481},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/tkde.2019.2948850","type":"journal-article","created":{"date-parts":[[2019,10,23]],"date-time":"2019-10-23T20:28:27Z","timestamp":1571862507000},"page":"1-1","source":"Crossref","is-referenced-by-count":5,"title":["Structured Graph Reconstruction for Scalable Clustering"],"prefix":"10.1109","author":[{"given":"Junwei","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feiping","family":"Nie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuelong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000027785.44527.d6"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.198"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2606098"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972757.70"},{"key":"ref31","first-page":"556","article-title":"Algorithms for non-negative matrix factorization","author":"lee","year":"2001","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s00530-015-0450-0"},{"key":"ref37","first-page":"362","article-title":"The relationships among various nonnegative matrix factorization methods for clustering","author":"li","year":"2006","journal-title":"Proc IEEE Int Conf Data Mining"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.10"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"1921","DOI":"10.1109\/TIP.2010.2044958","article-title":"Flexible manifold embedding: A framework for semi-supervised and unsupervised dimension reduction","volume":"19","author":"nie","year":"2010","journal-title":"IEEE Trans Image Process"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"2323","DOI":"10.1126\/science.290.5500.2323","article-title":"Nonlinear dimensionality reduction by locally linear embedding","volume":"290","author":"roweis","year":"2000","journal-title":"Sci"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.88"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.161"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557118"},{"key":"ref12","first-page":"201","article-title":"Spectral clustering for a large data set by reducing the similarity matrix size","author":"shinnou","year":"2008","journal-title":"Proc Int Conf Language Resources Eval"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2358564"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.62"},{"key":"ref15","first-page":"1486","article-title":"Large-scale spectral clustering on graphs","author":"liu","year":"2013","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2003.1238361"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/251"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","article-title":"Graph clustering","volume":"1","author":"schaeffer","year":"2007","journal-title":"Comput Sci Rev"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/43.159993"},{"key":"ref28","first-page":"1969","article-title":"The constrained laplacian rank algorithm for graph-based clustering","author":"nie","year":"2016","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2749125"},{"key":"ref27","first-page":"3569","article-title":"A new simplex sparse learning model to measure data similarity for clustering","author":"huang","year":"2015","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502550"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2763620"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/978-3-642-40935-6_26","article-title":"Fast spectral clustering via the nyström method","author":"choromanska","year":"2013","journal-title":"Algorithmic Learning Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995425"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1262185"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/08074489X"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"ref20","first-page":"849","article-title":"On spectral clustering: Analysis and an algorithm","volume":"2","author":"ng","year":"2002","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.141"},{"key":"ref21","first-page":"1569","article-title":"Doubly stochastic normalization for spectral clustering","author":"zass","year":"2006","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2781424"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2701825"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1029\/2018GL077787"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939805"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939768"},{"key":"ref25","first-page":"679","article-title":"Large graph construction for scalable semi-supervised learning","author":"liu","year":"2010","journal-title":"Proc Int Conf Mach Learn"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/4358933\/08880531.pdf?arnumber=8880531","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:50:48Z","timestamp":1652194248000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8880531\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/tkde.2019.2948850","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}