A comparative study of decision tree ID3 and C4.5

Data mining is the useful tool to discovering the knowledge from large data. Different methods & algorithms are available in data mining. Classification is most common method used for finding the mine rule from the large database. Decision tree method generally used for the Classification, because it is the simple hierarchical structure for the user understanding & decision making. Various data mining algorithms available for classification based on Artificial Neural Network, Nearest Neighbour Rule & Baysen classifiers but decision tree mining is simple one. ID3 and C4.5 algorithms have been introduced by J.R Quinlan which produce reasonable decision trees. The objective of this paper is to present these algorithms. At first we present the classical algorithm that is ID3, then highlights of this study we will discuss in more detail C4.5 this one is a natural extension of the ID3 algorithm. And we will make a comparison between these two algorithms and others algorithms such as C5.0 and CART.

@article{HSSINA2014,
  title     = {A comparative study of decision tree ID3 and C4.5},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {4},
  number    = {2},
  year      = {2014},
  publisher = {The Science and Information Organization},
  note      = {Special Issue on Advances in Vehicular Ad Hoc Networking and Applications 2014},
  author    = {Badr HSSINA and Abdelkarim MERBOUHA and Hanane EZZIKOURI and Mohammed ERRITALI},
  doi       = {10.14569/SpecialIssue.2014.040203},
  url       = {https://doi.org/10.14569/SpecialIssue.2014.040203}
}