GraphLSHC: towards large scale spectral hypergraph clustering
From MaRDI portal
Publication:2054077
Recommendations
- A reductive approach to hypergraph clustering: an application to image segmentation
- Nonbacktracking Spectral Clustering of Nonuniform Hypergraphs
- Spectra, Euclidean representations and clusterings of hypergraphs
- Fast spectral clustering via the Nyström method
- Fast clustering based on bipartite graph
Cites work
- Approximate normalized cuts without eigen-decomposition
- Elastic Net Hypergraph Learning for Image Clustering and Semi-Supervised Classification
- Fast computation of low-rank matrix approximations
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Improving CUR matrix decomposition and the Nyström approximation via adaptive sampling
- Local Deep-Feature Alignment for Unsupervised Dimension Reduction
- Spectral based hypothesis testing for community detection in complex networks
Cited in
(8)- GraphLSH
- Identifying lead users in online user innovation communities based on supernetwork
- A reductive approach to hypergraph clustering: an application to image segmentation
- Generalizing p-Laplacian: spectral hypergraph theory and a partitioning algorithm
- Nonbacktracking Spectral Clustering of Nonuniform Hypergraphs
- FGC\_SS: fast graph clustering method by joint spectral embedding and improved spectral rotation
- Large-scale non-negative subspace clustering based on Nyström approximation
- UP-DPC: ultra-scalable parallel density peak clustering
This page was built for publication: GraphLSHC: towards large scale spectral hypergraph clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2054077)