Burles, Nathan John orcid.org/0000-0003-3030-1675, O'Keefe, Simon orcid.org/0000-0001-5957-2474 and Austin, Jim orcid.org/0000-0001-5762-8614 (2013) Improving the associative rule chaining architecture. In: Mladenov, V, Palm, G, Appollini, B, Koprinkova-Hristova, P, Villa, A and Kasabov, N, (eds.) Artificial Neural Networks and Machine Learning - ICANN 2013. Lecture Notes in Computer Science . Springer , Berlin , pp. 98-105.
Abstract
This paper describes improvements to the rule chaining architecture presented in [1]. The architecture uses distributed associative memories to allow the system to utilise memory eciently, and superimposed distributed representations in order to reduce the time complexity of a tree search to O(d), where d is the depth of the tree. This new work reduces the memory required by the architecture, and can also further reduce the time complexity.
Metadata
Item Type: | Book Section |
---|---|
Authors/Creators: |
|
Editors: |
|
Dates: |
|
Institution: | The University of York |
Academic Units: | The University of York > Faculty of Sciences (York) > Computer Science (York) |
Depositing User: | Pure (York) |
Date Deposited: | 25 Apr 2014 14:00 |
Last Modified: | 08 Feb 2025 00:10 |
Published Version: | https://doi.org/10.1007/978-3-642-40728-4_13 |
Status: | Published |
Publisher: | Springer |
Series Name: | Lecture Notes in Computer Science |
Refereed: | Yes |
Identification Number: | 10.1007/978-3-642-40728-4_13 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:75674 |
Download
Filename: improvingTheAssociativeRuleChainingArchitecture_final.pdf
Description: Improving the Associative Rule Chaining Architecture