On the learnability and usage of acyclic probabilistic finite automata
Journal of Computer and System Sciences - Special issue on the eighth annual workshop on computational learning theory, July 5–8, 1995
PAC-learnability of Probabilistic Deterministic Finite State Automata
The Journal of Machine Learning Research
Probabilistic Finite-State Machines-Part II
IEEE Transactions on Pattern Analysis and Machine Intelligence
Probabilistic Finite-State Machines-Part I
IEEE Transactions on Pattern Analysis and Machine Intelligence
PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
Theoretical Computer Science
Web Customer Modeling for Automated Session Prioritization on High Traffic Sites
UM '07 Proceedings of the 11th international conference on User Modeling
Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Self-adaptive utility-based web session management
Computer Networks: The International Journal of Computer and Telecommunications Networking
PAC-Learning of markov models with hidden state
ECML'06 Proceedings of the 17th European conference on Machine Learning
Learnability of probabilistic automata via oracles
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
| Hi-index | 0.00 |
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time lengths, governed by exponential distribution.