Abstract
Although the extraction of symbolic knowledge from trained feedforward neural networks has been widely studied, research in recurrent neural networks (RNN) has been more neglected, even though it performs better in areas such as control, speech recognition, time series prediction, etc. Nowadays, a subject of particular interest is (crisp/fuzzy) grammatical inference, in which the application of these neural networks has proven to be suitable. In this paper, we present a method using a self-organizing map (SOM) for extracting knowledge from a recurrent neural network able to infer a (crisp/fuzzy) regular language. Identification of this language is done only from a (crisp/fuzzy) example set of the language. © 2000 John Wiley & Sons, Inc.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
