Corpus ID: 14496989

A Review of Suboptimal Branch and Bound Algorithms

@inproceedings{NakariyakulARO,
  title={A Review of Suboptimal Branch and Bound Algorithms},
  author={Songyot Nakariyakul}
}
The branch and bound algorithm is an optimal feature selection method that is well-known for its computational efficiency. However, when the dimensionality of the original feature space is large, the execution time required by the branch and bound algorithm becomes very excessive. If the optimality of the algorithm is allowed to be compromised, the search time can be greatly reduced by employing the look-ahead search strategy to eliminate many solutions deemed to be suboptimal early in the… Expand

Figures from this paper

Task allocation strategy of utility management system based on heuristic constrained optimal tree algorithm
TLDR
Allocation principles of constraints are presented to solve airborne tasks constraints-adaptability, importance level, redundancy, exclusion relationship, accumulative execution time (AET) and intertask communication (ITC). Expand
New technique for feature selection: Combination between elastic net and relief
One of the most advanced forms of industrial maintenance is predictive maintenance. Indeed, the present analysis of the behavior of a material helps to predict future behavior. The analysis is alsoExpand

References

SHOWING 1-10 OF 10 REFERENCES
On the suboptimal solutions using the adaptive branch and bound algorithm for feature selection
  • Songyot Nakariyakul
  • Mathematics
  • 2008 International Conference on Wavelet Analysis and Pattern Recognition
  • 2008
The branch and bound algorithm is an optimal feature selection method that is well-known for its computational efficiency. The recently developed adaptive branch and bound algorithm has been shown toExpand
Fast branch & bound algorithms for optimal feature selection
TLDR
A novel search principle for optimal feature subset selection using the branch & bound method using a simple mechanism for predicting criterion values is introduced and two implementations of the proposed prediction mechanism are proposed that are suitable for use with nonrecursive and recursive criterion forms. Expand
Adaptive branch and bound algorithm for selecting optimal features
TLDR
The proposed adaptive branch and bound algorithm improves the search speed by avoiding unnecessary criterion function calculations at nodes in the solution tree by obtaining a large ''good'' initial bound by a floating search method. Expand
A Branch and Bound Algorithm for Feature Subset Selection
TLDR
A feature subset selection algorithm based on branch and bound techniques is developed to select the best subset of m features from an n-feature set with the computational effort of evaluating only 6000 subsets. Expand
A more efficient branch and bound algorithm for feature selection
  • Bin Yu, B. Yuan
  • Mathematics, Computer Science
  • Pattern Recognit.
  • 1993
TLDR
This algorithm dynamically searches for the globally optimal solution on a minimum solution tree which is a subtree of the solution tree used in the traditional branch and bound algorithm. Expand
Comparison of algorithms that select features for pattern classifiers
TLDR
It is shown that sequential floating search methods are suitable for small- and medium-scale problems and genetic algorithms are suitableFor large-scale feature selection algorithms, the goodness of a feature subset is measured by leave-one-out correct-classification rate of a nearest-neighbor (1-NN) classifier. Expand
Floating search methods in feature selection
Sequential search methods characterized by a dynamically changing number of features included or eliminated at each step, henceforth "floating" methods, are presented. They are shown to give veryExpand
Feature Selection for Knowledge Discovery and Data Mining
  • H. Liu, H. Motoda
  • Computer Science
  • The Springer International Series in Engineering and Computer Science
  • 1998
TLDR
Feature Selection for Knowledge Discovery and Data Mining offers an overview of the methods developed since the 1970's and provides a general framework in order to examine these methods and categorize them and suggests guidelines for how to use different methods under various circumstances. Expand
Introduction to Statistical Pattern Recognition
TLDR
This completely revised second edition presents an introduction to statistical pattern recognition, which is appropriate as a text for introductory courses in pattern recognition and as a reference book for workers in the field. Expand
UCI Machine Learning Repository [http://www.ics.uci.edu/~mlearn/MLRepository
  • UCI Machine Learning Repository [http://www.ics.uci.edu/~mlearn/MLRepository
  • 2007