Fast orthogonal forward selection algorithm for feature subset selection

@article{Mao2002FastOF,
  title={Fast orthogonal forward selection algorithm for feature subset selection},
  author={Kezhi Mao},
  journal={IEEE transactions on neural networks},
  year={2002},
  volume={13 5},
  pages={1218-24}
}
Feature selection is an important issue in pattern classification. In the presented study, we develop a fast orthogonal forward selection (FOFS) algorithm for feature subset selection. The FOFS algorithm employs an orthogonal transform to decompose correlations among candidate features, but it performs the orthogonal decomposition in an implicit way. Consequently, the fast algorithm demands less computational effort as compared with conventional orthogonal forward selection (OFS). 
Highly Cited
This paper has 134 citations. REVIEW CITATIONS

Topics

Statistics

0102030'02'04'06'08'10'12'14'16'18
Citations per Year

135 Citations

Semantic Scholar estimates that this publication has 135 citations based on the available data.

See our FAQ for additional information.