Polynomial time algorithms for bi-criteria, multi-objective and ratio problems in clustering and imaging. Part I: Normalized cut and ratio regions
Dorit S. HochbaumPublished in: CoRR (2008)
Keyphrases
- normalized cut
- multi objective
- efficient solutions
- spectral relaxation
- clustering algorithm
- bicriteria
- optimization problems
- graph partitioning
- data clustering
- computational complexity
- combinatorial optimization
- worst case
- nonnegative matrix factorization
- spectral clustering
- reinforcement learning
- np complete
- image processing
- unsupervised learning
- k means
- multiple objectives
- cluster analysis
- image segmentation
- graph cuts
- linear programming
- data points