Sciweavers

2436 search results - page 214 / 488
» Evaluating Adaptive Problem Selection
Sort
View
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 10 months ago
Using pair approximations to predict takeover dynamics in spatially structured populations
The topological properties of a network directly impact the flow of information through a system. For example, in natural populations, the network of inter-individual contacts aff...
Joshua L. Payne, Margaret J. Eppstein
ESANN
2004
15 years 5 months ago
Evolutionary tuning of multiple SVM parameters
The problem of model selection for support vector machines (SVMs) is considered. We propose an evolutionary approach to determine multiple SVM hyperparameters: The covariance matr...
Frauke Friedrichs, Christian Igel
BMCBI
2010
150views more  BMCBI 2010»
15 years 1 months ago
Kernel based methods for accelerated failure time model with ultra-high dimensional data
Background: Most genomic data have ultra-high dimensions with more than 10,000 genes (probes). Regularization methods with L1 and Lp penalty have been extensively studied in survi...
Zhenqiu Liu, Dechang Chen, Ming Tan, Feng Jiang, R...
114
Voted
ICML
2009
IEEE
16 years 4 months ago
On sampling-based approximate spectral decomposition
This paper addresses the problem of approximate singular value decomposition of large dense matrices that arises naturally in many machine learning applications. We discuss two re...
Sanjiv Kumar, Mehryar Mohri, Ameet Talwalkar
123
Voted
ICML
2008
IEEE
16 years 4 months ago
Empirical Bernstein stopping
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
Csaba Szepesvári, Jean-Yves Audibert, Volod...