• DocumentCode
    1109574
  • Title

    Theoretical Comparison of a Class of Feature Selection Criteria in Pattern Recognition

  • Author

    Chen, C.H.

  • Author_Institution
    IEEE
  • Issue
    9
  • fYear
    1971
  • Firstpage
    1054
  • Lastpage
    1056
  • Abstract
    The distance measures and the information functions for feature selection are compared. The comparison is based on the available tight upper and lower bounds of the probability of misrecognition, the rates of change of such probability, the effectiveness of a feature subset, and the computational complexity.
  • Keywords
    Bhattacharyya coefficients, computational complexity, entropy criterion, error bounds, feature subsets, probability of misrecognition.; Computational complexity; Entropy; Feature extraction; Gaussian distribution; Pattern recognition; Probability; Upper bound; Bhattacharyya coefficients, computational complexity, entropy criterion, error bounds, feature subsets, probability of misrecognition.;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/T-C.1971.223402
  • Filename
    1671995
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1109574