Abstract
A new association scheme which can still recall appropriate data when some key elements are missing (blank) is presented. The traditional associative memory models are designed to deal with complete (memorized) keys, but in the real world, key elements are often missing due to error, equipment failure, observation difficulty, etc. The traditional models, in this case, can not have an optimal association except for special cases. When an incomplete key containing blanks is given, we wish to get the same data, as nearly as possible, as would be obtained with the complete key. In this paper, the optimal associative memory model which operates with partly missing keys is proposed. The model is constructed on the basis of the theory of the pseudoinverse of matrices. Even from the incomplete keys which contain a large percentage of blanks, the model recalls the appropriate data optimally under the MSE criterion. From the results of computer simulations, we can show that the model has the expected ability.
Similar content being viewed by others
References
Dixon, J.: Pattern recognition with partly missing data. IEEE Trans. Syst. Man Cybern.9, 617–621 (1979)
Greville, T.N.E.: Some applications of the pseudoinverse of a matrix. SIAM Rev.2, 15–22 (1960)
Kittler, J.: Classification of incomplete pattern vectors using modified discriminant functions. IEEE Trans. Comput.27, 367–375 (1978)
Kohonen, T.: Correlation matrix memories. IEEE Trans. Comput.21, 353–359 (1972)
Kohonen, T., Ruohonen, M.: Representation of associated data by matrix operators. IEEE Trans. Comput.22, 701–702 (1973)
Kohonen, T.: An adaptive associative memory principle. IEEE Trans. Comput.23, 444–445 (1974)
Kohonen, T., Reuhkala, E., Mäkisara, K., Vainio, L.: Associative recall of images. Biol. Cybern.22, 159–168 (1976)
Kohonen, T.: Associative memory: a system theoretical approach. Berlin, Heidelberg, New York: Springer 1977
Nakano, K.: Associatron-a model of associative memory. IEEE Trans. Syst. Man Cybern.2, 380–388 (1972)
Murakami, K., Akaishi, S., Aibara, T.: On optimal assoviative recall by an incomplete key. Biol. Cybern.30, 95–97 (1978)
Murakami, K., Aibara, T.: Construction of a distributed associative memory on the basis of Bayes discriminant rule. IEEE Trans. Pattern Anal. Mach. Intellig.3, 210–214 (1981)
Penrose, R.: On best approximate solutions of linear matrix equations. Proc. Cambridge Philos. Soc.52, 17–19 (1956)
Poggio, T.: On optimal nonlinear associative recall. Biol. Cybern.19, 201–209 (1975)
Reid, R.J., Frame, J.S.: Convergence in iteratively formed correlation matrix memories. IEEE Trans. Comput.24, 827–830 (1975)
Steinbuch, K., Piske, U.A.W.: Learning matrices and their applications. IEEE Trans. Electron. Comput.12, 846–862 (1963)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Murakami, K., Aibara, T. Optimal association with partly missing key vectors. Biol. Cybernetics 44, 151–155 (1982). https://doi.org/10.1007/BF00317975
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00317975