-
1
-
-
84988545491
-
-
Carrasco, R.C., Oncina, J.: Learning stochastic regular grammars by means of a state merging method. In: ICGI, pp. 139-152 (1994)
-
Carrasco, R.C., Oncina, J.: Learning stochastic regular grammars by means of a state merging method. In: ICGI, pp. 139-152 (1994)
-
-
-
-
3
-
-
22944462298
-
PAC-learnability of probabilistic deterministic finite state automata
-
Clark, A., Thollard, F.: PAC-learnability of probabilistic deterministic finite state automata. Journal of Machine Learning Research 5, 473-497 (2004)
-
(2004)
Journal of Machine Learning Research
, vol.5
, pp. 473-497
-
-
Clark, A.1
Thollard, F.2
-
4
-
-
84943228856
-
-
de la Higuera, C., Oncina, J., Vidal, E.: identification of DFA: data-dependent vs data-independent algorithms. In: ICGI, pp. 313-325 (1996)
-
de la Higuera, C., Oncina, J., Vidal, E.: identification of DFA: data-dependent vs data-independent algorithms. In: ICGI, pp. 313-325 (1996)
-
-
-
-
5
-
-
33746063205
-
-
Denis. F., Esposito, Y., Habrard. A.: Learning rational stochastic languages. In: Lugosi, G., Simon, H.U. (eds.) COLT 2006. LNCS (LNA1), 4005, pp. 274-288. Springer, Heidelberg (2006)
-
Denis. F., Esposito, Y., Habrard. A.: Learning rational stochastic languages. In: Lugosi, G., Simon, H.U. (eds.) COLT 2006. LNCS (LNA1), vol. 4005, pp. 274-288. Springer, Heidelberg (2006)
-
-
-
-
6
-
-
19944415906
-
Links between probabilistic automata and hidden Markov models: Probability distributions, learning models and induction algorithms
-
Dupont, P., Denis, F., Esposito, Y.: Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms. Pattern Recognition 38, 1349-1371 (2005)
-
(2005)
Pattern Recognition
, vol.38
, pp. 1349-1371
-
-
Dupont, P.1
Denis, F.2
Esposito, Y.3
-
7
-
-
33750374571
-
-
Gavaldà, R., Keller, P.W., Pineau, J., Precup, D.: PAC-learning of Markov models with hidden state. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNA1), 4212, pp. 150-161. Springer, Heidelberg (2006)
-
Gavaldà, R., Keller, P.W., Pineau, J., Precup, D.: PAC-learning of Markov models with hidden state. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNA1), vol. 4212, pp. 150-161. Springer, Heidelberg (2006)
-
-
-
-
9
-
-
33646529351
-
-
Guttman, O., Vishwanathan, S.V.N., Williamson, R.C.: Learnability of probabilistic automata via oracles. In: Jain, S., Simon, H.U., Tomita, E. (eds.) ALT 2005. LNCS (LNAI), 3734, pp. 171-182. Springer, Heidelberg (2005)
-
Guttman, O., Vishwanathan, S.V.N., Williamson, R.C.: Learnability of probabilistic automata via oracles. In: Jain, S., Simon, H.U., Tomita, E. (eds.) ALT 2005. LNCS (LNAI), vol. 3734, pp. 171-182. Springer, Heidelberg (2005)
-
-
-
-
10
-
-
0028098408
-
On the learnability of discrete distributions
-
Kearns, M.J., Mansour, Y., Ron, D., Rubinfeld, R., Schapire, R.E., Sellie, L.: On the learnability of discrete distributions. In: STOC, pp. 273-282 (1994)
-
(1994)
STOC
, pp. 273-282
-
-
Kearns, M.J.1
Mansour, Y.2
Ron, D.3
Rubinfeld, R.4
Schapire, R.E.5
Sellie, L.6
-
11
-
-
84943230024
-
-
Kermorvant, C., Dupont, P.: Stochastic grammatical inference with multinomial tests. In: Adriaans, P.W., Fernau, H., van Zaanen, M. (eds.) ICGI 2002. LNCS (LNAI), 2484, pp. 149-160. Springer, Heidelberg (2002)
-
Kermorvant, C., Dupont, P.: Stochastic grammatical inference with multinomial tests. In: Adriaans, P.W., Fernau, H., van Zaanen, M. (eds.) ICGI 2002. LNCS (LNAI), vol. 2484, pp. 149-160. Springer, Heidelberg (2002)
-
-
-
-
12
-
-
33646533743
-
-
Palmer, N., Goldberg, P.W.: PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance. In: Jain, S., Simon, H.U., Tomita, E. (eds.) ALT 2005. LNCS (LNAI), 3734, pp. 157-170. Springer, Heidelberg (2005)
-
Palmer, N., Goldberg, P.W.: PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance. In: Jain, S., Simon, H.U., Tomita, E. (eds.) ALT 2005. LNCS (LNAI), vol. 3734, pp. 157-170. Springer, Heidelberg (2005)
-
-
-
-
13
-
-
0032049450
-
On the learnability and usage of acyclic probabilistic finite automata
-
Ron, D., Singer, Y., Tishby, N.: On the learnability and usage of acyclic probabilistic finite automata. J. Comput. Syst. Sci. 56(2), 133-152 (1998)
-
(1998)
J. Comput. Syst. Sci
, vol.56
, Issue.2
, pp. 133-152
-
-
Ron, D.1
Singer, Y.2
Tishby, N.3
-
14
-
-
22944484114
-
-
Thollard, F., Clark, A.: Learning stochastic deterministic regular languages. In: Paliouras, G., Sakakibara, Y. (eds.) ICGI 2004. LNCS (LNAI), 3264, pp. 248-259. Springer, Heidelberg (2004)
-
Thollard, F., Clark, A.: Learning stochastic deterministic regular languages. In: Paliouras, G., Sakakibara, Y. (eds.) ICGI 2004. LNCS (LNAI), vol. 3264, pp. 248-259. Springer, Heidelberg (2004)
-
-
-
-
15
-
-
0345276133
-
Probabilistic DFA inference using Kullback-Leibler divergence and minimality
-
Thollard, F., Dupont, P., de la Higuera, C.: Probabilistic DFA inference using Kullback-Leibler divergence and minimality. In: ICML, pp. 975-982 (2000)
-
(2000)
ICML
, pp. 975-982
-
-
Thollard, F.1
Dupont, P.2
de la Higuera, C.3
|