Euclidean Space Data Projection Classifier with Cartesian Genetic Programming (CGP)

Most evolutionary based classifiers are built based on generated rules sets that categorize the data into respective classes. This research work is a preliminary work which proposes an evolutionary-based classifier using a simplified Cartesian Genetic Programming (CGP) evolutionary algorithm. Instead on using evolutionary generated rule sets, the CGP generates i) a reference coordinate ii) projection functions to project data into a new 3 Dimensional Euclidean space. Subsequently, a distance boundary function of the new projected data to the reference coordinates is applied to classify the data into their respective classes. The evolutionary algorithm is based on a simplified CGP Algorithm using a 1+4 evolutionary strategy. The data projection functions were evolved using CGP for 1000 generations before stopping to extract the best functions. The Classifier was tested using three PROBEN 1 benchmarking datasets which are the PIMA Indians diabetes dataset, Heart Disease dataset and Wisconsin Breast Cancer (WBC) Dataset based on 10 fold cross validation dataset partitioning. Testing results showed that data projection function generated competitive results classification rates: Cancer dataset (97.71%), PIMA Indians dataset (77.92%) and heart disease (85.86%).

[1]  Nawwaf N. Kharma,et al.  Automated synthesis of feature functions for pattern detection , 2010, CCECE 2010.

[2]  Julian Francis Miller,et al.  Evolution and Acquisition of Modules in Cartesian Genetic Programming , 2004, EuroGP.

[3]  Agnė Dzidolikaitė.  Genetic Algorithms for Multidimensional Scaling , 2015 .

[4]  Jürgen Leitner,et al.  MT-CGP: mixed type cartesian genetic programming , 2012, GECCO '12.

[5]  Robert P. W. Duin,et al.  Support Vector Data Description , 2004, Machine Learning.

[6]  Wolfgang Banzhaf,et al.  A comparison of linear genetic programming and neural networks in medical data mining , 2001, IEEE Trans. Evol. Comput..

[7]  Mihai Oltean,et al.  Solving Classification Problems Using Infix Form Genetic Programming , 2003, IDA.

[8]  Chandan Srivastava,et al.  Support Vector Data Description , 2011 .

[9]  Cheng-Wei Dong,et al.  A multi-dimensional visualization method combining MDS and SVM , 2012, ICNC.

[10]  Feng Luan,et al.  Diagnosing Breast Cancer Based on Support Vector Machines. , 2003 .

[11]  Lutz Prechelt,et al.  PROBEN 1 - a set of benchmarks and benchmarking rules for neural network training algorithms , 1994 .

[12]  Julian Francis Miller,et al.  Developments in Cartesian Genetic Programming: self-modifying CGP , 2010, Genetic Programming and Evolvable Machines.

[13]  Anupam Shukla,et al.  Intelligent Decision Support System for Breast Cancer , 2010, ICSI.

[14]  Joydeep Ghosh,et al.  Principal curve classifier-a nonlinear approach to pattern classification , 1998, 1998 IEEE International Joint Conference on Neural Networks Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36227).

[15]  Gul Muhammad Khan,et al.  Fast learning neural networks using Cartesian genetic programming , 2013, Neurocomputing.

[16]  Hussein A. Abbass,et al.  An evolutionary artificial neural networks approach for breast cancer diagnosis , 2002, Artif. Intell. Medicine.

[17]  Pei-Yi Hao,et al.  A new Support Vector classification algorithm with parametric-margin model , 2008, 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence).

[18]  J. Miller.  An empirical study of the efficiency of learning boolean functions using a Cartesian Genetic Programming approach , 1999 .

[19]  Amir F. Atiya,et al.  Self-generating prototypes for pattern classification , 2007, Pattern Recognit..

[20]  Julian F. Miller,et al.  Designing Electronic Circuits Using Evolutionary Algorithms. Arithmetic Circuits: A Case Study , 2007 .