Abstract

This paper describes new work on partial match using Correlation Matrix Memory (CMM), a type of binary associative neural network. It has been proposed that CMM can be used as an inference engine for expert systems, and we suggest that a partial match ability is essential to enable a system to deal with real world problems. Now, an emergent property of CMM is an ability to perform partial match, which may make CMM a better choice of inference engine than other methods that do not have partial match. Given this, the partial match characteristics of CMM have been investigated both analytically and experimentally, and these characteristics are shown to be very desirable. CMM partial match performance is also compared with a standard database indexing method that supports partial match (Multilevel Superimposed Coding), which shows CMM to compare well under certain cirumstances, even with this heavily optimised method. Parallels are drawn with cognitive psychology and human memory.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.