Improved Branch-and-Bound Algorithm for U-Curve Optimization Conference Paper

abstract

• The U-curve branch-and-bound algorithm for optimization was introduced recently by Ris and collaborators. In this paper we introduce an improved algorithm for finding the optimal set of features based on the U-curve assumption. Synthetic experiments are used to asses the performance of the proposed algorithm, and compare it to exhaustive search and the original algorithm. The results show that the modified U-curve BB algorithm makes fewer evaluations and is more robust than the original algorithm. 2013 IEEE.

name of conference

• 2013 IEEE International Workshop on Genomic Signal Processing and Statistics

authors

• Braga Neto, Ulisses
• Dougherty, Edward

published proceedings

• 2013 IEEE INTERNATIONAL WORKSHOP ON GENOMIC SIGNAL PROCESSING AND STATISTICS (GENSIPS 2013)

author list (cited authors)

• Atashpaz-Gargari, E., Braga-Neto, U. M., & Dougherty, E. R.

citation count

• 1

complete list of authors

• Atashpaz-Gargari, Esmaeil||Braga-Neto, Ulisses M||Dougherty, Edward R

publication date

• January 2013

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE International Workshop on Genomic Signal Processing and Statistics : [proceedings]. IEEE International Workshop on Genomic Signal Processing and Statistics  Journal

keywords

• Bioengineering

Digital Object Identifier (DOI)

• 10.1109/gensips.2013.6735948

International Standard Book Number (ISBN) 13

• 9781479934621

start page

• 100

end page

• 101

URL

• http%3A%2F%2Fdx.doi.org%2F10.1109%2Fgensips.2013.6735948