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

DOI10.1016/j.amc.2006.05.128zbMath1110.68370OpenAlexW1977679444MaRDI QIDQ865564

Andreas A. 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 annealingstochastic local searchparameterized complexitymicroarraysfeature set problemgene-expression analysis

Mathematics Subject Classification ID

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

Related Items

An opinion formation based binary optimization approach for feature selection ⋮ Evaluating and selecting features via information theoretic lower bounds of feature inner correlations for high-dimensional data ⋮ Feature subset selection in large dimensionality domains

Cites Work

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