Toward a Fundamental Theory of Optimal Feature Selection: Part II-Implementation and Computational Complexit
DOI10.1109/TPAMI.1987.4767870zbMath0619.62056WikidataQ84833092 ScholiaQ84833092MaRDI QIDQ3756340
Publication date: 1987
Published in: IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)
computational complexitylinear transformationToeplitz matricesmatrix factorizationfeature selectioncentrosymmetric matrixSimulation experimentsinverse iteration methodseigenspectrum decompositionextremal set of eigenvaluespower-Hotelling methodVLSI implementation scheme
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10) Eigenvalues, singular values, and eigenvectors (15A18)
This page was built for publication: Toward a Fundamental Theory of Optimal Feature Selection: Part II-Implementation and Computational Complexit