{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:02Z","timestamp":1750220282288,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,2,11]],"date-time":"2022-02-11T00:00:00Z","timestamp":1644537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation","award":["CCF-2021309","CCF-2011412","CF-2041519"],"award-info":[{"award-number":["CCF-2021309","CCF-2011412","CF-2041519"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,2,11]]},"DOI":"10.1145\/3488560.3498480","type":"proceedings-article","created":{"date-parts":[[2022,2,15]],"date-time":"2022-02-15T21:42:57Z","timestamp":1644961377000},"page":"1099-1108","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Scalable Graph Topology Learning via Spectral Densification"],"prefix":"10.1145","author":[{"given":"Yongyu","family":"Wang","sequence":"first","affiliation":[{"name":"Michigan Technological University, Houghton, MI, USA"}]},{"given":"Zhiqiang","family":"Zhao","sequence":"additional","affiliation":[{"name":"Stevens Institute of Technology, Hoboken, NJ, USA"}]},{"given":"Zhuo","family":"Feng","sequence":"additional","affiliation":[{"name":"Stevens Institute of Technology, Hoboken, NJ, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,2,15]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1162\/089976603321780317"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.88"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2602809"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2018.2887284"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2017.2726975"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/kxm045"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553432"},{"key":"e_1_3_2_2_9_1","first-page":"920","volume-title":"Artificial Intelligence and Statistics","author":"Kalofolias V.","year":"2016","unstructured":"V. Kalofolias. How to learn a graph from smooth signals. In Artificial Intelligence and Statistics, pages 920--929, 2016."},{"key":"e_1_3_2_2_10_1","volume-title":"International Conference on Learning Representations (ICLR 2019)","author":"Kalofolias V.","year":"2019","unstructured":"V. Kalofolias and N. Perraudin. Large scale graph learning from smooth signals. International Conference on Learning Representations (ICLR 2019), 2019."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.29"},{"key":"e_1_3_2_2_12_1","first-page":"11651","volume-title":"Advances in Neural Information Processing Systems","author":"Kumar S.","year":"2019","unstructured":"S. Kumar, J. Ying, J. V. de Miranda Cardoso, and D. Palomar. Structured graph learning via laplacian spectral constraints. In Advances in Neural Information Processing Systems, pages 11651--11663, 2019."},{"key":"e_1_3_2_2_13_1","volume-title":"Discovering structure by learning sparse graphs","author":"Lake B.","year":"2010","unstructured":"B. Lake and J. Tenenbaum. Discovering structure by learning sparse graphs. 2010."},{"key":"e_1_3_2_2_14_1","volume-title":"Clustering with t-sne, provably. arXiv e-print, arXiv:1706.02582","author":"Linderman G. C.","year":"2017","unstructured":"G. C. Linderman and S. Steinerberger. Clustering with t-sne, provably. arXiv e-print, arXiv:1706.02582, 2017."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/344"},{"key":"e_1_3_2_2_16_1","volume-title":"v. d. Maaten and G. Hinton. Visualizing Data using t-SNE. Journal of machine learning research, 9(Nov):2579--2605","author":"L.","year":"2008","unstructured":"L. v. d. Maaten and G. Hinton. Visualizing Data using t-SNE. Journal of machine learning research, 9(Nov):2579--2605, 2008."},{"key":"e_1_3_2_2_17_1","first-page":"1025","volume-title":"Advances in neural information processing systems","author":"Maier M.","year":"2009","unstructured":"M. Maier, U. V. Luxburg, and M. Hein. Influence of graph construction on graph-based clustering measures. In Advances in neural information processing systems, pages 1025--1032, 2009."},{"key":"e_1_3_2_2_18_1","volume-title":"Fast approximate nearest neighbors with automatic algorithm configuration. VISAPP (1), 2(331--340):2","author":"Muja M.","year":"2009","unstructured":"M. Muja and D. G. Lowe. Fast approximate nearest neighbors with automatic algorithm configuration. VISAPP (1), 2(331--340):2, 2009."},{"issue":"2","key":"e_1_3_2_2_19_1","first-page":"849","article-title":"On spectral clustering: Analysis and an algorithm","volume":"14","author":"Ng A. Y.","year":"2001","unstructured":"A. Y. Ng, M. I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. NIPS, 14(2):849--856, 2001.","journal-title":"NIPS"},{"key":"e_1_3_2_2_20_1","volume-title":"Combinatorial optimization: algorithms and complexity","author":"Papadimitrou C. H.","year":"1982","unstructured":"C. H. Papadimitrou and K. Steiglitz. Combinatorial optimization: algorithms and complexity. 1982."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.209"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2017.7953415"},{"key":"e_1_3_2_2_23_1","volume-title":"Nonlinear dimensionality reduction by locally linear embedding. science, 290(5500):2323--2326","author":"Roweis S. T.","year":"2000","unstructured":"S. T. Roweis and L. K. Saul. Nonlinear dimensionality reduction by locally linear embedding. science, 290(5500):2323--2326, 2000."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2014.04.020"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/080734029"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/090771430"},{"key":"e_1_3_2_2_28_1","volume-title":"Cluster ensembles--a knowledge reuse framework for combining multiple partitions. Journal of machine learning research, 3(Dec):583--617","author":"Strehl A.","year":"2002","unstructured":"A. Strehl and J. Ghosh. Cluster ensembles--a knowledge reuse framework for combining multiple partitions. Journal of machine learning research, 3(Dec):583--617, 2002."},{"key":"e_1_3_2_2_29_1","volume-title":"A global geometric framework for nonlinear dimensionality reduction. science, 290(5500):2319--2323","author":"Tenenbaum J. B.","year":"2000","unstructured":"J. B. Tenenbaum, V. De Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. science, 290(5500):2319--2323, 2000."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627435.2697068"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"e_1_3_2_2_32_1","volume-title":"Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms","author":"Xiao H.","year":"2017","unstructured":"H. Xiao, K. Rasul, and R. Vollgraf. Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms, 2017."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441767"}],"event":{"name":"WSDM '22: The Fifteenth ACM International Conference on Web Search and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Virtual Event AZ USA","acronym":"WSDM '22"},"container-title":["Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488560.3498480","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3488560.3498480","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:19Z","timestamp":1750188679000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488560.3498480"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,11]]},"references-count":32,"alternative-id":["10.1145\/3488560.3498480","10.1145\/3488560"],"URL":"https:\/\/doi.org\/10.1145\/3488560.3498480","relation":{},"subject":[],"published":{"date-parts":[[2022,2,11]]},"assertion":[{"value":"2022-02-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}