DocumentCode :
1965236
Title :
A Classifier Build Around Cellular Automata for Distributed Data Mining
Author :
Zhou, Lianying ; Yang, Mingxin
Author_Institution :
Inst. of Comput. Sci. & Telecommun. Eng., Jiangsu Univ., Zhenjiang
Volume :
4
fYear :
2008
fDate :
12-14 Dec. 2008
Firstpage :
312
Lastpage :
315
Abstract :
A pattern classifying machine (PCM) ts-PCM for distributed data mining (DDM) was designed in this article. ts-PCM is based on a special class of linear cellular automata (CA), termed as mutiple attractor CA (MACA). Each MACA could be distributed in different sites as a base classifier. Characterization of a MACA based two stage by two linear operators of dependency string (DS) and dependency vector (DV) other than dependency matrix of the CA used to be, and employing genetic algorithm (GA) formulation. Its classification complexity has been declined from O(n3) to O(n). Plentiful experimental results have proved the potential of ts-PCM,and with the respect to excellent classification accuracy and low memory overhead established the availability of the classifier to manipulate the distributed data mining.
Keywords :
cellular automata; data mining; distributed databases; genetic algorithms; matrix algebra; pattern classification; cellular automata; dependency string; dependency vector; distributed data mining; genetic algorithm; pattern classifying machine; Algorithm design and analysis; Automata; Classification algorithms; Computer science; Data engineering; Data mining; Design engineering; Genetic engineering; Phase change materials; Software engineering; cellular automata; classification; date mining; ts-PCM;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Science and Software Engineering, 2008 International Conference on
Conference_Location :
Wuhan, Hubei
Print_ISBN :
978-0-7695-3336-0
Type :
conf
DOI :
10.1109/CSSE.2008.830
Filename :
4722623
Link To Document :
بازگشت