{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T00:04:16Z","timestamp":1756771456055,"version":"3.44.0"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"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,11]]},"DOI":"10.1109\/ieeeconf44664.2019.9048904","type":"proceedings-article","created":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T01:10:33Z","timestamp":1585617033000},"page":"51-55","source":"Crossref","is-referenced-by-count":3,"title":["An Efficient Algorithm for Graph Laplacian Optimization Based on Effective Resistances"],"prefix":"10.1109","author":[{"given":"Eduardo","family":"Pavez","sequence":"first","affiliation":[{"name":"University of Southern California,Los Angeles,California,USA"}]},{"given":"Antonio","family":"Ortega","sequence":"additional","affiliation":[{"name":"University of Southern California,Los Angeles,California,USA"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1177\/0278364906065387"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1177\/0278364918823086"},{"key":"ref12","first-page":"1","article-title":"Maximizing the number of spanning trees in a connected graph","author":"li","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2602809"},{"key":"ref14","article-title":"How to learn a graph from smooth signals","volume":"13","author":"kalofolias","year":"2016","journal-title":"th International Conference on Artificial Intelligence and Statistics AISTATS"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553400"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2018.8461603"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2017.2726975"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/kxm045"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.2307\/2528966"},{"key":"ref28","first-page":"396","article-title":"Handwritten digit recognition with a back-propagation network","author":"lecun","year":"1990","journal-title":"In Advances in Neural Information Processing Systems"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2820126"},{"key":"ref27","first-page":"1632","article-title":"Coordinate descent converges faster with the gauss-southwell rule than random selection","author":"nutini","year":"2015","journal-title":"International Conference on Machine Learning"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1201\/9780203492024"},{"key":"ref6","article-title":"Designing robust air transportation networks via minimizing total effective resistance","author":"yang","year":"2018","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"key":"ref29","article-title":"Graph construction from data using non negative kernel regression (NNK graphs)","author":"shekkizhar","year":"2019","journal-title":"arXivpreprint arXiv 1910 09383"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/050645452"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2005.1470239"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2006.377282"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2812298"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2004.834113"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1021\/cr0780006"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2011.02.024"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2925602"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7798973"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1109\/DSW.2018.8439909","article-title":"On learning laplacians of tree structured graphs","author":"lu","year":"2018","journal-title":"Proc 2018 IEEE Data Science Workshop (DSW)"},{"key":"ref23","first-page":"1","article-title":"Graph learning from filtered signals: Graph system and diffusion kernel identification","author":"egilmez","year":"2018","journal-title":"IEEE Transactions on Signal and Information Processing over Networks"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1561\/2400000006"},{"key":"ref25","article-title":"Estimation of graph laplacian and covariance matrices","volume":"12","author":"pavez","year":"2019","journal-title":"Ph D thesis"}],"event":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","start":{"date-parts":[[2019,11,3]]},"location":"Pacific Grove, CA, USA","end":{"date-parts":[[2019,11,6]]}},"container-title":["2019 53rd Asilomar Conference on Signals, Systems, and Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9034466\/9048648\/09048904.pdf?arnumber=9048904","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T19:26:48Z","timestamp":1756754808000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9048904\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/ieeeconf44664.2019.9048904","relation":{},"subject":[],"published":{"date-parts":[[2019,11]]}}}