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


  • WK Wong Curtin University, Miri, Malaysia
  • Gopal Lenin Curtin University, Miri, Malaysia
  • Terence Tan Curtin University, Miri, Malaysia
  • Chekima Ali Universiti Malaysia Sabah (UMS), Malaysia.


Cartesian Genetic Programming (CGP), Evolutionary-based Classifier, Clustering,


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%).




How to Cite

Wong, W., Lenin, G., Tan, T., & Ali, C. (2018). Euclidean Space Data Projection Classifier with Cartesian Genetic Programming (CGP). Journal of Telecommunication, Electronic and Computer Engineering (JTEC), 10(1-12), 9–12. Retrieved from