2012•IEEE-International Conference On Advances In Engineering, Science And ManagementRequires access

Decision tree induction: Priority classification

Mohammed Mahmood Ali, Lakshmi Rajamani

Open publisher page 6 citations

Abstract

Scalability and efficiency is the major problem for classification algorithms in data mining, for large databases. We have suggested improvements to an existing C4.5 decision tree Algorithm. Particularly, when decision tree induction, used to construct the decision tree. In this paper Attribute oriented induction (AOI) and relevance analysis incorporated with concept hierarchy's knowledge and height-balancing tree (AVL tree) for construction of decision tree. MDL cost can be accurately calculated for decision tree considering nodes, at different levels. The other two aspects discussed in this paper is without and with priority given for attributes, at different levels of abstraction for building decision tree using DMQL, along with multilevel mining applied and the results obtained, are compared with J48/C4.5 classifier.

About this research paper

What this paper is about

Scalability and efficiency is the major problem for classification algorithms in data mining, for large databases. We have suggested improvements to an existing C4.5 decision tree Algorithm. Particularly, when decision tree induction, used to construct the decision tree. In this paper Attribute oriented induction (AOI) and relevance analysis incorporated with concept hierarchy's knowledge and height-balancing tree (AVL tree) for construction of decision tree. MDL cost can be accurately calculated for decision tree considering nodes, at different levels. The other two aspects discussed in this paper is without and with priority given for attributes, at different levels of abstraction for building decision tree using DMQL, along with multilevel mining applied and the results obtained, are compared with J48/C4.5 classifier.

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Scalability and efficiency is the major problem for classification algorithms in data mining, for large databases. We have suggested improvements to an existing C4.5 decision tree Algorithm. Particularly, when decision tree induction, used to construct the decision tree. In this paper Attribute oriented induction (AOI) and relevance analysis incorporated with concept hierarchy's knowledge and height-balancing tree (AVL tree) for construction of decision tree. MDL cost can be accurately calculated for decision tree considering nodes, at different levels. The other two aspects discussed in this paper is without and with priority given for attributes, at different levels of abstraction for building decision tree using DMQL, along with multilevel mining applied and the results obtained, are compared with J48/C4.5 classifier.

Key concepts: Incremental decision tree, Decision tree, C4.5 algorithm, Computer science, Decision tree learning, ID3 algorithm, Decision stump, Data mining

Related papers

Back to paper searchBrowse research topicsOriginal source
Decision tree induction: Priority classification — Research Paper | ScholarLens