Quadratic problem formulation with linear constraints for normalized cut clustering
Abstract:
This work describes a novel quadratic formulation for solving the normalized cuts-based clustering problem as an alternative to spectral clustering approaches. Such formulation is done by establishing simple and suitable constraints, which are further relaxed in order to write a quadratic functional with linear constraints. As a meaningful result of this work, we accomplish a deterministic solution instead of using a heuristic search. Our method reaches comparable performance against conventional spectral methods, but spending significantly lower processing time.
Año de publicación:
2014
Keywords:
Fuente:

Tipo de documento:
Conference Object
Estado:
Acceso abierto
Áreas de conocimiento:
- Optimización matemática
- Optimización matemática
- Optimización matemática
Áreas temáticas:
- Ciencias de la computación