{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T09:08:19Z","timestamp":1754557699879,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"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":[],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1109\/icassp.2019.8682439","type":"proceedings-article","created":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T16:01:56Z","timestamp":1555516916000},"page":"3572-3576","source":"Crossref","is-referenced-by-count":4,"title":["Joint Structured Graph Learning and Unsupervised Feature Selection"],"prefix":"10.1109","author":[{"given":"Yong","family":"Peng","sequence":"first","affiliation":[]},{"given":"Leijie","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Wanzeng","family":"Kong","sequence":"additional","affiliation":[]},{"given":"Feiping","family":"Nie","sequence":"additional","affiliation":[]},{"given":"Andrzej","family":"Cichocki","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2521602"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2016.2605132"},{"key":"ref12","first-page":"1969","article-title":"The constrained Laplacian rank algorithm for graph-based clustering","author":"nie","year":"2016","journal-title":"AAAI Conference on Artificial Intelligence"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.35.11.652"},{"key":"ref14","first-page":"1813","article-title":"Efficient and robust feature selection via joint ?2,1-norms minimization","author":"nie","year":"2010","journal-title":"Advances in neural information processing systems"},{"key":"ref15","first-page":"1589","article-title":"?2,1-norm regularized discriminative feature selection for unsupervised learning","volume":"22","author":"yang","year":"2011","journal-title":"International Joint Conference on Artificial Intelligence"},{"key":"ref16","first-page":"1026","article-title":"Unsupervised feature selection using nonnegative spectral analysis","volume":"2","author":"li","year":"2012","journal-title":"AAAI Conference on Artificial Intelligence"},{"key":"ref17","first-page":"3569","article-title":"A new simplex sparse learning model to measure data similarity for clustering","author":"huang","year":"2015","journal-title":"International Joint Conference on Artificial Intelligence"},{"key":"ref18","first-page":"556","article-title":"Algorithms for non-negative matrix factorization","author":"lee","year":"2001","journal-title":"Advances in neural information processing systems"},{"key":"ref19","first-page":"507","article-title":"Laplacian score for feature selection","author":"he","year":"2005","journal-title":"Advances in neural information processing systems"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2009.2038764"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2044470"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972832.89"},{"key":"ref5","first-page":"2328","article-title":"Non-negative low rank and sparse graph for semi-supervised learning","author":"zhuang","year":"2012","journal-title":"IEEE Conference on Computer Vision and Pattern Recognition"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2493537"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2015.01.001"},{"key":"ref2","first-page":"1157","article-title":"An introduction to variable and feature selection","volume":"3","author":"guyon","year":"2003","journal-title":"Journal of Machine Learning Research"},{"key":"ref1","volume":"454","author":"liu","year":"2012","journal-title":"Feature Selection for Knowledge Discovery and Data Mining"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2017.01.016"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835848"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2272642"},{"key":"ref21","first-page":"1294","article-title":"Joint feature selection and subspace learning","author":"gu","year":"2011","journal-title":"International Joint Conference on Artificial Intelligence"}],"event":{"name":"ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2019,5,12]]},"location":"Brighton, United Kingdom","end":{"date-parts":[[2019,5,17]]}},"container-title":["ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8671773\/8682151\/08682439.pdf?arnumber=8682439","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,14]],"date-time":"2022-07-14T23:07:30Z","timestamp":1657840050000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8682439\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/icassp.2019.8682439","relation":{},"subject":[],"published":{"date-parts":[[2019,5]]}}}