Sciweavers

1252 search results - page 148 / 251
» Minimizing Learned Clauses
Sort
View
JMLR
2010
162views more  JMLR 2010»
15 years 12 days ago
A Surrogate Modeling and Adaptive Sampling Toolbox for Computer Based Design
An exceedingly large number of scientific and engineering fields are confronted with the need for computer simulations to study complex, real world phenomena or solve challenging ...
Dirk Gorissen, Ivo Couckuyt, Piet Demeester, Tom D...
LREC
2008
139views Education» more  LREC 2008»
15 years 7 months ago
Identification of Comparable Argument-Head Relations in Parallel Corpora
We present the machine learning framework that we are developing, in order to support explorative search for non-trivial linguistic configurations in low-density languages (langua...
Kathrin Spreyer, Jonas Kuhn, Bettina Schrader
169
Voted
ISCAS
2006
IEEE
96views Hardware» more  ISCAS 2006»
15 years 11 months ago
On the initialization of the DNMF algorithm
— A subspace supervised learning algorithm named Discriminant Non-negative Matrix Factorization (DNMF) has been recently proposed for classifying human facial expressions. It dec...
Ioan Buciu, Nikos Nikolaidis, Ioannis Pitas
PAMI
2011
15 years 17 days ago
Cost-Sensitive Boosting
—A novel framework is proposed for the design of cost-sensitive boosting algorithms. The framework is based on the identification of two necessary conditions for optimal cost-sen...
Hamed Masnadi-Shirazi, Nuno Vasconcelos
JMLR
2010
161views more  JMLR 2010»
15 years 12 days ago
Empirical Bernstein Boosting
Concentration inequalities that incorporate variance information (such as Bernstein's or Bennett's inequality) are often significantly tighter than counterparts (such as...
Pannagadatta K. Shivaswamy, Tony Jebara