Review and Evaluation of Feature Selection Algorithms in Synthetic Problems

Computer Science – Artificial Intelligence

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

13 pages, 3 figures

Scientific paper

The main purpose of Feature Subset Selection is to find a reduced subset of attributes from a data set described by a feature set. The task of a feature selection algorithm (FSA) is to provide with a computational solution motivated by a certain definition of relevance or by a reliable evaluation measure. In this paper several fundamental algorithms are studied to assess their performance in a controlled experimental scenario. A measure to evaluate FSAs is devised that computes the degree of matching between the output given by a FSA and the known optimal solutions. An extensive experimental study on synthetic problems is carried out to assess the behaviour of the algorithms in terms of solution accuracy and size as a function of the relevance, irrelevance, redundancy and size of the data samples. The controlled experimental conditions facilitate the derivation of better-supported and meaningful conclusions.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Review and Evaluation of Feature Selection Algorithms in Synthetic Problems 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 Review and Evaluation of Feature Selection Algorithms in Synthetic Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Review and Evaluation of Feature Selection Algorithms in Synthetic Problems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-264882

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.