Using Game Theory to Handle Missing Data at Prediction Time of ID3 and C4.5 Algorithms
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2018, Vol 9, Issue 12
Abstract
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.
Authors and Affiliations
Halima Elaidi, Zahra Benabbou, Hassan Abbar
OJADEAC: An Ontology Based Access Control Model for JADE Platform
Java Agent Development Framework (JADE) is a software framework to make easy the development of Multi-Agent applications in compliance with the Foundation for Intelligent Physical Agents (FIPA) specifications. JADE propo...
Determining the Types of Diseases and Emergency Issues in Pilgrims During Hajj: A Literature Review
Introduction: Every year 2-3 million pilgrims with different background and most of them are elderly from 184 countries in the world congregate in the holy place ‘Haram’ at Makkah in Saudi Arabia to perform Hajj. During...
A Modified clustering for LEACH algorithm in WSN
Node clustering and data aggregation are popular techniques to reduce energy consumption in large Wireless Sensor Networks (WSN). Cluster based routing is always a hot research area in wireless sensor networks. Classical...
LOD Explorer: Presenting the Web of Data
The quantity of data published on the Web according to principles of Linked Data is increasing intensely. However, this data is still largely limited to be used up by domain professionals and users who understand Linked...
Applications of Some Topological Near Open Sets to Knowledge Discovery
In this paper, we use some topological near open sets to introduce the rough set concepts such as near open lower and near open upper approximations. Also, we study the concept of near open, rough set and some of their b...