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

DOI10.1109/TPAMI.1987.4767870zbMATH Open0619.62056WikidataQ84833092 ScholiaQ84833092MaRDI QIDQ3756340FDOQ3756340

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)

Cited In (6)

• Title not available (Why is that?)
• Toward optimal feature selection using ranking methods and classification algorithms
• Feature Selection Using Games with Imperfect Information (FSGIN)
• On a class of computationally efficient feature selection criteria
• On resilient feature selection: computational foundations of \(r\)-\(\mathbb{C} \)-reducts
• Toward a Fundamental Theory of Optimal Feature Selection: Part I

   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 👍 👎
• Title not available (Why is that?) 👍 👎
• Feature selection toolbox software package 👍 👎

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)