Sciweavers

1393 search results - page 218 / 279
» Machine Learning by Function Decomposition
Sort
View
CORR
2012
Springer
170views Education» more  CORR 2012»
13 years 7 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
CVPR
2009
IEEE
1528views Computer Vision» more  CVPR 2009»
16 years 4 months ago
Structured Output-Associative Regression
Structured outputs such as multidimensional vectors or graphs are frequently encountered in real world pattern recognition applications such as computer vision, natural language pr...
Liefeng Bo and Cristian Sminchisescu
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 6 months ago
Evolving problem heuristics with on-line ACGP
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
Cezary Z. Janikow
ICPR
2010
IEEE
15 years 5 months ago
On-Line Random Naive Bayes for Tracking
—Randomized learning methods (i.e., Forests or Ferns) have shown excellent capabilities for various computer vision applications. However, it was shown that the tree structure in...
Martin Godec, Christian Leistner, Amir Saffari, Ho...
ISCIS
2005
Springer
15 years 5 months ago
Classification of Volatile Organic Compounds with Incremental SVMs and RBF Networks
Support Vector Machines (SVMs) have been applied to solve the classification of volatile organic compounds (VOC) data in some recent studies. SVMs provide good generalization perfo...
Zeki Erdem, Robi Polikar, Nejat Yumusak, Fikret S....