Active coevolutionary learning of deterministic finite automata

Journal of Machine Learning Research

Volumn 6, Issue , 2005, Pages

  Bongard, Josh ^a   Lipson, Hod ^a  

^a Cornell University   (United States)

Author keywords

Active learning; Deterministic finite automata; Evolutionary computation; Grammatical inference; System identification

Indexed keywords

EVOLUTIONARY ALGORITHMS; FINITE AUTOMATA; IDENTIFICATION (CONTROL SYSTEMS); INFERENCE ENGINES; PROBLEM SOLVING;

ACTIVE LEARNING; DETERMINISTIC FINITE AUTOMATA; ESTIMATION-EXPLORATION ALGORITHM (EEA); GRAMMATICAL INFERENCE;

LEARNING SYSTEMS;

EID: 25444469991     PISSN: 15337928     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (29)

1. D. Angluin. A note on the number of queries needed to identify regular languages. Information and Control, 51:76-87, 1981.
2. D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75:87-106, 1987.
3. D. Angluin. Queries revisited. Theoretical Computer Science, 313:175-194, 2004.
4. Y. Baram, R. E. Yaniv, and K. Luz. Online choice of active learning algorithms. Journal of Machine Learning Research, 5:255-291, 2004.
5. T. Berg, B. Jonsson, M. Leucker, and M. Saksena. Insights to Angluin's learning. Technical Report 2003-039, Uppsala Universitet, 2003.
6. F. Bergadano and D. Gunetti. Inductive Logic Programming: From Machine Learning to Software Engineering. MIT Press, Cambridge, MA, 1995.
7. J. Bongard and H. Lipson. Automated robot function recovery after unanticipated failure or environmental change using a minimum of hardware trials. In Proceedings of the NASA/DoD Conference on Evolvable Hardware, pages 169-176. IEEE Computer Society, 2004a.
8. J. Bongard and H. Lipson. Automating genetic network inference with minimal physical experimentation using coevolution. In Proceedings of the 2004 Genetic and Evolutionary Computation Conference (GECCO), pages 333-345. Springer, 2004b.
9. J. Bongard and H. Lipson. Automating system identification using co-evolution. IEEE Transactions on Evolutionary Computation, 9(4):361-384, 2005.
10. S. Brave. Evolving deterministic finite automata using cellular encoding. In Genetic Programming 96: Proceedings of the First Annual Conference on Genetic Programming, pages 39-44. MIT Press, 1996.
11. O. Cicchello and S. C. Kremer. Inducing grammars from sparse data sets: A survey of algorithms and results. Journal of Machine Learning Research, 4:603-632, 2003.
12. P. Dupont. Incremental regular inference. In L. Miclet and C. Higuera, editors, Proceedings of the Third ICGI-96, Lecture Notes in Artificial Intelligence 1147, pages 222-237, 1996.
13. P. Dupont, L. Miclet, and E. Vidal. What is the search space of the regular inference? In Proceedings of the Second International Colloquium on Grammatical Inference (ICGI'94), pages 25-37, 1994.
14. K. J. Lang, B. A. Pearlmutter, and R. A. Price. Results of the Abbadingo One DFA learning competition and a new evidence-driven state merging algorithm. In Grammatical Inference (Lecture Notes in Artificial Intelligence 1433), pages 1-12. Springer-Verlag, 1992.
15. K. J. Lang, B. A. Pearlmutter, and R. A. Price. Results of the Abbadingo One DFA learning competition and a new evidence-driven state merging algorithm. In V. G. Honavar and G. Slutzki, editors, Proceedings of the Fourth International Colloquium on Grammatical Inference: ICGI 1998, pages 1-12, London, UK, 1998. Springer-Verlag.
16. L. Ljung. System Identification: Theory for the User. Prentice-Hall, Inc., Englewood Cliffs, NJ, 1999.
17. S. M. Lucas and T. J. Reynolds. Learning deterministic finite automata with a smart state labelling evolutionary algorithm. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27: 1063-1074, 2005.
18. S. Luke, S. Hamahashi, and H. Kitano. "Genetic" programming. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 1098-1105. Morgan Kaufmann, 13-17 1999.
19. S. W. Mahfoud. Niching methods for genetic algorithms. PhD thesis, Urbana, IL, USA, 1995.
20. J. Oncina and P. Garciá. Inferring regular languages in polynomial update time. In Pattern Recognition and Image Analysis, pages 49-61. World Scientific, 1992.
21. T. Pao and J. Carr. A solution of the syntactic induction-inference problem for regular languages. Computer Languages, 3:53-64, 1978.
22. R. G. Parekh and V. G. Honavar. Efficient learning of regular languages using teacher supplied positive examples and learner generated queries. In Proceedings of the Fifth UNB Conference on AI, pages 195-203, 1993.
23. R. G. Parekh and V. G. Honavar. An incremental interactive approach for regular grammar inference. In Proceedings of the Third ICGI-96 (Lecture Notes in Artificial Intelligence 1147), pages 238-250. Springer Verlag, 1996.
24. L. Pitt. Inductive inference, DFAs and computational complexity. In Proceedings of the International Workshop on Analogical and Inductive Inference (Lecture Notes in Artificial Intelligence 397), pages 18-44. Springer Verlag, 1989.
25. S. Porat and J. Feldman. Learning automata from ordered examples. Machine Learning, 7:109-138, 1991.
26. J. M. Sempere and P. Garcia. A new regular language learning algorithm from lexicographically ordered complete samples. In IEEE Colloquium on Grammatical Inference: Theory, Applications and Alternatives, pages 6/1-6/7, 1993.
27. H. S. Seung, M. Opper, and H. Sompolinsky. Query by committee. In Proceedings of the Fifth Workshop on Computational Learning Theory, pages 387-294, San Mateo, CA, 1992. Morgan Kauffman.
28. M. Tomita. Dynamic construction of finite automata from examples using hill climbing. In V. G. Honavar and G. Slutzki, editors, Proceedings of the Fourth Annual Cognitive Science Conference, pages 105-108, 1982.
29. B. A. Trakhtenbrot and Y. M. Barzdin. Finite Automata Behavior and Synthesis. North-Holland Publishing Company, Amsterdam, 1973.