A branch-and-bound feature selection algorithm for U-shaped cost functions

Details A branch-and-bound feature selection algorithm for U-shaped cost functions A branch-and-bound feature selection algorithm for U-shaped cost functions

2008-10-30

arxiv.org/abs/0810.5573v1

Computer Science

Computer Vision and Pattern Recognition

Scientific paper

This paper presents the formulation of a combinatorial optimization problem with the following characteristics: i.the search space is the power set of a finite set structured as a Boolean lattice; ii.the cost function forms a U-shaped curve when applied to any lattice chain. This formulation applies for feature selection in the context of pattern recognition. The known approaches for this problem are branch-and-bound algorithms and heuristics, that explore partially the search space. Branch-and-bound algorithms are equivalent to the full search, while heuristics are not. This paper presents a branch-and-bound algorithm that differs from the others known by exploring the lattice structure and the U-shaped chain curves of the search space. The main contribution of this paper is the architecture of this algorithm that is based on the representation and exploration of the search space by new lattice properties proven here. Several experiments, with well known public data, indicate the superiority of the proposed method to SFFS, which is a popular heuristic that gives good results in very short computational time. In all experiments, the proposed method got better or equal results in similar or even smaller computational time.

Affiliated with

Also associated with

No associations

Rating

A branch-and-bound feature selection algorithm for U-shaped cost functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A branch-and-bound feature selection algorithm for U-shaped cost functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A branch-and-bound feature selection algorithm for U-shaped cost functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-456409