181 search results - page 15 / 37 » Polynomial Learning of Distribution Families |
CORR
2007
Springer
13 years 9 months ago
2007
Springer
— 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...
ICGI
2010
Springer
13 years 8 months ago
2010
Springer
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
ALT
1997
Springer
14 years 2 months ago
1997
Springer
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
SIAMCOMP
2000
13 years 9 months ago
2000
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
ALT
2007
Springer
14 years 6 months ago
2007
Springer
In this paper, we address the issue of learning nonlinearly separable concepts with a kernel classifier in the situation where the data at hand are altered by a uniform classific...