Constructive Heuristics and Lower Bounds for Graph Partitioning Based on a Principal-Components Approximation.
K. S. ArunVasant B. RaoPublished in: SIAM J. Matrix Anal. Appl. (1993)
Keyphrases
- principal components
- graph partitioning
- lower bound
- principal component analysis
- upper bound
- partitioning algorithm
- image segmentation
- graph model
- clustering algorithm
- weighted graph
- branch and bound
- np hard
- data clustering
- dimensionality reduction
- approximation algorithms
- objective function
- normalized cut
- superpixels
- worst case
- feature set
- optimal solution
- data sets
- principal component regression
- spectral clustering
- covariance matrix
- face recognition
- feature selection
- data mining