Sciweavers

495 search results - page 3 / 99
» Learning to generalize for complex selection tasks
Sort
View
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
13 years 9 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
CORR
2006
Springer
79views Education» more  CORR 2006»
13 years 5 months ago
May We Have Your Attention: Analysis of a Selective Attention Task
In this paper we present a deeper analysis than has previously been carried out of a selective attention problem, and the evolution of continuous-time recurrent neural networks to...
Eldan Goldenberg, Jacob R. Garcowski, Randall D. B...
SIGSOFT
2008
ACM
14 years 6 months ago
Javert: fully automatic mining of general temporal properties from dynamic traces
Program specifications are important for many tasks during software design, development, and maintenance. Among these, temporal specifications are particularly useful. They expres...
Mark Gabel, Zhendong Su
PKDD
2010
Springer
162views Data Mining» more  PKDD 2010»
13 years 3 months ago
Expectation Propagation for Bayesian Multi-task Feature Selection
In this paper we propose a Bayesian model for multi-task feature selection. This model is based on a generalized spike and slab sparse prior distribution that enforces the selectio...
Daniel Hernández-Lobato, José Miguel...
JMLR
2002
89views more  JMLR 2002»
13 years 5 months ago
The Set Covering Machine
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
Mario Marchand, John Shawe-Taylor