loading...
A Neural Architecture for Fast Rule Matching
Dunedin, New Zealand November 20-November 23
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ANNES.1995.4994842nd New Zealand Two-Stream Internatio ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
J. Austin, University of York
John Kennedy, University of York
Ken Lees, University of York
This paper describes a simple neural architecture that can be used to match rules in knowledge based systems. The approach allows very large numbers of rules to be searched and matched using simple neural correlation matrix memories. The architecture is specifically designed to cope with inputs that may contain errors or be incomplete. Because the neural architecture is based on binary inputs and binary weights it is particularly applicable to fast operation on standard computers as well as specialized hardware. The paper describes the current implementation of the system, its advantages compared to other methods and the motivation that led to its design.
Citation:
J. Austin, John Kennedy, Ken Lees, "A Neural Architecture for Fast Rule Matching," annes, pp.255, 2nd New Zealand Two-Stream International Conference on Artificial Neural Networks and Expert Systems (ANNES '95), 1995
Usage of this product signifies your acceptance of the Terms of Use.