Title of article
Symbolic state transducers and recurrent neural preference machines for text mining Original Research Article
Author/Authors
Garen Arevian، نويسنده , , Stefan Wermter، نويسنده , , Christo Panchev، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
22
From page
237
To page
258
Abstract
This paper focuses on symbolic transducers and recurrent neural preference machines to support the task of mining and classifying textual information. These encoding symbolic transducers and learning neural preference machines can be seen as independent agents, each one tackling the same task in a different manner. Systems combining such machines can potentially be more robust as the strengths and weaknesses of the different approaches yield complementary knowledge, wherein each machine models the same information content via different paradigms. An experimental analysis of the performance of these symbolic transducer and neural preference machines is presented. It is demonstrated that each approach can be successfully used for information mining and news classification using the Reuters news corpus. Symbolic transducer machines can be used to manually encode relevant knowledge quickly in a data-driven approach with no training, while trained neural preference machines can give better performance based on additional training.
Keywords
recurrent neural networks , Symbolic transducers , Preference Moore Machines , Hybrid systems , Text classification , Finite state automata
Journal title
International Journal of Approximate Reasoning
Serial Year
2003
Journal title
International Journal of Approximate Reasoning
Record number
1181873
Link To Document