English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/30182
logo share SHARE   Add this article to your Mendeley library MendeleyBASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:


Experimental assessment of connectionest regular inference from positive and negative examples

AuthorsAlquézar Mancho, Renato ; Sanfeliu, Alberto ; Saínz, Miguel
KeywordsPattern recognition: Computer vision
Computer vision
Issue Date1997
PublisherAsociación Española de Reconocimientos de Formas y Análisis de Imágenes
Citation7th Spanish Symposium on Pattern Recognition and Image Analysis: 1-6 (1997)
AbstractIn this paper, the ability of recurrent neural networks (RNNs) for regular inference (RI) from positive and negative examples is investigated. As in some previous works [1, 2], RNNs were trained to learn the string classification task from samples of some target regular languages. In addition, an automaton extraction method [3] was applied to each one of the trained nets to obtain a description of the inference outcome. For comparison purposes, a symbolic RI method, the RPNI algorithm [4], was also run on the same data. Although the automaton extraction step improved the generalization performance of the nets, the inference quality using RNNs was not so good as the one shown by the RPNI algorithm.
DescriptionSpanish Symposium on Pattern Recognition and Image Analysis (SNRFAI), 1997, Barcelona (España)
Appears in Collections:(IRII) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
doc1.pdf201,39 kBAdobe PDFThumbnail
Show full item record
Review this work

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.