Sciweavers

2825 search results - page 539 / 565
» Robust Feature Selection Algorithms
Sort
View
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
13 years 11 months ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...
HIS
2007
13 years 9 months ago
Pareto-based Multi-Objective Machine Learning
—Machine learning is inherently a multiobjective task. Traditionally, however, either only one of the objectives is adopted as the cost function or multiple objectives are aggreg...
Yaochu Jin
ICML
2010
IEEE
13 years 8 months ago
Toward Off-Policy Learning Control with Function Approximation
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...
Hamid Reza Maei, Csaba Szepesvári, Shalabh ...
BMCBI
2007
194views more  BMCBI 2007»
13 years 8 months ago
Kernel-imbedded Gaussian processes for disease classification using microarray gene expression data
Background: Designing appropriate machine learning methods for identifying genes that have a significant discriminating power for disease outcomes has become more and more importa...
Xin Zhao, Leo Wang-Kit Cheung
BMCBI
2007
135views more  BMCBI 2007»
13 years 8 months ago
Detecting multivariate differentially expressed genes
Background: Gene expression is governed by complex networks, and differences in expression patterns between distinct biological conditions may therefore be complex and multivariat...
Roland Nilsson, José M. Peña, Johan ...