A hybrid connectionist-symbolic approach to regular grammatical inference based on neural learning and hierarchical clustering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 862 LNAI, Issue , 1994, Pages 203-211

  Alquezar, R ^a   Sanfeliu, A ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS; RECURRENT NEURAL NETWORKS;

ACTIVATION PATTERNS; DISTANCE MEASURE; GRAMMATICAL INFERENCES; HIER-ARCHICAL CLUSTERING; NEGATIVE EXAMPLES; NUMBER OF CLUSTERS; RECURRENT NEURAL NETWORK (RNNS); SYMBOLIC REPRESENTATION;

K-MEANS CLUSTERING;

EID: 84988558982     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58473-0_149     Document Type: Conference Paper

References (13)

1. D. Angluin and C.H. Smith, ”Inductive inference: theory and methods,” ACM Computing Survey 15 (3), pp.237-269, 1983.
2. L. Miclet, ”Grammatical inference,” in Syntatic and Structural Pattern Recognition: Theory and Applications, H. Bunke and A. Sanfeliu, Eds., World Scientific, 1990.
3. E.M. Gold, ”Complexity of automaton identification from given data,” Information and Control 37, pp. 302-320, 1978.
4. J. Oncina and P. Garcia, ”Identifying regular languages in polynomial time,” in Advances in Structural and Syntactic Pattern Recognition, Proc. of the 2nd IAPR Int. Workshop on SSPR, Bern, Switzerland, August 1992, H. Bunke, Ed., World Scientific, 1992, pp.99-108.
5. R. Alquezar and A. Sanfeliu, ”Incremental grammatical inference from positive and negative data using unbiased finite state automata,” in Proc. of the 3rd IAPR Int. Workshop on Structural and Syntactic Pattern Recognition, SSPR-94, Nahariya, Israel, October 1994.
6. A. Cleeremans, D. Servan-Schreiber and J.L. McClelland, ”Finite-state automata and simple recurrent networks,” Neural Computation 1, pp.372-381, 1989.
7. C.B. Miller and C.L. Giles, ”Experimental comparison of the effect of order in recurrent neural networks,” Int. Journal of Pattern Recognition and Artificial Intelligence 7 (4), pp. 849-872, 1993.
8. Z. Zeng, R.M. Goodman and P. Smyth, ”Learning finite state machines with selfclustering recurrent networks,” Neural Computation 5 (1993), pp.976-990, 1993.
9. A. Sanfeliu and R. Alquezar, ”Active grammatical inference combining neural and symbolic techniques,” in Proc. of the 3rd IAPR Int. Workshop on Structural and Syntactic Pattern Recognition, SSPR-94, Nahariya, Israel, October 1994.
10. C.L. Giles and C.W. Omlin, ”Extraction, insertion and refinement of symbolic rules in dynamically-driven recurrent neural networks,” Connection Science, spec. issue on” Architectures for Integrating Symbolic and Neural Processes”, 1993.
11. S. Das and R. Das, ”Induction of discrete-state machine by stabilizing a simple recurrent network using clustering,” Computer Science and Informatics, vol. 21, no. 2, pp. 35-40, 1991.
12. J.E. Hopfcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading MA, 1979.
13. A. Sanfeliu and R. Alquezar, ”Understanding neural networks for grammatical inference and recognition,” in Advances in Structural and Syntactic Pattern Recognition, Proc. of the 2nd IAPR Int. Workshop on SSPR, Bern, Switzerland, August 1992, H. Bunke, Ed., (World Scientific, 1992), pp.75-98.