1036 search results - page 16 / 208 » Algorithms for Learning Regular Expressions |
PKDD
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We propose a new graph-based label propagation algorithm for transductive learning. Each example is associated with a vertex in an undirected graph and a weighted edge be...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to...
JC
2007
13 years 7 months ago
2007
NIPS
2003
13 years 8 months ago
2003
We address in this paper the question of how the knowledge of the marginal distribution P(x) can be incorporated in a learning algorithm. We suggest three theoretical methods for ...
WIA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. State elimination is an intuitive and easy-to-implement algorithm that computes a regular expression from a finite-state automaton (FA). The size of a regular expression...