On a class of computationally efficient feature selection criteria

DOI10.1016/0031-3203(75)90018-7zbMath0318.68065OpenAlexW2030492942MaRDI QIDQ1222525

S. Singh

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

zbMATH Keywords

computational complexitymutual informationMarkov dependencerecursive algorithmerror probabilityBhattacharyya distancefeature orderingSequential feature selection

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10) Algorithms in computer science (68W99)

Related Items (3)

On information and distance measures, error bounds, and feature selection ⋮ Feature definition in pattern recognition with small sample size ⋮ A centroid-based gene selection method for microarray data classification

Cites Work

• Sequential methods in pattern recognition and machine learning
• On a New Class of Bounds on Bayes Risk in Multihypothesis Pattern Recognition
• Feature Selection in Pattern Recognition
• Probability of Error Bounds
• Dynamic Programming as Applied to Feature Subset Selection in a Pattern Recognition System

This page was built for publication: On a class of computationally efficient feature selection criteria