• Jun 13, 2017 News!The submission for 2018 7th International Conference on Information and Electronics Engineering (ICIEE 2018) is officially open now !   [Click]
  • Oct 20, 2017 News!IJIEE Vol. 7, No. 6 issue has been published online!   [Click]
  • Sep 28, 2017 News!IJIEE Vol. 7, No. 5 issue has been published online!   [Click]
General Information
Editor-in-chief

 
Faculty of Science, University of Brunei Darussalam, Brunei Darussalam   
" It is a great honor to serve as the editor-in-chief of IJIEE. I'll work together with the editorial team. Hopefully, IJIEE will be recognized among the readers in the related field."
IJIEE 2012 Vol.2(2): 253-258 ISSN: 2010-3719
DOI: 10.7763/IJIEE.2012.V2.93

The Base Strategy for ID3 Algorithm of Data Mining Using Havrda and Charvat Entropy Based on Decision Tree

Nishant Mathur, Sumit Kumar, Santosh Kumar, and Rajni Jindal

Abstract—Data mining is used to extract the required data from large databases [1]. The data mining algorithm is the mechanism that creates mining models [2]. To create a model, an algorithm first learns the rules from a set of data then looks for specific required patterns and trends according to those rules. The algorithm then uses the fallouts of this exploration to delineate the constraints of the mining model [2]. These constraints are then applied through the intact data set to extract the unlawful patterns and detailed statistics [2]. Decision-tree learning is one of the utmost efficacious erudition algorithms, due to its various eye-catching features: simplicity, comprehensibility, no parameters, and being able to handle mixed-type data [3]; ID3 is a simple decision tree erudition algorithm developed by Ross Quinlan (1983) [4]. This paper introduces the use of ID3 algorithm [4] of decision tree and we use Havrda and Charvat Entropy instead of Shannon Entropy [5]. By computing information we set particular property from taken data as root of tree, also sub-root by repeating the process continually, to finally build the most optimized tree. This decision tree helps to take the decision for better analysis of data. Decision tree algorithm is used to select the best path to follow in the standard division. This paper introduces the use of ID3 algorithm of decision tree. We are using Havrda and Charvat Entropy Instead of Shannon Entropy. This Decision Tree helps in taking the better decision to analyse the data.

Index Terms—Data mining, decision tree, Shanon entropy, Havrda and Charvat entropy, ID3 algorithm, knowledge-driven decisions.

Data mining, decision tree, Shanon entropy, Havrda and Charvat entropy, ID3 algorithm, knowledge-driven decisions.
Sumit Kumar and Santosh Kumar are with the Department of Computer Science and Engineering, Indian Institute of Technology Patna, Patna, India (e-mail: sumit.itech@gmail.com, mrsonuk@gmail.com).
R. Jindal is with Delhi Technological University, India (e-mail: rajnijindal@dce.ac.in).

[PDF]

Cite: Nishant Mathur, Sumit Kumar, Santosh Kumar, and Rajni Jindal, "The Base Strategy for ID3 Algorithm of Data Mining Using Havrda and Charvat Entropy Based on Decision Tree," International Journal of Information and Electronics Engineering vol. 2, no. 2, pp. 253-258, 2012.

Copyright © 2008-2017. International Journal of Information and Electronics Engineering. All rights reserved.
E-mail: ijiee@ejournal.net