Stochastic local search for the FEATURE SET problem, with applications to microarray data

DOI10.1016/J.AMC.2006.05.128MaRDI QIDQ865564zbMATH OpenOpenAlexFDO

Authors Andreas Albrecht

Publication date 19 February 2007

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2006.05.128

zbMATH Keywords

simulated annealingparameterized complexitystochastic local searchmicroarraysfeature set problemgene-expression analysis

Mathematics Subject Classification ID

Medical applications (general) (92C50) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Genetics and epigenetics (92D10) Searching and sorting (68P10)

Recommendations

• The \(k\)-feature set problem is \(W[2]\)-complete
• Consistent feature selection for pattern recognition in polynomial time
• A parameterized complexity analysis of combinatorial feature selection problems

Cites work

• scientific article; zbMATH DE number 1332320 (Why is no real title available?)
• scientific article; zbMATH DE number 1161563 (Why is no real title available?)
• A Remark on Stirling's Formula
• Computational Science and Its Applications – ICCSA 2004
• Cooling Schedules for Optimal Annealing
• Determination of cluster number in clustering microarray data
• Efficient computation of RNA folding dynamics
• Feature selection for consistent biclustering via fractional 0-1 programming
• Gene selection for cancer classification using support vector machines
• Optimization by simulated annealing
• Rough large deviation estimates for simulated annealing: Application to exponential schedules
• Selection of relevant features and examples in machine learning
• The \(k\)-feature set problem is \(W[2]\)-complete
• Theory of genetic algorithms
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm

Cited in

(4)

• The \(k\)-feature set problem is \(W[2]\)-complete
• Evaluating and selecting features via information theoretic lower bounds of feature inner correlations for high-dimensional data
• An opinion formation based binary optimization approach for feature selection
• Feature subset selection in large dimensionality domains

This page was built for publication: Stochastic local search for the FEATURE SET problem, with applications to microarray data

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