On a class of computationally efficient feature selection criteria
From MaRDI portal
Publication:1222525
DOI10.1016/0031-3203(75)90018-7zbMath0318.68065MaRDI QIDQ1222525
Publication date: 1975
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0031-3203(75)90018-7
computational complexity; mutual information; Markov dependence; recursive algorithm; error probability; Bhattacharyya distance; feature ordering; Sequential feature selection
68Q25: Analysis of algorithms and problem complexity
68T10: Pattern recognition, speech recognition
68W99: Algorithms in computer science