Toward a Fundamental Theory of Optimal Feature Selection: Part II-Implementation and Computational Complexit

DOI10.1109/TPAMI.1987.4767870MaRDI QIDQ3756340zbMATHWikidataFDO

Authors Salvatore D. Morgera

Publication date 1987

Published in IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)

zbMATH Keywords

feature selectionmatrix factorizationcomputational complexityToeplitz matriceslinear transformationcentrosymmetric matrixSimulation experimentsinverse iteration methodseigenspectrum decompositionextremal set of eigenvaluespower-Hotelling methodVLSI implementation scheme

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10) Eigenvalues, singular values, and eigenvectors (15A18) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Toward a Fundamental Theory of Optimal Feature Selection: Part I
• Selection of features in pattern recognition
• Notes on the evolution of feature selection methodology
• scientific article; zbMATH DE number 1691504
• Feature selection toolbox software package

Cited in

(6)

• Toward optimal feature selection using ranking methods and classification algorithms
• Toward a Fundamental Theory of Optimal Feature Selection: Part I
• Feature Selection Using Games with Imperfect Information (FSGIN)
• scientific article; zbMATH DE number 4114104 (Why is no real title available?)
• On a class of computationally efficient feature selection criteria
• On resilient feature selection: computational foundations of \(r\)-\(\mathbb{C} \)-reducts

This page was built for publication: Toward a Fundamental Theory of Optimal Feature Selection: Part II-Implementation and Computational Complexit

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3756340)