Consistent feature selection for pattern recognition in polynomial time

MaRDI QIDQ3174090zbMATH OpenFDO

Authors Roland Nilsson, Johan Björkegren, Jesper Tegnér, Jose M. Peña

Publication date 12 October 2011

Full work available at URL http://www.jmlr.org/papers/v8/nilsson07a.html

zbMATH Keywords

classificationlearning theoryMarkov blanketrelevancebioinformatics

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• Consistency-based search in feature selection
• 10.1162/153244303322753616
• scientific article; zbMATH DE number 1691504
• Toward a Fundamental Theory of Optimal Feature Selection: Part I
• Summary of feature selection algorithms

Cited in

(11)

• Feature selection for Bayesian network classifiers using the MDL-FS score
• Data-driven discovery of PDEs in complex datasets
• scientific article; zbMATH DE number 2080452 (Why is no real title available?)
• scientific article; zbMATH DE number 7110832 (Why is no real title available?)
• Joint Markov blankets in feature sets extracted from wavelet packet decompositions
• Consistency-based search in feature selection
• Stable feature selection for biomarker discovery
• Stochastic local search for the FEATURE SET problem, with applications to microarray data
• Diverse data selection via combinatorial quasi-concavity of distance covariance: a polynomial time global minimax algorithm
• The \(k\)-feature set problem is \(W[2]\)-complete
• scientific article; zbMATH DE number 1931929 (Why is no real title available?)

This page was built for publication: Consistent feature selection for pattern recognition in polynomial time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174090)