Fetching the paper…
Reading the bibliography…
Hypergraph-based machine learning methods are now widely recognized as important for modeling and using higher-order and multiway relationships between data objects.
A Simple and Strongly-Local Flow-Based Method for Cut Improvement. In ICML . 1938–1947
Nate Veldt, David F. Gleich, and Michael W. Mahoney. 2016 · 1947
Earlier work this paper cites.
Cutsets and partitions of hypergraphs
E. L. Lawler. 1973 · 1973
Earlier work this paper cites.
Hypergraph Clustering Based on PageRank. In KDD . 1970–1978
Yuuki Takai, Atsushi Miyauchi, Masahiro Ikeda, and Yuichi Yoshida. 2020 · 1978
Earlier work this paper cites.
Spectral Graph Theory
Fan R. L. Chung. 1992 · 1992
Earlier work this paper cites.
Modeling hypergraphs by graphs with the same mincut properties
E. Ihler, D. Wagner, and F. Wagner. 1993 · 1993
Earlier work this paper cites.
Approximation techniques for hypergraph partitioning problems
Scott W. Hadley. 1995 · 1995
Earlier work this paper cites.
Multilevel hypergraph partitioning: applications in VLSI domain
G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar. 1999 · 1999
Earlier work this paper cites.
Multilevel spectral hypergraph partitioning with arbitrary vertex sizes
J. Y. Zien, M. D. F. Schlag, and P. K. Chan. 1999 · 1999
Earlier work this paper cites.
Learning from Labeled and Unlabeled Data Using Graph Mincuts. In ICML . 19–26
Avrim Blum and Shuchi Chawla. 2001 · 2001
Earlier work this paper cites.
Hypergraph Cuts with General Splitting Functions
Nate Veldt, Austin R. Benson, and Jon Kleinberg. 2020a · 2001
Earlier work this paper cites.
Local Hypergraph Clustering using Capacity Releasing Diffusion
Rania Ibrahim and David F. Gleich. 2020 · 2003
Earlier work this paper cites.
Transductive learning via spectral graph partitioning. In ICML . 290–297
T. Joachims. 2003 · 2003
Earlier work this paper cites.
Learning with Local and Global Consistency. In NIPS
Dengyong Zhou, Olivier Bousquet, Thomas Navin Lal, Jason Weston, and Bernhard Schölkopf. 2003 · 2003
Earlier work this paper cites.
Semi-Supervised Learning Using Gaussian Fields and Harmonic Functions. In ICML . 912–919
Xiaojin Zhu, Zoubin Ghahramani, and John Lafferty. 2003 · 2003
Earlier work this paper cites.
Flow-based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
K. Fountoulakis, M. Liu, D. F. Gleich, and M. W. Mahoney. 2020 · 2004
Earlier work this paper cites.
Beyond Pairwise Clustering. In CVPR . 838–845
Sameer Agarwal, Jongwoo Lim, Lihi Zelnik-Manor, Pietro Perona, David Kriegman, and Serge Belongie. 2005 · 2005
Cited alongside, same era.
Fixing two weaknesses of the spectral method. In NeurIPS . 715–722
K. Lang. 2005 · 2005
Cited alongside, same era.
Higher Order Learning with Graphs. In ICML . 17–24
Sameer Agarwal, Kristin Branson, and Serge Belongie. 2006 · 2006
Cited alongside, same era.
Local graph partitioning using pagerank vectors. In FOCS . 475–486
Reid Andersen, Fan Chung, and Kevin Lang. 2006 · 2006
Cited alongside, same era.
Strongly local p-norm-cut algorithms for semi-supervised learning and local graph clustering
Meng Liu and David F. Gleich. 2020 · 2006
Cited alongside, same era.
Learning with Hypergraphs: Clustering, Classification, and Embedding. In NeurIPS . 1601–1608
Nonlinear Laplacian for digraphs and its applications to network analysis. In WSDM . 483–492
Yuichi Yoshida. 2016 · 2016
Later among the works it cites.
Design and Analysis of Experiments in Networks: Reducing Bias from Interference
D. Eckles, B. Karrer, and J. Ugander. 2017 · 2017
Later among the works it cites.
Inhomogeneous Hypergraph Clustering with Applications
Pan Li and Olgica Milenkovic. 2017 · 2017
Later among the works it cites.
Capacity releasing diffusion for speed and locality. In ICML . 3598–3607
D. Wang, K. Fountoulakis, M. Henzinger, M. W. Mahoney, and S. Rao. 2017 · 2017
Later among the works it cites.
Local Higher-Order Graph Clustering. In KDD . 555–564
Hao Yin, Austin R. Benson, Jure Leskovec, and David F. Gleich. 2017 · 2017
Later among the works it cites.
Re-Revisiting Learning on Hypergraphs: Confidence Interval and Subgradient Method. In ICML . 4026–4034
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Dengyong Zhou, Jiayuan Huang, and Bernhard Schölkopf. 2006 · 2006
Cited alongside, same era.
An Algorithm for Improving Graph Partitions. In SODA . 651–660
Reid Andersen and Kevin J. Lang. 2008 · 2008
Cited alongside, same era.
Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. 2009 · 2009
Cited alongside, same era.
A Local Spectral Method for Graphs: With Applications to Improving Graph Partitions and Exploring Data Graphs Locally
M. W. Mahoney, L. Orecchia, and N. K. Vishnoi. 2012 · 2012
Cited alongside, same era.
The Total Variation on Hypergraphs - Learning on Hypergraphs Revisited. In NeurIPS . 2427–2435
M. Hein, S. Setzer, L. Jost, and S. S. Rangapuram. 2013 · 2013
Cited alongside, same era.
A Local Algorithm for Finding Well-Connected Clusters.. In ICML (3) . 396–404
Zeyuan Allen Zhu, Silvio Lattanzi, and Vahab S Mirrokni. 2013 · 2013
Cited alongside, same era.
Anti-differentiating approximation algorithms: A case study with min-cuts, spectral, and flow. In ICML . 1018–1025
David Gleich and Michael Mahoney. 2014 · 2014
Cited alongside, same era.
Chenzi Zhang, Shuguang Hu, Zhihao Gavin Tang, and T-H. Hubert Chan. 2017 · 2017
Later among the works it cites.
Submodular Hypergraphs: p-Laplacians, Cheeger Inequalities and Spectral Clustering. In ICML , Vol. 80. 3014–3023
Pan Li and Olgica Milenkovic. 2018 · 2018
Later among the works it cites.
Random Walks on Hypergraphs with Edge-Dependent Vertex Weights. In ICML . 1172–1181
Uthsav Chitra and Benjamin J. Raphael. 2019 · 2019
Later among the works it cites.
Nonlinear Diffusion for Community Detection and Semi-Supervised Learning. In The World Wide Web Conference (San Francisco, CA, USA) (WWW ’19) . ACM, New York, NY, USA, 739–750
Rania Ibrahim and David F. Gleich. 2019 · 2019
Later among the works it cites.
Justifying Recommendations using Distantly-Labeled Reviews and Fine-Grained Aspects. In EMNLP-IJCNLP
Jianmo Ni, Jiacheng Li, and Julian McAuley. 2019 · 2019
Later among the works it cites.
Flow-Based Local Graph Clustering with Better Seed Set Inclusion. In SDM . 378–386
Nate Veldt, Christine Klymko, and David F. Gleich. 2019 · 2019
Later among the works it cites.
Cheeger Inequalities for Submodular Transformations. In SODA . 2582–2601
Yuichi Yoshida. 2019 · 2019
Later among the works it cites.
Augmented Sparsifiers for Generalized Hypergraph Cuts
Austin R Benson, Jon Kleinberg, and Nate Veldt. 2020 · 2020
Closest in time.
Quadratic Decomposable Submodular Function Minimization: Theory and Practice
Pan Li, Niao He, and Olgica Milenkovic. 2020 · 2020
Closest in time.
p p -Norm Flow Diffusion for Local Graph Clustering
Shenghao Yang, Di Wang, and Kimon Fountoulakis. 2020 · 2020
Closest in time.