Generalizing \(p\)-Laplacian: spectral hypergraph theory and a partitioning algorithm
From MaRDI portal
Publication:6097149
DOI10.1007/s10994-022-06264-yOpenAlexW4311032092MaRDI QIDQ6097149
Publication date: 12 June 2023
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-022-06264-y
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectra of uniform hypergraphs
- \(H^{+}\)-eigenvalues of Laplacian and signless Laplacian tensors
- Consistency of spectral hypergraph partitioning under planted partition model
- Spectra, Euclidean representations and clusterings of hypergraphs
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Local and nonlocal discrete regularization on weighted graphs for image and mesh processing
- Eigenvalues and expanders
- Spectra of regular graphs and hypergraphs and orthogonal polynomials
- Algebraic connectivity of an even uniform hypergraph
- On the eigenvectors of \(p\)-Laplacian
- The Laplacian of a uniform hypergraph
- Variational and non-variational eigenvalues of the \(p\)-Laplacian
- Spectrum of the 1-Laplacian and Cheeger's Constant on Graphs
- On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs
- Spectral Properties of Hypergraph Laplacian and Approximation Algorithms
- The Fiedler Vector of a Laplacian Tensor for Hypergraph Partitioning
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Hypergraph Clustering Using a New Laplacian Tensor with Applications in Image Processing
- Analysis of $p$-Laplacian Regularization in Semisupervised Learning
- Cheeger Inequalities for Submodular Transformations