{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T19:15:50Z","timestamp":1776971750889,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":54,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,3,8]],"date-time":"2021-03-08T00:00:00Z","timestamp":1615161600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["1350206, 1618364, 1909105"],"award-info":[{"award-number":["1350206, 1618364, 1909105"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,3,8]]},"DOI":"10.1145\/3437963.3441767","type":"proceedings-article","created":{"date-parts":[[2021,3,6]],"date-time":"2021-03-06T04:36:17Z","timestamp":1615005377000},"page":"869-877","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Towards Scalable Spectral Embedding and Data Visualization via Spectral Coarsening"],"prefix":"10.1145","author":[{"given":"Zhiqiang","family":"Zhao","sequence":"first","affiliation":[{"name":"Stevens Institute of Technology, Hoboken, NJ, USA"}]},{"given":"Ying","family":"Zhang","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":[[2021,3,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6170-8_23"},{"key":"e_1_3_2_1_2_1","volume-title":"10th DIMACS Implementation Challenge Workshop","author":"Bader D. A.","year":"2012","unstructured":"D. A. Bader , H. Meyerhenke , P. Sanders , and D. Wagner . Graph partitioning and graph clustering . In 10th DIMACS Implementation Challenge Workshop , 2012 . D. A. Bader, H. Meyerhenke, P. Sanders, and D. Wagner. Graph partitioning and graph clustering. In 10th DIMACS Implementation Challenge Workshop, 2012."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/090772873"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/237814.237827","volume-title":"Proceedings of the twenty-eighth annual ACM symposium on Theory of computing","author":"Bencz\u00far A. A.","year":"1996","unstructured":"A. A. Bencz\u00far and D. R. Karger . Approximating st minimum cuts in o (n 2) time . In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing , pages 47 -- 55 . ACM, 1996 . A. A. Bencz\u00far and D. R. Karger. Approximating st minimum cuts in o (n 2) time. In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pages 47--55. ACM, 1996."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/070705970"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/090775087"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993674"},{"key":"e_1_3_2_1_8_1","volume-title":"The university of florida sparse matrix collection. ACM Trans. on Math. Soft. (TOMS), 38(1):1","author":"Davis T.","year":"2011","unstructured":"T. Davis and Y. Hu . The university of florida sparse matrix collection. ACM Trans. on Math. Soft. (TOMS), 38(1):1 , 2011 . T. Davis and Y. Hu. The university of florida sparse matrix collection. ACM Trans. on Math. Soft. (TOMS), 38(1):1, 2011."},{"key":"e_1_3_2_1_9_1","first-page":"3844","volume-title":"Advances in Neural Information Processing Systems","author":"Defferrard M.","year":"2016","unstructured":"M. Defferrard , X. Bresson , and P. Vandergheynst . Convolutional neural networks on graphs with fast localized spectral filtering . In Advances in Neural Information Processing Systems , pages 3844 -- 3852 , 2016 . M. Defferrard, X. Bresson, and P. Vandergheynst. Convolutional neural networks on graphs with fast localized spectral filtering. In Advances in Neural Information Processing Systems, pages 3844--3852, 2016."},{"key":"e_1_3_2_1_10_1","volume-title":"Weighted graph cuts without eigenvectors a multilevel approach","author":"Dhillon I. S.","year":"1944","unstructured":"I. S. Dhillon , Y. Guan , and B. Kulis . Weighted graph cuts without eigenvectors a multilevel approach . IEEE transactions on pattern analysis and machine intelligence, 29(11): 1944 --1957, 2007. I. S. Dhillon, Y. Guan, and B. Kulis. Weighted graph cuts without eigenvectors a multilevel approach. IEEE transactions on pattern analysis and machine intelligence, 29(11):1944--1957, 2007."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2012.2215780"},{"key":"e_1_3_2_1_12_1","volume-title":"Approximating k-spanner problems for k&gt","author":"Elkin M.","year":"2005","unstructured":"M. Elkin and D. Peleg . Approximating k-spanner problems for k&gt ; 2. Theoretical Computer Science , 337(1--3):249--277, 2005 . M. Elkin and D. Peleg. Approximating k-spanner problems for k> 2. Theoretical Computer Science, 337(1--3):249--277, 2005."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897937.2898094"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.2018.8465798"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993647"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/345513.345353"},{"key":"e_1_3_2_1_17_1","first-page":"7736","volume-title":"Advances in Neural Information Processing Systems","author":"Hermsdorff G. B.","year":"2019","unstructured":"G. B. Hermsdorff and L. Gunderson . A unifying framework for spectrum-preserving graph sparsification and coarsening . In Advances in Neural Information Processing Systems , pages 7736 -- 7747 , 2019 . G. B. Hermsdorff and L. Gunderson. A unifying framework for spectrum-preserving graph sparsification and coarsening. In Advances in Neural Information Processing Systems, pages 7736--7747, 2019."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1038\/35075138"},{"key":"e_1_3_2_1_19_1","volume-title":"Metis--unstructured graph partitioning and sparse matrix ordering system, version 2.0","author":"Karypis G.","year":"1995","unstructured":"G. Karypis and V. Kumar . Metis--unstructured graph partitioning and sparse matrix ordering system, version 2.0 . 1995 . G. Karypis and V. Kumar. Metis--unstructured graph partitioning and sparse matrix ordering system, version 2.0. 1995."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2010.940003"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756869.1756936"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.29"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055477"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00044"},{"key":"e_1_3_2_1_26_1","volume-title":"Mile: A multi-level framework for scalable graph embedding. arXiv preprint arXiv:1802.09612","author":"Liang J.","year":"2018","unstructured":"J. Liang , S. Gurukar , and S. Parthasarathy . Mile: A multi-level framework for scalable graph embedding. arXiv preprint arXiv:1802.09612 , 2018 . J. Liang, S. Gurukar, and S. Parthasarathy. Mile: A multi-level framework for scalable graph embedding. arXiv preprint arXiv:1802.09612, 2018."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1216134"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/110843563"},{"issue":"116","key":"e_1_3_2_1_29_1","first-page":"1","article-title":"Graph reduction with spectral and cut guarantees","volume":"20","author":"Loukas A.","year":"2019","unstructured":"A. Loukas . Graph reduction with spectral and cut guarantees . Journal of Machine Learning Research , 20 ( 116 ): 1 -- 42 , 2019 . A. Loukas. Graph reduction with spectral and cut guarantees. Journal of Machine Learning Research, 20(116):1--42, 2019.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_30_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 . 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_1_31_1","volume-title":"Graph spanners. Journal of graph theory, 13(1):99--116","author":"Peleg D.","year":"1989","unstructured":"D. Peleg and A. A. Sch\"affer. Graph spanners. Journal of graph theory, 13(1):99--116 , 1989 . D. Peleg and A. A. Sch\"affer. Graph spanners. Journal of graph theory, 13(1):99--116, 1989."},{"key":"e_1_3_2_1_32_1","first-page":"1423","volume-title":"Proceedings of The 28th Conference on Learning Theory (COLT)","author":"Peng R.","year":"2015","unstructured":"R. Peng , H. Sun , and L. Zanetti . Partitioning well-clustered graphs: Spectral clustering works . In Proceedings of The 28th Conference on Learning Theory (COLT) , pages 1423 -- 1455 , 2015 . R. Peng, H. Sun, and L. Zanetti. Partitioning well-clustered graphs: Spectral clustering works. In Proceedings of The 28th Conference on Learning Theory (COLT), pages 1423--1455, 2015."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.4203\/ccp.45.3.1"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623701"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Y. Saad. Iterative methods for sparse linear systems volume 82. siam 2003. Y. Saad. Iterative methods for sparse linear systems volume 82. siam 2003.","DOI":"10.1137\/1.9780898718003"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989399"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2512529"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2235192"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/090771430"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/080734029"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/08074489X"},{"key":"e_1_3_2_1_43_1","volume-title":"A note on preconditioning by low-stretch spanning trees. arXiv preprint arXiv:0903.2816","author":"Spielman D. A.","year":"2009","unstructured":"D. A. Spielman and J. Woo . A note on preconditioning by low-stretch spanning trees. arXiv preprint arXiv:0903.2816 , 2009 . D. A. Spielman and J. Woo. A note on preconditioning by low-stretch spanning trees. arXiv preprint arXiv:0903.2816, 2009."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883041"},{"key":"e_1_3_2_1_45_1","volume-title":"Scalable algorithms for data and network analysis. Foundations and Trends\u00ae in Theoretical Computer Science, 12(1--2):1--274","author":"Teng S.-H.","year":"2016","unstructured":"S.-H. Teng . Scalable algorithms for data and network analysis. Foundations and Trends\u00ae in Theoretical Computer Science, 12(1--2):1--274 , 2016 . S.-H. Teng. Scalable algorithms for data and network analysis. Foundations and Trends\u00ae in Theoretical Computer Science, 12(1--2):1--274, 2016."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/192161.192241"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627435.2697068"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"e_1_3_2_1_49_1","first-page":"171","volume-title":"International Symposium on Graph Drawing","author":"Walshaw C.","year":"2000","unstructured":"C. Walshaw . A multilevel algorithm for force-directed graph drawing . In International Symposium on Graph Drawing , pages 171 -- 182 . Springer , 2000 . C. Walshaw. A multilevel algorithm for force-directed graph drawing. In International Symposium on Graph Drawing, pages 171--182. Springer, 2000."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816682"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3061639.3062193"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3317809"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.5555\/3199700.3199780"},{"key":"e_1_3_2_1_54_1","volume-title":"Nearly-linear time spectral graph reduction for scalable graph partitioning and data visualization. arXiv preprint arXiv:1812.08942","author":"Zhao Z.","year":"2018","unstructured":"Z. Zhao , Y. Wang , and Z. Feng . Nearly-linear time spectral graph reduction for scalable graph partitioning and data visualization. arXiv preprint arXiv:1812.08942 , 2018 . Z. Zhao, Y. Wang, and Z. Feng. Nearly-linear time spectral graph reduction for scalable graph partitioning and data visualization. arXiv preprint arXiv:1812.08942, 2018."}],"event":{"name":"WSDM '21: The Fourteenth ACM International Conference on Web Search and Data Mining","location":"Virtual Event Israel","acronym":"WSDM '21","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"]},"container-title":["Proceedings of the 14th ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437963.3441767","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3437963.3441767","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3437963.3441767","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3437963.3441767","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:35Z","timestamp":1750193255000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437963.3441767"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,8]]},"references-count":54,"alternative-id":["10.1145\/3437963.3441767","10.1145\/3437963"],"URL":"https:\/\/doi.org\/10.1145\/3437963.3441767","relation":{},"subject":[],"published":{"date-parts":[[2021,3,8]]},"assertion":[{"value":"2021-03-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}