Sciweavers

247 search results - page 46 / 50
» Superset Learning Based on Generalized Loss Minimization
Sort
View
ICFCA
2007
Springer
15 years 4 months ago
A Parameterized Algorithm for Exploring Concept Lattices
Kuznetsov shows that Formal Concept Analysis (FCA) is a natural framework for learning from positive and negative examples. Indeed, the results of learning from positive examples (...
Peggy Cellier, Sébastien Ferré, Oliv...
CORR
2006
Springer
153views Education» more  CORR 2006»
14 years 10 months ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...
CVPR
2009
IEEE
16 years 5 months ago
Volterrafaces: Discriminant Analysis using Volterra Kernels
In this paper we present a novel face classification system where we represent face images as a spatial arrangement of image patches, and seek a smooth non-linear functional map...
Ritwik Kumar, Arunava Banerjee, Baba C. Vemuri
ESANN
2004
14 years 11 months ago
Sparse LS-SVMs using additive regularization with a penalized validation criterion
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...
GECCO
2010
Springer
186views Optimization» more  GECCO 2010»
14 years 11 months ago
Genetic rule extraction optimizing brier score
Most highly accurate predictive modeling techniques produce opaque models. When comprehensible models are required, rule extraction is sometimes used to generate a transparent mod...
Ulf Johansson, Rikard König, Lars Niklasson