We propose a feature selection algorithm suitable for classification problems. Our algorithm tries to find a subset of features, which maximizes separability between Gaussian clusters. To reduce the complexity of exhaustive searching the best feature set, we follow a backward elimination method. Our feature selection algorithm can be applied to a full search classifier to obtain a single global subspace. However, one global subspace may not alone capture local behavior well. We realize multiple subspace clustering by applying our dimension reduction algorithm to a tree structured classifier. Experimental results show that the resulting classifier not only removes irrelevant features but also improves classification performance.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Feature selection based on maximizing separability in Gauss mixture model and its application to image classification


    Beteiligte:
    Sangho Yoon, (Autor:in) / Gray, R.M. (Autor:in)


    Erscheinungsdatum :

    2005-01-01


    Format / Umfang :

    272373 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Separability Based Tree Structured Local Basis Selection for Texture Classification

    Etemad, K. / Chellappa, R. / IEEE; Signal Processing Society | British Library Conference Proceedings | 1994


    An unsupervised feature selection algorithm with feature ranking for maximizing performance of the classifiers

    Singh, D. A. / Balamurugan, S. A. / Leavline, E. J. | British Library Online Contents | 2015



    Image retrieval using color histograms generated by Gauss mixture vector quantization

    Jeong, S. / Won, C. S. / Gray, R. M. | British Library Online Contents | 2004