Using Game Theory to Handle Missing Data at Prediction Time of ID3 and C4.5 Algorithms

The raw material of our paper is a well known and commonly used type of supervised algorithms: decision trees. Using a training data, they provide some useful rules to classify new data sets. But a data set with missing values is always the bane of a data scientist. Even though decision tree algorithms such as ID3 and C4.5 (the two algorithms with which we are working in this paper) represent some of the simplest pattern classification algorithms that can be applied in many domains, but with the drawback of missing data the task becomes harder because they may have to deal with unknown values in two major steps: at training step and at prediction step. This paper is involved in the processing step of databases using trees already constructed to classify the objects of these data sets. It comes with the idea to overcome the disturbance of missing values using the most famous and the central concept of the game theory approach which is the Nash equilibrium.

@article{Elaidi2018,
  title     = {Using Game Theory to Handle Missing Data at Prediction Time of ID3 and C4.5 Algorithms},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {9},
  number    = {12},
  year      = {2018},
  publisher = {The Science and Information Organization},
  author    = {Halima Elaidi and Zahra Benabbou and Hassan Abbar},
  doi       = {10.14569/IJACSA.2018.091232},
  url       = {https://doi.org/10.14569/IJACSA.2018.091232}
}