مواقع التدريسيينجامعة الكوفة
0Publications
0Lectures
0Interests

About

Address : University of Kufa – Information Technology Reserch and Development Center

Academic Degree
M. Sc. In Computer Science, College of Science, University of Baghdad, Baghdad, Iraq (2014). Dissertation title is " An optimized Decision Tree Classification Algorithm for a Data Set".
B. Sc. In Computer Science, Dijlah University College, Baghdad, Iraq (2008).

Research Interests

Data Mining (Including Classification, Clustering)
Data Base (Design and Implementation)
Data Encryption (Text , Image ) Using AES Algorithms

Computer Skills

Good background in computer programming and software development (Visual Basic, C++, Pascal).
Microsoft Office tools (word, excel, visual basic, access and PowerPoint, FrontPage).
Data Mining tools (Weka Software)

Research Interests

7

Publications

2
2014

Improved Accuracy for Decision Tree Algorithm Based on Unsupervised Discretization

AuthorsIhsan A. Kareem , Mehdi G. Duaimi
JournalInternational Journal of Computer Science and Mobile Computing
Abstract

Abstract - A decision tree is an important classification technique in data mining classification. Decision trees have proved to be valuable tools for the classification, description, and generalization of data. Work on building decision trees for data sets exists in multiple disciplines such as signal processing, pattern recognition, decision theory, statistics, machine learning and artificial neural networks. This paper deals with the problem of finding the parameter settings of decision tree algorithm in order to build an accurate tree. The proposed technique is an unsupervised filter. The suggested discretization applies on C4.5 algorithm to construct a decision tree. The improvement on C4.5 algorithm includes two phases: the first phase is discretization all continuous attributes instead of dealing with numerical values. The second phase is constructing a decision tree model and evaluates performance. It has been experimented on three data sets. All those data files are picked up from the popular UCI the (University of California at Irvine) data repository. The results obtained from experiments show C4.5 after discretization better than C4.5 before discretization.

2014

Modified Decision Tree Classification Algorithm for Large Data Sets

AuthorsIhsan A. Kareem, , Mehdi G. Duaimi
JournalIraqi Journal of Science
Abstract

A decision tree is an important classification technique in data mining classification. Decision trees have proved to be valuable tools for the classification, description, and generalization of data. Work on building decision trees for data sets exists in multiple disciplines such as signal processing, pattern recognition, decision theory, statistics, machine learning and artificial neural networks. This research deals with the problem of finding the parameter settings of decision tree algorithm in order to build accurate, small trees, and to reduce execution time for a given domain. The proposed approach (mC4.5) is a supervised learning model based on C4.5 algorithm to construct a decision tree. The modification on C4.5 algorithm includes two phases: the first phase is discretization all continuous attributes instead of dealing with numerical values. The second phase is using the average gain measure instead of gain ratio measure, to choose the best attribute. It has been experimented on three data sets. All those data files are picked up from the popular (UCI) University of California at Irvine data repository. The results obtained from experiments show that (mC4.5) is better than C4.5 in decreasing the total number of nodes without affecting the accuracy; at the same time increasing the accuracy ratio.

Lectures

5
View details