Sciweavers

3114 search results - page 216 / 623
» Distributed Case-Based Learning
Sort
View
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
15 years 3 months ago
Learning Random Monotone DNF
We give an algorithm that with high probability properly learns random monotone DNF with t(n) terms of length log t(n) under the uniform distribution on the Boolean cube {0, 1}n ....
Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedi...
109
Voted
NIPS
2008
15 years 3 months ago
Analyzing human feature learning as nonparametric Bayesian inference
Almost all successful machine learning algorithms and cognitive models require powerful representations capturing the features that are relevant to a particular problem. We draw o...
Joseph Austerweil, Thomas L. Griffiths
NIPS
2007
15 years 3 months ago
An online Hebbian learning rule that performs Independent Component Analysis
Independent component analysis (ICA) is a powerful method to decouple signals. Most of the algorithms performing ICA do not consider the temporal correlations of the signal, but o...
Claudia Clopath, André Longtin, Wulfram Ger...
EMNLP
2006
15 years 3 months ago
Domain Adaptation with Structural Correspondence Learning
Discriminative learning methods are widely used in natural language processing. These methods work best when their training and test data are drawn from the same distribution. For...
John Blitzer, Ryan T. McDonald, Fernando Pereira
112
Voted
IJAR
2006
89views more  IJAR 2006»
15 years 1 months ago
Learning probabilistic decision graphs
Probabilistic decision graphs (PDGs) are a representation language for probability distributions based on binary decision diagrams. PDGs can encode (context-specific) independence...
Manfred Jaeger, Jens D. Nielsen, Tomi Silander