Sciweavers

1047 search results - page 106 / 210
» Learning the required number of agents for complex tasks
Sort
View
CIDM
2007
IEEE
13 years 12 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
ML
2008
ACM
104views Machine Learning» more  ML 2008»
13 years 7 months ago
Many holes in hindley-milner
We implement statically-typed multi-holed contexts in OCaml using an underlying algebraic datatype augmented with phantom types. Existing approaches require dynamic checks or more...
Sam Lindley
ICML
2009
IEEE
14 years 8 months ago
Large-scale deep unsupervised learning using graphics processors
The promise of unsupervised learning methods lies in their potential to use vast amounts of unlabeled data to learn complex, highly nonlinear models with millions of free paramete...
Rajat Raina, Anand Madhavan, Andrew Y. Ng
TKDE
2008
114views more  TKDE 2008»
13 years 7 months ago
Neural-Based Learning Classifier Systems
UCS is a supervised learning classifier system that was introduced in 2003 for classification in data mining tasks. The representation of a rule in UCS as a univariate classificati...
Hai Huong Dam, Hussein A. Abbass, Chris Lokan, Xin...
AI
2002
Springer
13 years 7 months ago
Learning cost-sensitive active classifiers
Most classification algorithms are "passive", in that they assign a class label to each instance based only on the description given, even if that description is incompl...
Russell Greiner, Adam J. Grove, Dan Roth