The application of J. Rissanen's theory (1986) of stochastic complexity to the problem of features selection in statistical pattern recognition (SPR) is discussed. Stochastic complexity provides a general framework for statistical problems such as coding, prediction, estimation, and classification. A brief review of the SPR paradigm and traditional methods of feature selection is presented, followed by a discussion of the basic of stochastic complexity. Two forms of stochastic complexity, minimum description length and an integral form, are applied to the problem of feature selection. Experimental results using simulated data generated with Gaussian distributions are given and compared with results from cross validation, a traditional technique. The stochastic complexity measures give superior results, as measured by their ability to select subsets of relevant features, as well as probability of error computed based on the selected feature subset.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Feature selection with stochastic complexity


    Contributors:
    Dom, B. (author) / Niblack, W. (author) / Sheinvald, J. (author)


    Publication date :

    1989-01-01


    Size :

    704325 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Linear feature selection with applications

    Decell, H. P., Jr. / Guseman, L. F., Jr. | NTRS | 1978


    Feature selection from huge feature sets

    Bins, J. / Draper, B.A. | IEEE | 2001


    Feature selection with nonparametric statistics

    Franceschi, E. / Odone, F. / Smeraldi, F. et al. | IEEE | 2005


    Feature Selection with Nonparametric Statistics

    Franceschi, E. / Odone, F. / Smeraldi, F. et al. | British Library Conference Proceedings | 2005


    Feature Selection from Huge Feature Sets

    Bins, J. / Draper, B. / IEEE | British Library Conference Proceedings | 2001