Automatically finding clusters in normalized cuts
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 236854 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- A unified framework for detecting groups and application to shape recognition
- Consistency of spectral clustering
- Edge detection by Helmholtz principle
- Efficient graph-based image segmentation
- From Gestalt theory to image analysis. A probabilistic approach.
- Graph Clustering and Minimum Cut Trees
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
- Image segmentation by a contrario simulation
- Mean shift spectral clustering
- Model Selection and Multimodel Inference
- On clusterings: good, bad and spectral
- The estimation of the gradient of a density function, with applications in pattern recognition
- The minimum description length principle in coding and modeling
- Worst-case Analysis of Set Union Algorithms
Cited in
(6)- Enhanced balanced min cut
- Mixed-integer linear programming formulations and column generation algorithms for the minimum normalized cuts problem on networks
- Automatic aspect discrimination in data clustering
- Iterative ensemble normalized cuts
- A review on spectral clustering and stochastic block models
- Annealing and the normalized \(N\)-cut
This page was built for publication: Automatically finding clusters in normalized cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q716368)
