On a class of computationally efficient feature selection criteria
type: Item
instance of: scholarly article
title: On a class of computationally efficient feature selection criteria
zbMATH Open document ID: 0318.68065
DOI: 10.1016/0031-3203(75)90018-7
author: S. Singh
published in: Pattern Recognition
publication date: 1975-01-01T00:00:00Z
Mathematics Subject Classification ID: 68T10
Mathematics Subject Classification ID: 68W99
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3499260
zbMATH Keywords: Sequential feature selection
zbMATH Keywords: feature ordering
zbMATH Keywords: Bhattacharyya distance
zbMATH Keywords: mutual information
zbMATH Keywords: Markov dependence
zbMATH Keywords: recursive algorithm
zbMATH Keywords: computational complexity
zbMATH Keywords: error probability
MaRDI profile type: Publication
full work available at URL: 0031-3203(75)90018-7
OpenAlex ID: W2030492942
cites work: Feature Selection in Pattern Recognition
cites work: Probability of Error Bounds
cites work: On a New Class of Bounds on Bayes Risk in Multihypothesis Pattern Recognition
cites work: Sequential methods in pattern recognition and machine learning
cites work: Dynamic Programming as Applied to Feature Subset Selection in a Pattern Recognition System
Recommended article: Q3093222
Recommended article: Q3070903
Recommended article: Feature selection algorithms in classification problems: an experimental evaluation
Recommended article: Computational Methods of Feature Selection
Recommended article: Toward a Fundamental Theory of Optimal Feature Selection: Part II-Implementation and Computational Complexit
Recommended article: Toward optimal feature selection using ranking methods and classification algorithms
Recommended article: Q3402770
description: scientific article; zbMATH DE number 3499260