Pipelining of Art Architectures (fam, Eam, Gam) without Match Tracking
نویسندگان
چکیده
Adaptive Resonance theory was introduced by Grossberg to address the stability versus plasticity dilemma. That is, how can one design a learning system that is plastic enough to learn new information, and at the same time stable enough not to forget old, important information that it has already learned. In the past two decades a number of ART neural network architectures were introduced in the literature, based on the ART theory. These architectures can solve clustering and classification problems. Our focus in this paper is ART architectures that function like classifiers. ART classifiers have a number of desirable properties, such as guaranteed convergence to a solution for any classification problem of interest, fast convergence to a solution (i.e., they converge in a few epochs, where epoch is a single presentation of all the training data), they can be trained in an on-line fashion, they have the ability to recognize novel inputs, and they can explain the answers that they produce. One of their limitations is that for large database problems, where inevitably a lot of categories (clusters) are created to represent the input data, the convergence to a solution becomes excruciatingly slow, since ART’s complexity is proportional to the product of the input patterns and the number of categories created. To address this problem, Castro had suggested a parallel implementation of Fuzzy ARTMAP (one of the ART classifiers) on a Beowulf cluster. Castro’s implementation was efficient and general enough to apply to other ART architectures, such as Ellipsoidal ARTMAP and Gaussian ARTMAP, which are two other examples of ART classifiers. In this paper we validate this claim, that EAM and GAM can be implemented effectively on a Beowulf cluster, and we verify this claim by presenting appropriate experimental results. What is also worth noting is that Castro’s Fuzzy ARTMAP Beowulf implementation can also be applied to other competitive classifiers, neural network based or not.
منابع مشابه
AG-ART: An adaptive approach to evolving ART architectures
This paper focuses on classification problems, and in particular on the evolution of ARTMAP architectures using genetic algorithms, with the objective of improving generalization performance and alleviating the adaptive resonance theory (ART) category proliferation problem. In a previous effort, we introduced evolutionary fuzzy ARTMAP (FAM), referred to as genetic Fuzzy ARTMAP (GFAM). In this p...
متن کاملEllipsoid ART and ARTMAP for Incremental Clustering and Classification
We introduce Ellipsoid-ART (EA) and Ellipsoid-ARTMAP (EAM) as a generalization of Hyper-sphere ART (HA) and Hypersphere-ARTMAP (HAM) respectively. As was the case with HMHAM, these novel architectures are based on ideas rooted in Fuzzy-ART (FA) and Fuuy-ARTMAP (FAM). While FMFAM aggregate input data using hyperrectangles, EA/EAM utilize hyper-ellipsoids for the same purpose. Due to their learni...
متن کاملHybrid Artmap Neural Networks (hart)
In order to reduce the effect of the category proliferation phenomenon in Fuzzy ARTMAP (FAM) and in ellipsoidal ARTMAP (EAM) architectures, The genetic algorithms were used to evolve networks of both architectures called GFAM and GEAM [3][4]. The results were very promising and the category proliferation (CP) phenomenon was minimized in most of the experiments, however, the author noticed that ...
متن کاملPipelining of Fuzzy Artmap (fam) without Match Tracking
Fuzzy ARTMAP (FAM) is a neural network architecture that can establish the correct mapping between real-valued input patterns and correct labels in a variety of classification problems. Nevertheless, as the size of the dataset grows to thousands and hundreds of thousands, FAM’s convergence time slows down considerably. In this paper we focus on a FAM variant called no-match tracking FAM (NMT-FA...
متن کاملPipelining of Fuzzy–ARTMAP (FAM) without Matchtracking (MT)
Fuzzy ARTMAP (FAM) is a neural network architecture that can establish the correct mapping between real valued input patterns and their correct labels in a variety of classification problems. FAM has many desirable traits. Nevertheless, as the size of the data set grows to thousands, and hundreds of thousands datapoints, FAM’s convergence time slows down considerably. In this paper, we focus on...
متن کامل