Extracting Useful Rules Through Improved Decision Tree Induction Using Information Entropy

  • Mahmood Ali M
  • S. Qaseem M
  • Rajamani L
  • et al.
N/ACitations
Citations of this article
21Readers
Mendeley users who have this article in their library.

Abstract

Classification is widely used technique in the data mining domain, where scalability and efficiency are the immediate problems in classification algorithms for large databases. We suggest improvements to the existing C4.5 decision tree algorithm. In this paper attribute oriented induction (AOI) and relevance analysis are incorporated with concept hierarchy " s knowledge and HeightBalancePriority algorithm for construction of decision tree along with Multi level mining. The assignment of priorities to attributes is done by evaluating information entropy, at different levels of abstraction for building decision tree using HeightBalancePriority algorithm. Modified DMQL queries are used to understand and explore the shortcomings of the decision trees generated by C4.5 classifier for education dataset and the results are compared with the proposed approach. KEYWORDS Attribute oriented induction (AOI), Concept hierarchy, Data Mining Query Language (DMQL), HeightBalancePriority algorithm, Information entropy, C4.5 classifier.

Cite

CITATION STYLE

APA

Mahmood Ali, Mohd., S. Qaseem, Mohd., Rajamani, L., & A, G. (2013). Extracting Useful Rules Through Improved Decision Tree Induction Using Information Entropy. International Journal of Information Sciences and Techniques, 3(1), 27–41. https://doi.org/10.5121/ijist.2013.3103

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free