Sciweavers

4196 search results - page 415 / 840
» Unsupervised Learning of Relations
Sort
View
UAI
1998
15 years 7 months ago
A Multivariate Discretization Method for Learning Bayesian Networks from Mixed Data
In this paper we address the problem of discretization in the context of learning Bayesian networks (BNs) from data containing both continuous and discrete variables. We describe ...
Stefano Monti, Gregory F. Cooper
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
15 years 7 months ago
Improved bounds on the sample complexity of learning
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
Yi Li, Philip M. Long, Aravind Srinivasan
167
Voted
COLING
1996
15 years 7 months ago
FeasPar - A Feature Structure Parser Learning to Parse Spoken Language
We describe and experimentally evaluate a system, FeasPar, that learns parsing spontaneous speech. To train and run FeasPar (Feature Structure Parser), only limited handmodeled kn...
Finn Dag Buø, Alex Waibel
BDA
2007
15 years 7 months ago
Hyperplane Queries in a Feature-Space M-tree for Speeding up Active Learning
In content-based retrieval, relevance feedback (RF) is a noticeable method for reducing the “semantic gap” between the low-level features describing the content and the usually...
Michel Crucianu, Daniel Estevez, Vincent Oria, Jea...
CORR
2007
Springer
112views Education» more  CORR 2007»
15 years 6 months ago
Learning from compressed observations
— The problem of statistical learning is to construct a predictor of a random variable Y as a function of a related random variable X on the basis of an i.i.d. training sample fr...
Maxim Raginsky