{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T00:33:07Z","timestamp":1768091587497,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,4,19]],"date-time":"2021-04-19T00:00:00Z","timestamp":1618790400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,4,19]]},"DOI":"10.1145\/3442381.3449887","type":"proceedings-article","created":{"date-parts":[[2021,6,3]],"date-time":"2021-06-03T19:01:20Z","timestamp":1622746880000},"page":"2092-2103","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Strongly Local Hypergraph Diffusions for Clustering and Semi-supervised Learning"],"prefix":"10.1145","author":[{"given":"Meng","family":"Liu","sequence":"first","affiliation":[{"name":"Department of Computer Science, Purdue University, USA"}]},{"given":"Nate","family":"Veldt","sequence":"additional","affiliation":[{"name":"Center for Applied Mathematics, Cornell University, USA"}]},{"given":"Haoyu","family":"Song","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Purdue University, USA"}]},{"given":"Pan","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Purdue University, USA"}]},{"given":"David F.","family":"Gleich","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Purdue University, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,6,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Sameer Agarwal Kristin Branson and Serge Belongie. 2006. Higher Order Learning with Graphs. In ICML. 17\u201324. Sameer Agarwal Kristin Branson and Serge Belongie. 2006. Higher Order Learning with Graphs. In ICML. 17\u201324.","DOI":"10.1145\/1143844.1143847"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Sameer Agarwal Jongwoo Lim Lihi Zelnik-Manor Pietro Perona David Kriegman and Serge Belongie. 2005. Beyond Pairwise Clustering. In CVPR. 838\u2013845. Sameer Agarwal Jongwoo Lim Lihi Zelnik-Manor Pietro Perona David Kriegman and Serge Belongie. 2005. Beyond Pairwise Clustering. In CVPR. 838\u2013845.","DOI":"10.1109\/CVPR.2005.89"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Reid Andersen Fan Chung and Kevin Lang. 2006. Local graph partitioning using pagerank vectors. In FOCS. 475\u2013486. Reid Andersen Fan Chung and Kevin Lang. 2006. Local graph partitioning using pagerank vectors. In FOCS. 475\u2013486.","DOI":"10.1109\/FOCS.2006.44"},{"key":"e_1_3_2_1_4_1","unstructured":"Reid Andersen and Kevin\u00a0J. Lang. 2008. An Algorithm for Improving Graph Partitions. In SODA. 651\u2013660. Reid Andersen and Kevin\u00a0J. Lang. 2008. An Algorithm for Improving Graph Partitions. In SODA. 651\u2013660."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.aad9029"},{"key":"e_1_3_2_1_6_1","unstructured":"Austin\u00a0R Benson Jon Kleinberg and Nate Veldt. 2020. Augmented Sparsifiers for Generalized Hypergraph Cuts. arXiv preprint arXiv:2007.08075(2020). Austin\u00a0R Benson Jon Kleinberg and Nate Veldt. 2020. Augmented Sparsifiers for Generalized Hypergraph Cuts. arXiv preprint arXiv:2007.08075(2020)."},{"key":"e_1_3_2_1_7_1","unstructured":"Avrim Blum and Shuchi Chawla. 2001. Learning from Labeled and Unlabeled Data Using Graph Mincuts. In ICML. 19\u201326. Avrim Blum and Shuchi Chawla. 2001. Learning from Labeled and Unlabeled Data Using Graph Mincuts. In ICML. 19\u201326."},{"key":"e_1_3_2_1_8_1","unstructured":"Uthsav Chitra and Benjamin\u00a0J. Raphael. 2019. Random Walks on Hypergraphs with Edge-Dependent Vertex Weights. In ICML. 1172\u20131181. Uthsav Chitra and Benjamin\u00a0J. Raphael. 2019. Random Walks on Hypergraphs with Edge-Dependent Vertex Weights. In ICML. 1172\u20131181."},{"key":"e_1_3_2_1_9_1","volume-title":"Spectral Graph Theory","author":"Chung Fan","unstructured":"Fan R.\u00a0L. Chung . 1992. Spectral Graph Theory . American Mathematical Society . Fan R.\u00a0L. Chung. 1992. Spectral Graph Theory. American Mathematical Society."},{"key":"e_1_3_2_1_10_1","volume-title":"Networks: Reducing Bias from Interference. J. Causal Inference 5(2017).","author":"Eckles D.","year":"2017","unstructured":"D. Eckles , B. Karrer , and J. Ugander . 2017 . Design and Analysis of Experiments in Networks: Reducing Bias from Interference. J. Causal Inference 5(2017). D. Eckles, B. Karrer, and J. Ugander. 2017. Design and Analysis of Experiments in Networks: Reducing Bias from Interference. J. Causal Inference 5(2017)."},{"key":"e_1_3_2_1_11_1","volume-title":"Flow-based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance. arXiv cs.LG(2020)","author":"Fountoulakis K.","year":"2004","unstructured":"K. Fountoulakis , M. Liu , D.\u00a0 F. Gleich , and M.\u00a0 W. Mahoney . 2020. Flow-based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance. arXiv cs.LG(2020) , 2004 .09608. K. Fountoulakis, M. Liu, D.\u00a0F. Gleich, and M.\u00a0W. Mahoney. 2020. Flow-based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance. arXiv cs.LG(2020), 2004.09608."},{"key":"e_1_3_2_1_12_1","unstructured":"David Gleich and Michael Mahoney. 2014. Anti-differentiating approximation algorithms: A case study with min-cuts spectral and flow. In ICML. 1018\u20131025. David Gleich and Michael Mahoney. 2014. Anti-differentiating approximation algorithms: A case study with min-cuts spectral and flow. In ICML. 1018\u20131025."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"David\u00a0F. Gleich and Michael\u00a0W. Mahoney. 2015. Using Local Spectral Methods to Robustify Graph-Based Learning Algorithms. In SIGKDD. 359\u2013368. David\u00a0F. Gleich and Michael\u00a0W. Mahoney. 2015. Using Local Spectral Methods to Robustify Graph-Based Learning Algorithms. In SIGKDD. 359\u2013368.","DOI":"10.1145\/2783258.2783376"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(93)E0166-V"},{"key":"e_1_3_2_1_15_1","unstructured":"M. Hein S. Setzer L. Jost and S.\u00a0S. Rangapuram. 2013. The Total Variation on Hypergraphs - Learning on Hypergraphs Revisited. In NeurIPS. 2427\u20132435. M. Hein S. Setzer L. Jost and S.\u00a0S. Rangapuram. 2013. The Total Variation on Hypergraphs - Learning on Hypergraphs Revisited. In NeurIPS. 2427\u20132435."},{"key":"e_1_3_2_1_16_1","volume-title":"Nonlinear Diffusion for Community Detection and Semi-Supervised Learning. In The World Wide Web Conference","author":"Ibrahim Rania","year":"2019","unstructured":"Rania Ibrahim and David\u00a0 F. Gleich . 2019 . Nonlinear Diffusion for Community Detection and Semi-Supervised Learning. In The World Wide Web Conference ( San Francisco, CA, USA) (WWW \u201919). ACM, New York, NY, USA, 739\u2013750. Rania Ibrahim and David\u00a0F. Gleich. 2019. Nonlinear Diffusion for Community Detection and Semi-Supervised Learning. In The World Wide Web Conference (San Francisco, CA, USA) (WWW \u201919). ACM, New York, NY, USA, 739\u2013750."},{"key":"e_1_3_2_1_17_1","volume-title":"Local Hypergraph Clustering using Capacity Releasing Diffusion. arXiv cs.SI(2020)","author":"Ibrahim Rania","year":"2003","unstructured":"Rania Ibrahim and David\u00a0 F. Gleich . 2020. Local Hypergraph Clustering using Capacity Releasing Diffusion. arXiv cs.SI(2020) , 2003 .04213. Rania Ibrahim and David\u00a0F. Gleich. 2020. Local Hypergraph Clustering using Capacity Releasing Diffusion. arXiv cs.SI(2020), 2003.04213."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90115-P"},{"key":"e_1_3_2_1_19_1","unstructured":"T. Joachims. 2003. Transductive learning via spectral graph partitioning. In ICML. 290\u2013297. T. Joachims. 2003. Transductive learning via spectral graph partitioning. In ICML. 290\u2013297."},{"key":"e_1_3_2_1_20_1","first-page":"1","article-title":"Multilevel hypergraph partitioning: applications in VLSI domain","volume":"7","author":"Karypis G.","year":"1999","unstructured":"G. Karypis , R. Aggarwal , V. Kumar , and S. Shekhar . 1999 . Multilevel hypergraph partitioning: applications in VLSI domain . VLSI 7 , 1 (March 1999), 69\u201379. G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar. 1999. Multilevel hypergraph partitioning: applications in VLSI domain. VLSI 7, 1 (March 1999), 69\u201379.","journal-title":"VLSI"},{"key":"e_1_3_2_1_21_1","unstructured":"K. Lang. 2005. Fixing two weaknesses of the spectral method. In NeurIPS. 715\u2013722. K. Lang. 2005. Fixing two weaknesses of the spectral method. In NeurIPS. 715\u2013722."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230030306"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.3847\/0004-637X\/833\/1\/26"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_3_2_1_25_1","first-page":"1","article-title":"Quadratic Decomposable Submodular Function Minimization: Theory and Practice","volume":"21","author":"Li Pan","year":"2020","unstructured":"Pan Li , Niao He , and Olgica Milenkovic . 2020 . Quadratic Decomposable Submodular Function Minimization: Theory and Practice . JMLR 21 (2020), 1 \u2013 49 . Pan Li, Niao He, and Olgica Milenkovic. 2020. Quadratic Decomposable Submodular Function Minimization: Theory and Practice. JMLR 21(2020), 1\u201349.","journal-title":"JMLR"},{"key":"e_1_3_2_1_26_1","unstructured":"Pan Li and Olgica Milenkovic. 2017. Inhomogeneous Hypergraph Clustering with Applications. In NeurIPS. 2308\u20132318. Pan Li and Olgica Milenkovic. 2017. Inhomogeneous Hypergraph Clustering with Applications. In NeurIPS. 2308\u20132318."},{"key":"e_1_3_2_1_27_1","unstructured":"Pan Li and Olgica Milenkovic. 2018. Submodular Hypergraphs: p-Laplacians Cheeger Inequalities and Spectral Clustering. In ICML Vol.\u00a080. 3014\u20133023. Pan Li and Olgica Milenkovic. 2018. Submodular Hypergraphs: p-Laplacians Cheeger Inequalities and Spectral Clustering. In ICML Vol.\u00a080. 3014\u20133023."},{"key":"e_1_3_2_1_28_1","unstructured":"Meng Liu and David\u00a0F. Gleich. 2020. Strongly local p-norm-cut algorithms for semi-supervised learning and local graph clustering. arxiv:2006.08569\u00a0[cs.SI] Meng Liu and David\u00a0F. Gleich. 2020. Strongly local p-norm-cut algorithms for semi-supervised learning and local graph clustering. arxiv:2006.08569\u00a0[cs.SI]"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/2503308.2503318"},{"key":"e_1_3_2_1_30_1","unstructured":"Jianmo Ni Jiacheng Li and Julian McAuley. 2019. Justifying Recommendations using Distantly-Labeled Reviews and Fine-Grained Aspects. In EMNLP-IJCNLP. Jianmo Ni Jiacheng Li and Julian McAuley. 2019. Justifying Recommendations using Distantly-Labeled Reviews and Fine-Grained Aspects. In EMNLP-IJCNLP."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Yuuki Takai Atsushi Miyauchi Masahiro Ikeda and Yuichi Yoshida. 2020. Hypergraph Clustering Based on PageRank. In KDD. 1970\u20131978. Yuuki Takai Atsushi Miyauchi Masahiro Ikeda and Yuichi Yoshida. 2020. Hypergraph Clustering Based on PageRank. In KDD. 1970\u20131978.","DOI":"10.1145\/3394486.3403248"},{"key":"e_1_3_2_1_32_1","unstructured":"Nate Veldt Austin\u00a0R. Benson and Jon Kleinberg. 2020. Hypergraph Cuts with General Splitting Functions. arxiv:2001.02817\u00a0[cs.DS] Nate Veldt Austin\u00a0R. Benson and Jon Kleinberg. 2020. Hypergraph Cuts with General Splitting Functions. arxiv:2001.02817\u00a0[cs.DS]"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Nate Veldt Austin\u00a0R Benson and Jon Kleinberg. 2020. Minimizing Localized Ratio Cut Objectives in Hypergraphs. In KDD. 1708\u20131718. Nate Veldt Austin\u00a0R Benson and Jon Kleinberg. 2020. Minimizing Localized Ratio Cut Objectives in Hypergraphs. In KDD. 1708\u20131718.","DOI":"10.1145\/3394486.3403222"},{"key":"e_1_3_2_1_34_1","unstructured":"Nate Veldt David\u00a0F. Gleich and Michael\u00a0W. Mahoney. 2016. A Simple and Strongly-Local Flow-Based Method for Cut Improvement. In ICML. 1938\u20131947. Nate Veldt David\u00a0F. Gleich and Michael\u00a0W. Mahoney. 2016. A Simple and Strongly-Local Flow-Based Method for Cut Improvement. In ICML. 1938\u20131947."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Nate Veldt Christine Klymko and David\u00a0F. Gleich. 2019. Flow-Based Local Graph Clustering with Better Seed Set Inclusion. In SDM. 378\u2013386. Nate Veldt Christine Klymko and David\u00a0F. Gleich. 2019. Flow-Based Local Graph Clustering with Better Seed Set Inclusion. In SDM. 378\u2013386.","DOI":"10.1137\/1.9781611975673.43"},{"key":"e_1_3_2_1_36_1","unstructured":"D. Wang K. Fountoulakis M. Henzinger M.\u00a0W. Mahoney and S. Rao. 2017. Capacity releasing diffusion for speed and locality. In ICML. 3598\u20133607. D. Wang K. Fountoulakis M. Henzinger M.\u00a0W. Mahoney and S. Rao. 2017. Capacity releasing diffusion for speed and locality. In ICML. 3598\u20133607."},{"key":"e_1_3_2_1_37_1","unstructured":"Shenghao Yang Di Wang and Kimon Fountoulakis. 2020. p-Norm Flow Diffusion for Local Graph Clustering. arXiv preprint arXiv:2005.09810(2020). Shenghao Yang Di Wang and Kimon Fountoulakis. 2020. p-Norm Flow Diffusion for Local Graph Clustering. arXiv preprint arXiv:2005.09810(2020)."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Hao Yin Austin\u00a0R. Benson Jure Leskovec and David\u00a0F. Gleich. 2017. Local Higher-Order Graph Clustering. In KDD. 555\u2013564. Hao Yin Austin\u00a0R. Benson Jure Leskovec and David\u00a0F. Gleich. 2017. Local Higher-Order Graph Clustering. In KDD. 555\u2013564.","DOI":"10.1145\/3097983.3098069"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Yuichi Yoshida. 2016. Nonlinear Laplacian for digraphs and its applications to network analysis. In WSDM. 483\u2013492. Yuichi Yoshida. 2016. Nonlinear Laplacian for digraphs and its applications to network analysis. In WSDM. 483\u2013492.","DOI":"10.1145\/2835776.2835785"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Yuichi Yoshida. 2019. Cheeger Inequalities for Submodular Transformations. In SODA. 2582\u20132601. Yuichi Yoshida. 2019. Cheeger Inequalities for Submodular Transformations. In SODA. 2582\u20132601.","DOI":"10.1137\/1.9781611975482.160"},{"key":"e_1_3_2_1_41_1","unstructured":"Chenzi Zhang Shuguang Hu Zhihao\u00a0Gavin Tang and T-H.\u00a0Hubert Chan. 2017. Re-Revisiting Learning on Hypergraphs: Confidence Interval and Subgradient Method. In ICML. 4026\u20134034. Chenzi Zhang Shuguang Hu Zhihao\u00a0Gavin Tang and T-H.\u00a0Hubert Chan. 2017. Re-Revisiting Learning on Hypergraphs: Confidence Interval and Subgradient Method. In ICML. 4026\u20134034."},{"key":"e_1_3_2_1_42_1","unstructured":"Dengyong Zhou Olivier Bousquet Thomas\u00a0Navin Lal Jason Weston and Bernhard Sch\u00f6lkopf. 2003. Learning with Local and Global Consistency. In NIPS. Dengyong Zhou Olivier Bousquet Thomas\u00a0Navin Lal Jason Weston and Bernhard Sch\u00f6lkopf. 2003. Learning with Local and Global Consistency. In NIPS."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Dengyong Zhou Jiayuan Huang and Bernhard Sch\u00f6lkopf. 2006. Learning with Hypergraphs: Clustering Classification and Embedding. In NeurIPS. 1601\u20131608. Dengyong Zhou Jiayuan Huang and Bernhard Sch\u00f6lkopf. 2006. Learning with Hypergraphs: Clustering Classification and Embedding. In NeurIPS. 1601\u20131608.","DOI":"10.7551\/mitpress\/7503.003.0205"},{"key":"e_1_3_2_1_44_1","unstructured":"Xiaojin Zhu Zoubin Ghahramani and John Lafferty. 2003. Semi-Supervised Learning Using Gaussian Fields and Harmonic Functions. In ICML. 912\u2013919. Xiaojin Zhu Zoubin Ghahramani and John Lafferty. 2003. Semi-Supervised Learning Using Gaussian Fields and Harmonic Functions. In ICML. 912\u2013919."},{"key":"e_1_3_2_1_45_1","unstructured":"Zeyuan\u00a0Allen Zhu Silvio Lattanzi and Vahab\u00a0S Mirrokni. 2013. A Local Algorithm for Finding Well-Connected Clusters.. In ICML (3). 396\u2013404. Zeyuan\u00a0Allen Zhu Silvio Lattanzi and Vahab\u00a0S Mirrokni. 2013. A Local Algorithm for Finding Well-Connected Clusters.. In ICML (3). 396\u2013404."},{"key":"e_1_3_2_1_46_1","first-page":"1389","article-title":"Multilevel spectral hypergraph partitioning with arbitrary vertex sizes","volume":"18","author":"Zien Y.","year":"1999","unstructured":"J.\u00a0 Y. Zien , M.\u00a0D.\u00a0 F. Schlag , and P.\u00a0 K. Chan . 1999 . Multilevel spectral hypergraph partitioning with arbitrary vertex sizes . IEEE TCAD 18 , 9 (1999), 1389 \u2013 1399 . J.\u00a0Y. Zien, M.\u00a0D.\u00a0F. Schlag, and P.\u00a0K. Chan. 1999. Multilevel spectral hypergraph partitioning with arbitrary vertex sizes. IEEE TCAD 18, 9 (1999), 1389\u20131399.","journal-title":"IEEE TCAD"}],"event":{"name":"WWW '21: The Web Conference 2021","location":"Ljubljana Slovenia","acronym":"WWW '21","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the Web Conference 2021"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3442381.3449887","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3442381.3449887","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:31Z","timestamp":1750195471000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3442381.3449887"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,19]]},"references-count":46,"alternative-id":["10.1145\/3442381.3449887","10.1145\/3442381"],"URL":"https:\/\/doi.org\/10.1145\/3442381.3449887","relation":{},"subject":[],"published":{"date-parts":[[2021,4,19]]},"assertion":[{"value":"2021-06-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}