scientific article; zbMATH DE number 4114104

MaRDI QIDQ4729410zbMATH OpenFDO

Authors Pingfan Yan, Tong Chang, Lei Xu

Publication date 1988

zbMATH Keywords

feature selectionbranch and bound algorithm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Evaluation of the branch and bound algorithm for feature selection
• scientific article; zbMATH DE number 1983148
• An efficient binary gradient-based optimizer for feature selection
• On a class of computationally efficient feature selection criteria
• Toward a Fundamental Theory of Optimal Feature Selection: Part II-Implementation and Computational Complexit
• Feature selection algorithms in classification problems: an experimental evaluation
• Feature selection algorithms in classification problems: an experimental evaluation

Cited in

(5)

• scientific article; zbMATH DE number 1983148 (Why is no real title available?)
• scientific article; zbMATH DE number 1691486 (Why is no real title available?)
• Evaluation of the branch and bound algorithm for feature selection
• Structural, Syntactic, and Statistical Pattern Recognition
• U-curve: a branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem

This page was built for publication:

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