An improved set covering problem for Isomap supervised landmark selection.
Carlotta OrsenigoPublished in: Pattern Recognit. Lett. (2014)
Keyphrases
- set covering problem
- set covering
- integer programming
- branch and bound algorithm
- bi objective
- column generation
- semi supervised
- low dimensional
- principal component analysis
- manifold learning
- dimension reduction
- pattern classification
- dimensionality reduction
- data visualization
- nonlinear dimensionality reduction
- neural network
- worst case
- np hard
- special case
- search algorithm
- feature selection