Title

Pipelining of Fuzzy ARTMAP without matchtracking: Correctness, performance bound, and Beowulf evaluation

Authors

Authors

J. Castro; J. Secretan; M. Georgiopoulos; R. DeMara; G. Anagnostopoulos;A. Gonzalez

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

Neural Netw.

Keywords

Fuzzy ARTMAP; data mining; BEOWULF cluster; pipelining; network; partitioning; NEURAL-NETWORK; Computer Science, Artificial Intelligence

Abstract

Fuzzy ARTMAP neural networks have been proven to be good classifiers on a variety of classification problems. However, the time that Fuzzy ARTMAP takes to converge to a solution increases rapidly as the number of patterns used for training is increased. In this paper we examine the time Fuzzy ARTMAP takes to converge to a solution and we propose a coarse grain parallelization technique, based on a pipeline approach, to speed-up the training process. In particular, we have parallelized Fuzzy ARTMAP without the match-tracking mechanism. We provide a series of theorems and associated proofs that show the characteristics of Fuzzy ARTMAP's, without matchtracking, parallel implementation. Results run on a BEOWULF cluster with three large databases show linear speedup as a function of the number of processors used in the pipeline. The databases used for our experiments are the Forrest CoverType database from the UCI Machine Learning repository and two artificial databases, where the data generated were 16-dimensional Gaussian distributed data belonging to two distinct classes, with different amounts of overlap (5% and 15%). (c) 2006 Elsevier Ltd. All rights reserved.

Journal Title

Neural Networks

Volume

20

Issue/Number

1

Publication Date

1-1-2007

Document Type

Article

Language

English

First Page

109

Last Page

128

WOS Identifier

WOS:000243841900009

ISSN

0893-6080

Share

COinS