Sciweavers

495 search results - page 65 / 99
» Approximation algorithms for budgeted learning problems
Sort
View
83
Voted
ISNN
2007
Springer
15 years 3 months ago
Recurrent Fuzzy CMAC for Nonlinear System Modeling
Normal fuzzy CMAC neural network performs well because of its fast learning speed and local generalization capability for approximating nonlinear functions. However, it requires hu...
Floriberto Ortiz Rodriguez, Wen Yu, Marco A. Moren...
GECCO
2007
Springer
235views Optimization» more  GECCO 2007»
15 years 3 months ago
Expensive optimization, uncertain environment: an EA-based solution
Real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function e...
Maumita Bhattacharya
AAAI
2011
13 years 9 months ago
Coarse-to-Fine Inference and Learning for First-Order Probabilistic Models
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and visio...
Chloe Kiddon, Pedro Domingos
ECML
2003
Springer
15 years 2 months ago
Robust k-DNF Learning via Inductive Belief Merging
A central issue in logical concept induction is the prospect of inconsistency. This problem may arise due to noise in the training data, or because the target concept does not fit...
Frédéric Koriche, Joël Quinquet...
ICML
2009
IEEE
15 years 4 months ago
Non-monotonic feature selection
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
Zenglin Xu, Rong Jin, Jieping Ye, Michael R. Lyu, ...