Data clustering based on the modified relaxation Cheeger cut model
From MaRDI portal
Publication:2115038
Recommendations
- Modified Cheeger and ratio cut methods using the Ginzburg–Landau functional for classification of high-dimensional data
- scientific article; zbMATH DE number 7266429
- scientific article; zbMATH DE number 7071835
- Spectral methods for graph clustering - a survey
- Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs
Cites work
- scientific article; zbMATH DE number 3337135 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- A Scale-Invariant Approach for Sparse Signal Recovery
- Algorithm AS 136: A K-Means Clustering Algorithm
- Algorithms for generalized fractional programming
- Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs
- Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
- Convergence guarantees for a class of non-convex and non-smooth optimization problems
- DC formulations and algorithms for sparse optimization problems
- DC programming and DCA: thirty years of developments
- Lower Bounds for the Partitioning of Graphs
- Modern algorithms of cluster analysis
- Modified Cheeger and ratio cut methods using the Ginzburg–Landau functional for classification of high-dimensional data
- Multi-class transductive learning based on \(\ell^1\) relaxations of Cheeger cut and Mumford-Shah-Potts model
- On Nonlinear Fractional Programming
- On the Partial Difference Equations of Mathematical Physics
- Rayleigh quotient minimization for absolutely one-homogeneous functionals
- Splitting Methods in Communication, Imaging, Science, and Engineering
- The Concave-Convex Procedure
This page was built for publication: Data clustering based on the modified relaxation Cheeger cut model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115038)