{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T17:54:58Z","timestamp":1757613298714,"version":"3.44.0"},"reference-count":24,"publisher":"IEEE","license":[{"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.8683424","type":"proceedings-article","created":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T16:01:56Z","timestamp":1555516916000},"page":"3542-3546","source":"Crossref","is-referenced-by-count":5,"title":["Common Randomized Shortest Paths (C-RSP): A Simple Yet Effective Framework for Multi-view Graph Embedding"],"prefix":"10.1109","author":[{"given":"Anuththari","family":"Gamage","sequence":"first","affiliation":[{"name":"Department of ECE, University of Illinois Urbana-Champaign, Urbana, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brian","family":"Rappaport","sequence":"additional","affiliation":[{"name":"School of ECE, Cornell University, Ithaca, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuchin","family":"Aeron","sequence":"additional","affiliation":[{"name":"Department of ECE"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaozhe","family":"Hu","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Tufts University, Medford, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s11192-011-0348-3"},{"key":"ref11","first-page":"899","article-title":"Do more views of a graph helpƒ Community detection and clustering in multi-graphs","author":"papalexakis","year":"2013","journal-title":"Proceedings of the International Conference on Information Fusion"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2295553"},{"key":"ref13","first-page":"1413","article-title":"Co-regularized multi-view spectral clustering","author":"kumar","year":"2011","journal-title":"Proceedings of the 24th International Conference on Neural Information Processing Systems"},{"key":"ref14","first-page":"393","article-title":"A co-training approach for multi-view spectral clustering","author":"kumar","year":"2011","journal-title":"Proceedings of the 28th International Conference on International Conference on Machine Learning"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.02.015"},{"key":"ref16","first-page":"1751","article-title":"Hitting and commute times in large random neighborhood graphs","volume":"15","author":"luxburg","year":"2014","journal-title":"Journal of Machine Learning Research"},{"key":"ref17","first-page":"1","article-title":"Random walks on graphs: A survey","volume":"2","author":"lov\u00e1sz","year":"1993","journal-title":"Combinatorics Paul Erdos Is Eighty"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"article-title":"Hitting and commute times in large graphs are often misleading","year":"2010","author":"luxburg","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.coisb.2018.01.003"},{"key":"ref3","first-page":"325","article-title":"A review on machine learning principles for multi-view biological data integration","volume":"19","author":"li","year":"2018","journal-title":"Briefings in Bioinformatics"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-009-0233-1"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.114"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1214\/16-EJS1211"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.125"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939814"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2464464.2464471"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972832.28"},{"key":"ref20","first-page":"3429","article-title":"From random walks to distances on unweighted graphs","author":"hashimoto","year":"2015","journal-title":"Proceedings of the 28th International Conference on Neural Information Processing Systems - Volume 2"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2013.09.016"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401984"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.47"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90021-7"}],"event":{"name":"ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2019,5,12]]},"location":"Brighton, UK","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\/08683424.pdf?arnumber=8683424","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T18:19:27Z","timestamp":1757009967000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8683424\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/icassp.2019.8683424","relation":{},"subject":[],"published":{"date-parts":[[2019,5]]}}}