Inductive inference from noisy examples using the hybrid finite state filter

IEEE Transactions on Neural Networks

Volumn 9, Issue 3, 1998, Pages 571-575

  Gori, M ^a   Maggini, M ^a   Martinelli, E ^a   Soda, G ^b  

^a UNIVERSITY OF SIENA   (Italy)

^b UNIVERSITY OF FLORENCE   (Italy)

Author keywords

Finite state automata; Grammatical inference; Iterated function systems; Recurrent neural networks

Indexed keywords

ADAPTIVE SYSTEMS; COMPUTATIONAL GRAMMARS; FINITE AUTOMATA; ITERATIVE METHODS; LEARNING ALGORITHMS; OPTIMIZATION;

GRAMMATICAL INFERENCE; HYBRID FINITE STATE FILTER (HFF); ITERATED FUNCTION SYSTEMS; RECURRENT NEURAL NETWORKS;

NEURAL NETWORKS;

EID: 0032074270     PISSN: 10459227     EISSN: None     Source Type: Journal    
DOI: 10.1109/72.668898     Document Type: Article

References (11)

1. C. L. Giles and C. W. Omlin, "Extraction, insertion, and refinement of symbolic rules in dynamically driven recurrent neural networks," Connection Sci., special issue on architectures for integrating symbolic and neural processes, vol. 5, nos. 3/4, p. 307, 1993.
2. R. L. Watrous and G. M. Kuhn, "Induction of finite-state languages using second-order recurrent networks," Neural Computa., vol. 4, pp. 406-414, May 1992.
3. H. Siegelmann and E. Sontag, "On the computational power of neural nets," in Proc. 5th ACM Wkshp. Computa. Learning Theory, New York, 1992, pp. 440-449, ACM.
4. P. Frasconi, M. Gori, M. Maggini, and G. Soda, "Representation of finite-state automata in recurrent radial basis function networks," Machine Learning, vol. 23, pp. 5-32, 1996.
5. J. F. Kolen, "Recurrent networks: State machines or iterated function systems?," in Proc. 1993 Connectionist Models Summer School, M. C. Mozer, P. Smolensky, D. S. Touretzky, J. L. Elman, and A. S. Weigend, Eds. Hillsdale, NJ: Lawrence Erlbaum, 1994, pp. 203-210.
6. M. Casey, "The dynamics of discrete-time computation, with the application to recurrent neural networks and finite-state machine extraction," Neural Computa., vol. 8, no. 6, pp. 1135-1178, 1996.
7. C. B. Miller and C. L. Giles, "Experimental comparison of the effect of order in recurrent neural networks," Int. J. Pattern Recognition Artificial Intell., special issue on applications of neural networks to pattern recognition, vol. 7, no. 4, pp. 849-872, 1993.
8. C. W. Omlin and C. L. Giles, "Rule revision with recurrent neural networks," IEEE Trans. Knowledge Data Eng., vol. 8, no. 1, p. 183, 1996.
9. R. J. Williams and J. Peng, "An efficient gradient-based algorithm for on-line training of recurrent network trajectories," Neural Computa., vol. 2, no. 4, pp. 490-501, 1990.
10. R. C. Carrasco and M. L. Forcada, "Second-order recurrent neural networks can learn regular grammars from noisy strings," in From Natural to Artificial Neural Computa.: Proc. IWANN'95 (June 7-9, 1995), J. Mira and F. Sandoval, Eds., vol. 930 of Lecture Notes in Computer Science. New York: Springer-Verlag, 1995, pp. 605-610.
11. M. Tomita, "Dynamic construction of finite-state automata from examples using hill-climbing," in Proc. 4th Annu. Cognitive Sci. Conf., Ann Arbor, MI, 1982, pp. 105-108.