Theory and Application of Cellular Automata For Pattern Classification

This paper presents the theory and application of a high speed, low cost pattern classifier. The proposed classifier is built around a special class of sparse network referred to as Cellular Automata (CA). A specific class of CA, termed as Multiple Attractor Cellular Automata (MACA), has been evolve...

Full description

Saved in:
Bibliographic Details
Published inFundamenta informaticae Vol. 58; no. 3-4; pp. 321 - 354
Main Authors Maji, Pradipta, Shaw, Chandrama, Ganguly, Niloy, Sikdar, Biplab K., Chaudhuri, P. Pal
Format Journal Article
LanguageEnglish
Published London, England SAGE Publications 01.12.2003
Subjects
Online AccessGet full text
ISSN0169-2968
1875-8681
DOI10.3233/FUN-2003-583-408

Cover

More Information
Summary:This paper presents the theory and application of a high speed, low cost pattern classifier. The proposed classifier is built around a special class of sparse network referred to as Cellular Automata (CA). A specific class of CA, termed as Multiple Attractor Cellular Automata (MACA), has been evolved through Genetic Algorithm (GA) formulation to perform the task of pattern classification. The versatility of the classification scheme is illustrated through its application in three diverse fields - data mining, image compression, and fault diagnosis. Extensive experimental results demonstrate better performance of the proposed scheme over popular classification algorithms in respect of memory overhead and retrieval time with comparable classification accuracy. Hardware architecture of the proposed classifier has been also reported.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0169-2968
1875-8681
DOI:10.3233/FUN-2003-583-408