1036 search results - page 41 / 208 » Algorithms for Learning Regular Expressions |
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
104
Voted
ICPR
2006
IEEE
16 years 2 months ago
2006
IEEE
Typical gene expression clustering algorithms are restricted to a specific underlying pattern model while overlooking the possibility that other information carrying patterns may ...
106
click to vote
KDD
2004
ACM
16 years 2 months ago
2004
ACM
Massive publicly available gene expression data consisting of different experimental conditions and microarray platforms introduce new challenges in data mining when integrating m...
122
Voted
ICML
2005
IEEE
16 years 2 months ago
2005
IEEE
We present a directed Markov random field (MRF) model that combines n-gram models, probabilistic context free grammars (PCFGs) and probabilistic latent semantic analysis (PLSA) fo...
121
click to vote
COLT
2006
Springer
15 years 3 months ago
2006
Springer
There are two main families of on-line algorithms depending on whether a relative entropy or a squared Euclidean distance is used as a regularizer. The difference between the two f...