Consistent feature selection for pattern recognition in polynomial time

zbMATH Open1222.68353MaRDI QIDQ3174090FDOQ3174090

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

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

zbMATH Keywords

classificationlearning theoryMarkov blanketrelevancebioinformatics

Mathematics Subject Classification ID

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

Cited In (11)

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

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)