Evaluation of the branch and bound algorithm for feature selection

DOI10.1016/0167-8655(90)90078-GMaRDI QIDQ4310576zbMATH OpenOpenAlexFDO

Authors Yoshihiko Hamamoto, Shunji Uchimura, Yutaka Matsuura, Taiho Kanaoka, Shingo Tomita

Publication date 1 August 2000

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

Full work available at URL https://doi.org/10.1016/0167-8655(90)90078-g

zbMATH Keywords

feature selectionexhaustive search algorithmbranch and bound algorithmrecognition rate

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• scientific article; zbMATH DE number 1983148
• scientific article; zbMATH DE number 1691486
• Structural, Syntactic, and Statistical Pattern Recognition
• scientific article; zbMATH DE number 4114104
• Evaluation of a Branch and Bound Algorithm for Clustering

Cited in

(7)

• U-curve: a branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem
• Structural, Syntactic, and Statistical Pattern Recognition
• scientific article; zbMATH DE number 4114104 (Why is no real title available?)
• A modified reptile search algorithm for parametric estimation of fractional order model of lithium battery
• scientific article; zbMATH DE number 1691486 (Why is no real title available?)
• Dimensionality reduction for sensory datasets based on master-slave synchronization of Lorenz system
• scientific article; zbMATH DE number 1983148 (Why is no real title available?)

This page was built for publication: Evaluation of the branch and bound algorithm for feature selection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4310576)