U-curve: a branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem

DOI10.1016/j.patcog.2009.08.018zbMath1178.90296OpenAlexW2106127648MaRDI QIDQ2654218

Marcelo S. Reis, Junior Barrera, David C. jun. Martins

Publication date: 15 January 2010

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2009.08.018

zbMATH Keywords

branch-and-bound algorithmBoolean latticefeature selectionsubset searchoptimal searchU-shaped curve

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (3)

Optimal Boolean lattice-based algorithms for the U-curve optimization problem ⋮ Feature Selection from Local Lift Dependence-Based Partitions ⋮ From mathematical morphology to machine learning of image operators

Uses Software

• UCI-ml

Cites Work

• A Mathematical Theory of Communication
• Minimal Representations for Translation-Invariant Set Mappings by Mathematical Morphology
• Unnamed Item
• Unnamed Item

This page was built for publication: U-curve: a branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem