1036 search results - page 20 / 208 » Algorithms for Learning Regular Expressions |
ICML
2005
IEEE
16 years 2 months ago
2005
IEEE
In the information regularization framework by Corduneanu and Jaakkola (2005), the distributions of labels are propagated on a hypergraph for semi-supervised learning. The learnin...
113
Voted
NIPS
2007
15 years 3 months ago
2007
Semi-supervised inductive learning concerns how to learn a decision rule from a data set containing both labeled and unlabeled data. Several boosting algorithms have been extended...
115
click to vote
AINA
2007
IEEE
15 years 8 months ago
2007
IEEE
Regular path queries (RPQs), expressed as regular expressions over the alphabet of database edge-labels, are commonly used for guided navigation of graph databases. While convenie...
125
click to vote
PAMI
1998
15 years 1 months ago
1998
—This paper concerns an efficient algorithm for learning in the limit a special type of regular languages called strictly locally testable languages from positive data, and its a...
LATA
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Glushkov’s algorithm builds an ε-free nondeterministic automaton from a given regular expression. In the worst case, its number of states is linear and its number of t...