Sciweavers

115 search results - page 5 / 23
» Extraction of Symbolic Rules from Artificial Neural Networks
Sort
View
TNN
1998
92views more  TNN 1998»
13 years 7 months ago
Inductive inference from noisy examples using the hybrid finite state filter
—Recurrent neural networks processing symbolic strings can be regarded as adaptive neural parsers. Given a set of positive and negative examples, picked up from a given language,...
Marco Gori, Marco Maggini, Enrico Martinelli, Giov...
CEC
2008
IEEE
14 years 2 months ago
Increasing rule extraction accuracy by post-processing GP trees
—Genetic programming (GP), is a very general and efficient technique, often capable of outperforming more specialized techniques on a variety of tasks. In this paper, we suggest ...
Ulf Johansson, Rikard König, Tuve Löfstr...
ICML
1991
IEEE
13 years 11 months ago
Constructive Induction in Knowledge-Based Neural Networks
Artificial neural networks have proven to be a successful, general method for inductive learning from examples. However, they have not often been viewed in terms of constructive ...
Geoffrey G. Towell, Mark Craven, Jude W. Shavlik
ESANN
2003
13 years 9 months ago
A new rule extraction algorithm based on interval arithmetic
In this paper we propose a new algorithm for rule extraction from a trained Multilayer Feedforward network. The algorithm is based on an interval arithmetic network inversion for p...
Carlos Hernández-Espinosa, Mercedes Fern&aa...
ICANN
2005
Springer
14 years 1 months ago
CrySSMEx, a Novel Rule Extractor for Recurrent Neural Networks: Overview and Case Study
In this paper, it will be shown that it is feasible to extract finite state machines in a domain of, for rule extraction, previously unencountered complexity. The algorithm used i...
Henrik Jacobsson, Tom Ziemke