Sciweavers

181 search results - page 18 / 37
» Polynomial Learning of Distribution Families
Sort
View
ICDM
2007
IEEE
289views Data Mining» more  ICDM 2007»
14 years 4 months ago
Latent Dirichlet Conditional Naive-Bayes Models
In spite of the popularity of probabilistic mixture models for latent structure discovery from data, mixture models do not have a natural mechanism for handling sparsity, where ea...
Arindam Banerjee, Hanhuai Shan
ICGI
1998
Springer
14 years 2 months ago
Learning Stochastic Finite Automata from Experts
We present in this paper a new learning problem called learning distributions from experts. In the case we study the experts are stochastic deterministic finite automata (sdfa). W...
Colin de la Higuera
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
13 years 12 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...
CORR
2000
Springer
134views Education» more  CORR 2000»
13 years 9 months ago
Learning Complexity Dimensions for a Continuous-Time Control System
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...
Pirkko Kuusela, Daniel Ocone, Eduardo D. Sontag
SDM
2011
SIAM
233views Data Mining» more  SDM 2011»
13 years 20 days ago
Multi-Instance Mixture Models
Multi-instance (MI) learning is a variant of supervised learning where labeled examples consist of bags (i.e. multi-sets) of feature vectors instead of just a single feature vecto...
James R. Foulds, Padhraic Smyth