Sciweavers

70 search results - page 9 / 14
» Regularized Linear Models in Stacked Generalization
Sort
View
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
13 years 6 months ago
Efficient and Numerically Stable Sparse Learning
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
Sihong Xie, Wei Fan, Olivier Verscheure, Jiangtao ...
ICLP
2001
Springer
14 years 27 days ago
On a Tabling Engine That Can Exploit Or-Parallelism
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing solutions to goals. Quite a few interesting applications of tabling...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
CSDA
2007
106views more  CSDA 2007»
13 years 8 months ago
Parsimonious additive models
A new method for function estimation and variable selection, specifically designed for additive models fitted by cubic splines is proposed.This new method involves regularizing ...
Marta Avalos, Yves Grandvalet, Christophe Ambroise
COR
2010
164views more  COR 2010»
13 years 8 months ago
The distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
B. Naderi, Rubén Ruiz
NIPS
2007
13 years 10 months ago
Bayesian Inference for Spiking Neuron Models with a Sparsity Prior
Generalized linear models are the most commonly used tools to describe the stimulus selectivity of sensory neurons. Here we present a Bayesian treatment of such models. Using the ...
Sebastian Gerwinn, Jakob Macke, Matthias Seeger, M...