Alpha-Beta Associative Memories

A method for diagnosing Parkinson's disease is presented. The proposal is based on associative approach, and we used this method for classifying patients with Parkinson's disease and those who are completely healthy. In particular, Alpha-Beta Bidirectional Associative Memory is used together with the modified Johnson-Möbius codification in order to deal with mixed noise. We use three methods for testing the performance of our method: Leave-One-Out, Hold-Out and K-fold Cross Validation and the average obtained was of 97.17%.

A method for diagnosing Parkinson's disease is presented. The proposal is based on associative approach, and we used this method for classifying patients with Parkinson's disease and those who are completely healthy. In particular, Alpha-Beta Bidirectional Associative Memory is used together with the modified Johnson-Möbius codification in order to deal with mixed noise. We use three methods for testing the performance of our method: Leave-One-Out, Hold-Out and K-fold Cross Validation and the average obtained was of 97.17%.

An associative memory is a binary relationship between inputs and outputs, which is stored in an M matrix. In this paper, we propose a modification of the Steinbuch Lernmatrix model in order to process real-valued patterns, avoiding binarization processes and reducing computational burden. The proposed model is used in experiments with noisy environments, where the performance and efficiency of the memory is proven. A comparison between the proposed and the original model shows a good response and efficiency in the classification process of the new Lernmatrix.

Morphological Neural Networks (MNN) have been proposed as associative memories (with its two cases: autoassociative and heteroassociative). In this paper we are involved with Heteroassociative MNN (HMNN). We propose their use for selflocalization in a vision-based navigation framework for mobile robots. HMNN can be trained in a single computation step. Their storage capacity bound is the dimension of the patterns, and they have perfect recall of the pattens under very mild conditions. Recall is also very fast, because the MNN recall does not involve the search for an energy minimum.

An associative memory is a binary relationship between inputs and outputs, which is stored in an M matrix. In this paper, we propose a modification of the Steinbuch Lernmatrix model in order to process real-valued patterns, avoiding binarization processes and reducing computational burden. The proposed model is used in experiments with noisy environments, where the performance and efficiency of the memory is proven. A comparison between the proposed and the original model shows a good response and efficiency in the classification process of the new Lernmatrix.

Most models of Bidirectional Associative Memories intend to achieve that all trained patterns correspond to stable states; however, this has not been possible. Also, none of the former models has been able to recall all the trained patterns. A new model which appeared recently, called Alpha-Beta Bidirectional Associative Memory (BAM), recalls 100% of the trained patterns, without error. Also, the model is non iterative and has no stability problems. In this work the analysis of time and space complexity of the Alpha-Beta BAM is presented.

In contrast to conventional feedback bidirectional associative Memory (BAM) network models, a feedforward BAM network is developed based on a one-shot design algorithm of (2 (+)) computational complexity, where is the number of prototype pairs and are the dimensions of the input/output bipolar vectors. The feedforward BAM is an-three-layer network of McCulloch-Pitts neurons with storage capacity 2 min and guaranteed perfect bidirectional recall. The overall network design procedure is fully scalable in the sense that any number 2 min of bidirectional associations can be implemented. The prototype patterns may be arbitrarily correlated. With respect to inference performance, it is shown that the Hamming attractive radius of each prototype reaches the maximum possible value. Simulation studies and comparisons illustrate and support these theoretical developments.

An associative memory is a binary relationship between inputs and outputs, which is stored in an M matrix. In this paper, we propose a modification of the Steinbuch Lernmatrix model in order to process real-valued patterns, avoiding binarization processes and reducing computational burden. The proposed model is used in experiments with noisy environments, where the performance and efficiency of the memory is proven. A comparison between the proposed and the original model shows a good response and efficiency in the classification process of the new Lernmatrix.

 Users may download and print one copy of any publication from the public portal for the purpose of private study or research.  You may not further distribute the material or use it for any profit-making activity or commercial gain  You may freely distribute the URL identifying the publication in the public portal If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.

An associative memory is a binary relationship between inputs and outputs, which is stored in an M matrix. In this paper, we propose a modification of the Steinbuch Lernmatrix model in order to process real-valued patterns, avoiding binarization processes and reducing computational burden. The proposed model is used in experiments with noisy environments, where the performance and efficiency of the memory is proven. A comparison between the proposed and the original model shows a good response and efficiency in the classification process of the new Lernmatrix.

An associative memory is a binary relationship between inputs and outputs, which is stored in an M matrix. In this paper, we propose a modification of the Steinbuch Lernmatrix model in order to process real-valued patterns, avoiding binarization processes and reducing computational burden. The proposed model is used in experiments with noisy environments, where the performance and efficiency of the memory is proven. A comparison between the proposed and the original model shows a good response and efficiency in the classification process of the new Lernmatrix.

Bidirectional Associative Memories BAMs based on first model proposed by Kosko do not have perfect recall of training set, and their algorithm must iterate until it reaches a stable state. In this work, we use the model of Alpha-Beta BAM to classify automatically cancer recurrence in female patients with a previous breast cancer surgery. Alpha-Beta BAM presents perfect recall of all the training patterns and it has a one-shot algorithm; these advantages make to Alpha-Beta BAM a suitable tool for classification. We use data from Haberman database, and leave-one-out algorithm was applied to analyze the performance of our model as classifier. We obtain a percentage of classification of 99.98%.

Artificial Intelligence has been present since more than two decades ago, in the treatment of data concerning the protection of the environment; in particular, various groups of researchers have used genetic algorithms and artificial neural networks in the analysis of data related to the atmospheric sciences and the environment. However, in this kind of applications has been conspicuously absent from the associative models, by virtue of which the classic associative techniques exhibit very low yields. This article presents the results of applying Alpha-Beta associative models in the analysis and prediction of the levels of Carbon Monoxide (CO) and Nitrogen Oxides (NO x) in Mexico City

Bidirectional Associative Memories BAMs based on first model proposed by Kosko do not have perfect recall of training set, and their algorithm must iterate until it reaches a stable state. In this work, we use the model of Alpha-Beta BAM to classify automatically cancer recurrence in female patients with a previous breast cancer surgery. Alpha-Beta BAM presents perfect recall of all the training patterns and it has a one-shot algorithm; these advantages make to Alpha-Beta BAM a suitable tool for classification. We use data from Haberman database, and leave-one-out algorithm was applied to analyze the performance of our model as classifier. We obtain a percentage of classification of 99.98%.

An associative memory is a binary relationship between inputs and outputs, which is stored in an M matrix. In this paper, we propose a modification of the Steinbuch Lernmatrix model in order to process real-valued patterns, avoiding binarization processes and reducing computational burden. The proposed model is used in experiments with noisy environments, where the performance and efficiency of the memory is proven. A comparison between the proposed and the original model shows a good response and efficiency in the classification process of the new Lernmatrix.

The Lernmatrix, which is the first known model of associative memory, is an heteroassociative memory, but it can also act as a binary pattern classifier depending on the choice of the output patterns. However, this model suffers two great problems: saturation and imperfect recall of some of the associations, even in the fundamental set, depending on the associations. In this work, a modification to the original Lernmatrix recall phase algorithm is presented. This modification improves the recalling capacity of the original model. Experimental results show this improvement

Este artículo es la continuación del trabajo presentado en (Sánchez-Garfias et al, 2002) y muestra los avances en el desarrollo de un marco teórico para describir el comportamiento de la Lernmatrix, Memoria Asociativa creada en 1961 por el científico alemán Karl Steinbuch. Los resultados obtenidos permiten colocar a la Lernmatrix, después cuatro décadas de haber surgido, como una buena alternativa para clasificación y reconocimiento de patrones

An associative memory is a binary relationship between inputs and outputs, which is stored in an M matrix. In this paper, we propose a modification of the Steinbuch Lernmatrix model in order to process real-valued patterns, avoiding binarization processes and reducing computational burden. The proposed model is used in experiments with noisy environments, where the performance and efficiency of the memory is proven. A comparison between the proposed and the original model shows a good response and efficiency in the classification process of the new Lernmatrix.

In this paper, an algorithm which enables Alpha-Beta associative memories to learn and recall color images is presented. The latter is done even though these memories were originally designed by Yáñez-Márquez [1] to work only with binary patterns. Also, an experimental study on the proposed algorithm is presented, showing the efficiency of the new memories.

An associative memory is a binary relationship between inputs and outputs, which is stored in an M matrix. In this paper, we propose a modification of the Steinbuch Lernmatrix model in order to process real-valued patterns, avoiding binarization processes and reducing computational burden. The proposed model is used in experiments with noisy environments, where the performance and efficiency of the memory is proven. A comparison between the proposed and the original model shows a good response and efficiency in the classification process of the new Lernmatrix.

This work attempts to understand the intricacies of the working model of Neural Networks in pattern recognition. The system recognizes the input pattern against the stored ones. It also accepts some decent amount of noise in the input pattern and aims at efficiently recognizing the pattern correctly. The objective of this system is to find how effectively it recognizes characters that are stored as patterns in the system and map the input to the stored pattern, when the input patterns are diversified. And in order to achieve this, the idea of Bidirectional Associative Memory is used. Bidirectional Associative Memory is a two level non linear neural network. One important performance attribute of discrete BAM is the ability to recall the stored pairs particularly in the presence of noise. This is one of the main objective of the system, to recognize patterns in the presence of some permissible noise and study how the system has problems with recalling correct patterns when the training samples are not diversified.

Artificial Intelligence has been present since more than two decades ago, in the treatment of data concerning the protection of the environment; in particular, various groups of researchers have used genetic algorithms and artificial neural networks in the analysis of data related to the atmospheric sciences and the environment. However, in this kind of applications has been conspicuously absent from the associative models, by virtue of which the classic associative techniques exhibit very low yields. This article presents the results of applying Alpha-Beta associative models in the analysis and prediction of the levels of Carbon Monoxide (CO) and Nitrogen Oxides (NO x ) in Mexico City.

Pattern reconstruction or pattern restoration in the presence of noise is a main problem in pattern recognition. An essential feature of the noise acting on a pattern is its local nature. If a pattern is split into enough sub-patterns, a few of them will be less or more affected by noise, others will remain intact. In this paper, we propose a simple but effective methodology that exploits this fact for the efficient restoration of a pattern. A pattern is restored if enough of its sub-patterns are also restored. Since several patterns can share the same sub-patterns, the final decision is accomplished by means of a voting mechanism. Before deciding if a sub-pattern belongs to a pattern, sub-pattern restoration in the presence of noise is done by an associative memory. Numerical and real examples are given to show the effectiveness of the proposal. Formal conditions under which the proposal guaranties perfect restoration of a pattern from an unaltered or and altered version of it are also given.

Pattern reconstruction or pattern restoration in the presence of noise is a main problem in pattern recognition. An essential feature of the noise acting on a pattern is its local nature. If a pattern is split into enough sub-patterns, a few of them will be less or more affected by noise, others will remain intact. In this paper, we propose a simple but effective methodology that exploits this fact for the efficient restoration of a pattern. A pattern is restored if enough of its sub-patterns are also restored. Since several patterns can share the same sub-patterns, the final decision is accomplished by means of a voting mechanism. Before deciding if a sub-pattern belongs to a pattern, sub-pattern restoration in the presence of noise is done by an associative memory. Numerical and real examples are given to show the effectiveness of the proposal. Formal conditions under which the proposal guaranties perfect restoration of a pattern from an unaltered or and altered version of it are also given.

The Lernmatrix, which is the first known model of associative memory, is a hetereoassociative memory that presents the problem of incorrect pattern recall, even in the fundamental set, depending on the associations. In this work we propose a new algorithm and the corresponding theoretical support to improve the recalling capacity of the original model.

One of the most important genomic tasks is the identification of promoters and splice-junction zone, which are essential on deciding whether there is a gene or not in a genome sequence. This problem could be seen as a classification problem, therefore the use of computational algorithms for both, pattern recognition and classification are a natural option to face it. In this chapter we develop a pattern classifier algorithm that works notably with bioinformatics databases. The associative memories model on which the classifier is based is the Alpha-Beta model. In order to achieve a good classification performance it was necessary to develop a new heteroassociative memories algorithm that let us recall the complete fundamental set. The heteroassociative memories property of recalling all the fundamental patterns is not so common; actually, no previous model of heteroassociative memory can guarantee this property. Thus, creating such a model is an important contribution. In addition, an heteroasociative Alpha-Beta multimemory is created, as a fundamental base for the proposed classifier.

Abstract Morphological neural networks (MNN) have been proposed as associative memories (with its two cases: autoassociative and heteroassociative). In this paper we are involved with heteroassociative MNN (HMNN). We propose their use for self-localization in a vision-based navigation framework for mobile robots. HMNN can be trained in a single computation step. Their storage capacity bound is the dimension of the patterns, and they have perfect recall of the patterns under very mild conditions.

Bidirectional Associative Memories BAMs based on first model proposed by Kosko do not have perfect recall of training set, and their algorithm must iterate until it reaches a stable state. In this work, we use the model of Alpha-Beta BAM to classify automatically cancer recurrence in female patients with a previous breast cancer surgery. Alpha-Beta BAM presents perfect recall of all the training patterns and it has a one-shot algorithm; these advantages make to Alpha-Beta BAM a suitable tool for classification. We use data from Haberman database, and leave-one-out algorithm was applied to analyze the performance of our model as classifier. We obtain a percentage of classification of 99.98%.

Most models of Bidirectional associative memories intend to achieve that all trained pattern correspond to stable states; however, this has not been possible. Also, none of the former models has been able to recall all the trained patterns. In this work we introduce a new model of bidirectional associative memory which is not iterative and has no stability problems. It is based on the Alpha-Beta associative memories. This model allows, besides correct recall of noisy patterns, perfect recall of all trained patterns, with no ambiguity and no conditions. An example of fingerprint recognition is presented.

Bidirectional Associative Memories (BAM) based on Kosko's model are implemented through iterative algorithms and present stability problems. Also, these models along with other models based on different methods, have not been able to perfectly recall all trained patterns. In this paper we present an English-Spanish / Spanish-English translator based on a new BAM model denominated Alpha-Beta BAM, whose process is non iterative and does not require to find stable states. The translator recalls the whole set of learned patterns, even when the presented word is incomplete.

Memories have been one of the most important models for pattern recognition, being the Alpha-Beta Associative Memories the best available model today. In this paper we propose the use of Binary Decision Diagrams to represent Alpha-Beta associative memories. By doing so, we will be able to merge two important and very active areas of contemporary scientific research, and improve on both models.

Bidirectional Associative Memories (BAM) based on Kosko's model are implemented through iterative algorithms and present stability problems. Also, these models along with other models based on different methods, have not been able to perfectly recall all trained patterns. In this paper we present an English-Spanish / Spanish-English translator based on a new BAM model denominated Alpha-Beta BAM, whose process is non iterative and does not require to find stable states. The translator recalls the whole set of learned patterns, even when the presented word is incomplete.

The Lernmatrix, which is the first known model of associative memory, is an heteroassociative memory, but it can also act as a binary pattern classifier depending on the choice of the output patterns. However, this model suffers two great problems: saturation and imperfect recall of some of the associations, even in the fundamental set, depending on the associations. In this work, a modification to the original Lernmatrix recall phase algorithm is presented. This modification improves the recalling capacity of the original model. Experimental results show this improvement

Most models of Bidirectional associative memories intend to achieve that all trained pattern correspond to stable states; however, this has not been possible. Also, none of the former models has been able to recall all the trained patterns. In this work we introduce a new model of bidirectional associative memory which is not iterative and has no stability problems. It is based on the Alpha-Beta associative memories. This model allows, besides correct recall of noisy patterns, perfect recall of all trained patterns, with no ambiguity and no conditions. An example of fingerprint recognition is presented.

Most models of Bidirectional associative memories intend to achieve that all trained pattern correspond to stable states; however, this has not been possible. Also, none of the former models has been able to recall all the trained patterns. In this work we introduce a new model of bidirectional associative memory which is not iterative and has no stability problems. It is based on the Alpha-Beta associative memories. This model allows, besides correct recall of noisy patterns, perfect recall of all trained patterns, with no ambiguity and no conditions. An example of fingerprint recognition is presented.

Bidirectional Associative Memories (BAM) based on Kosko's model are implemented through iterative algorithms and present stability problems. Also, these models along with other models based on different methods, have not been able to perfectly recall all trained patterns. In this paper we present an English-Spanish / Spanish-English translator based on a new BAM model denominated Alpha-Beta BAM, whose process is non iterative and does not require to find stable states. The translator recalls the whole set of learned patterns, even when the presented word is incomplete.