Infrared and Laser Engineering, Volume. 32, Issue 1, 17(2003)

Improvement and comparative analysis of B&B algorithm in feature selection

[in Chinese]* and [in Chinese]
Author Affiliations
  • [in Chinese]
  • show less

    B&B is an optimal algorithm of feature subset selection. The high computational complexity of this algorithm is its inherent problem. B&B algorithm constructs a search tree, and then searches for the optimal feature subset in the tree. The previous research on B&B algorithm focused on simplifying the search tree in order to reduce the search complexity, and several improvements have already existed. A theoretical analysis of basic B&B algorithm and the previous improvements are given under a common framework in which all the algorithms are compared. Based on this analysis, an improved B&B algorithm--BBPP+--is proposed. Experimental comparison shows that BBPP+ is more efficient than all previous algorithms.

    Tools

    Get Citation

    Copy Citation Text

    [in Chinese], [in Chinese]. Improvement and comparative analysis of B&B algorithm in feature selection[J]. Infrared and Laser Engineering, 2003, 32(1): 17

    Download Citation

    EndNote(RIS)BibTexPlain Text
    Save article for my favorites
    Paper Information

    Category: 图像处理

    Received: Jul. 10, 2002

    Accepted: Oct. 21, 2002

    Published Online: Apr. 28, 2006

    The Author Email:

    DOI:

    Topics