47 search results - page 4 / 10 » Learning a Subclass of Regular Patterns in Polynomial Time |
JMLR
2008
14 years 11 months ago
2008
The max-sum classifier predicts n-tuple of labels from n-tuple of observable variables by maximizing a sum of quality functions defined over neighbouring pairs of labels and obser...
STOC
1994
ACM
15 years 3 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
COLT
1994
Springer
15 years 3 months ago
1994
Springer
We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic nite automata...
104
click to vote
ALT
1997
Springer
15 years 2 months ago
1997
Springer
A pattern is a string of constant and variable symbols. The language generated by a pattern is the set of all strings of constant symbols which can be obtained from by substituti...
FORMATS
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. We extend Angluin’s algorithm for on-line learning of regular languages to the setting of timed systems. We consider systems that can be described by a class of determi...