{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T19:20:04Z","timestamp":1776885604546,"version":"3.51.2"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Pratiskha Trust Young Investigator","award":["SRG\/2019\/000619"],"award-info":[{"award-number":["SRG\/2019\/000619"]}]},{"name":"IEEE International Conference on Acoustics, Speech and Signal Processing, Barcelona, Spain"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tsp.2021.3115947","type":"journal-article","created":{"date-parts":[[2021,10,2]],"date-time":"2021-10-02T01:13:27Z","timestamp":1633137207000},"page":"5665-5680","source":"Crossref","is-referenced-by-count":15,"title":["Product Graph Learning From Multi-Domain Data With Sparsity and Rank Constraints"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8940-3284","authenticated-orcid":false,"given":"Sai Kiran","family":"Kadambari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0429-6588","authenticated-orcid":false,"given":"Sundeep Prabhakar","family":"Chepuri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(91)90332-Q"},{"key":"ref10","first-page":"920","article-title":"How to learn a graph from smooth signals","author":"kalofolias","year":"0","journal-title":"Proc Artif Intell Statist"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2017.2726975"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2018.2887284"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2018.2890143"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2018.8461484"},{"key":"ref15","article-title":"Structured graph learning via Laplacian spectral constraints","author":"kumar","year":"0","journal-title":"Proc Advs Neural Inf Proc Sys"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2804318"},{"key":"ref17","first-page":"778","article-title":"Discovering structure by learning sparse graphs","author":"lake","year":"0","journal-title":"Proc 32nd Annu Meeting Cogn Sci Soc"},{"key":"ref18","article-title":"The constrained Laplacian rank algorithm for graph-based clustering","author":"nie","year":"0","journal-title":"Proc 13th AAAI Conf Artif Intell"},{"key":"ref19","article-title":"Matrix completion on graphs","author":"kalofolias","year":"2014"},{"key":"ref28","article-title":"An introduction to locally linear embedding","author":"saul","year":"0"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2469645"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-21606-5"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2235192"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2017.2731161"},{"key":"ref29","article-title":"Central control room for air quality management, India","year":"0"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2914879"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2602809"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2329213"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2017.7953410"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9054679"},{"key":"ref20","article-title":"Columbia object image library: COIL-20","author":"nane","year":"1996"},{"key":"ref22","article-title":"Learning product graphs underlying smooth graph signals","author":"lodhi","year":"2020"},{"key":"ref21","first-page":"1229","article-title":"The bigraphical lasso","volume":"28","author":"kalaitzis","year":"2013","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref24","author":"horn","year":"1994","journal-title":"Topics in Matrix Analysis"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/132"},{"key":"ref26","first-page":"849","article-title":"On spectral clustering: Analysis and an algorithm","author":"ng","year":"0","journal-title":"Proc Adv Neural Inf Proc Syst"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1201\/b11644-19"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/9307529\/09556561.pdf?arnumber=9556561","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:50:42Z","timestamp":1652194242000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9556561\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/tsp.2021.3115947","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}