Sciweavers

4255 search results - page 564 / 851
» On Learning Boolean Functions
Sort
View
ALT
2004
Springer
15 years 11 months ago
New Revision Algorithms
A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in ...
Judy Goldsmith, Robert H. Sloan, Balázs Sz&...
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 8 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 8 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...
143
Voted
ISCIS
2005
Springer
15 years 7 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....
126
Voted
PCI
2001
Springer
15 years 6 months ago
A Knowledge Based Approach on Educational Metadata Use
One of the most rapidly evolving e-services is e-Learning, that is, the creation of advanced educational resources that are accessible on-line and, potentially, offer numerous adva...
Fotis Kokkoras, Demetrios G. Sampson, Ioannis P. V...