scholarly journals Optimization of Management Mode of Small- and Medium-Sized Enterprises Based on Decision Tree Model

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Yuzhu Diao ◽  
Qing Zhang
Keyword(s):  
Project Management ◽  
Decision Tree ◽  
Performance Appraisal ◽  
Information Gain ◽  
Decision Tree Algorithm ◽  
Management Information ◽  
Report Generation ◽  
Tree Algorithm ◽  
Gain Rate ◽  
C4.5 Algorithm

Decision tree algorithm is a common classification algorithm in data mining technology, and its results are usually expressed in the form of if-then rules. The C4.5 algorithm is one of the decision tree algorithms, which has the advantages of easy to understand and high accuracy, and the concept of information gain rate is added compared with its predecessor ID3 algorithm. After theoretical analysis, C4.5 algorithm is chosen to analyze the performance appraisal results, and the decision tree for performance appraisal is generated by collecting data, data preprocessing, calculating information gain rate, determining splitting attributes, and postpruning. The system is developed in B/S architecture, and an R&D project management system and platform that can realize performance assessment analysis are built by means of visualization tools, decision tree algorithm, and dynamic web pages. The system includes information storage, task management, report generation, role authority control, information visualization, and other management information system functional modules. They can realize the project management functions such as project establishment and management, task flow, employee information filling and management, performance assessment system establishment, report generation of various dimensions, management cockpit construction. With decision tree algorithm as the core technology, the system obtains scientific and reliable project management information with high accuracy and realizes data visualization, which can assist enterprises to establish a good management system in the era of big data.

Research on Asset Recognition Algorithm of Information Security Product Based on Decision Tree Algorithm

2013 ◽  
Vol 397-400 ◽  
pp. 2296-2300 ◽  
Author(s):  
Fei Shuai ◽  
Jun Quan Li
Keyword(s):  
Computational Complexity ◽  
Information Security ◽  
Decision Tree ◽  
Recognition Algorithm ◽  
Space Complexity ◽  
Complex Relationship ◽  
Decision Tree Algorithm ◽  
Tree Algorithm ◽  
C4.5 Algorithm ◽  
C4.5 Decision Tree

In current, there are complex relationship between the assets of information security product. According to this characteristic, we propose a new asset recognition algorithm (ART) on the improvement of the C4.5 decision tree algorithm, and analyze the computational complexity and space complexity of the proposed algorithm. Finally, we demonstrate that our algorithm is more precise than C4.5 algorithm in asset recognition by an application example whose result verifies the availability of our algorithm.Keywordsdecision tree, information security product, asset recognition, C4.5

Classifier Ensemble Algorithm for Data Stream with Attribute Uncertainty

2016 ◽  
Vol 13 (10) ◽  
pp. 7519-7525 ◽  
Author(s):  
Zhang Xing ◽  
Wang MeiLi ◽  
Zhang Yang ◽  
Ning Jifeng
Keyword(s):  
Decision Tree ◽  
Data Stream ◽  
High Speed ◽  
Information Gain ◽  
Uncertain Data ◽  
Classifier Ensemble ◽  
Ensemble Classifiers ◽  
Decision Tree Algorithm ◽  
Tree Algorithm ◽  
Ensemble Algorithm

To build a classifier for uncertain data stream, an Ensemble of Uncertain Decision Tree Algorithm (EDTU) is proposed. Firstly, the decision tree algorithm for uncertain data (DTU) was improved by changing the calculation method of its information gain and improving the efficiency of the algorithm so that it can process the high-speed flow of data streams; then, based on this basic classifier, dynamic classifier ensemble algorithm was used, and the classifiers presenting effective classification were selected to constitute ensemble classifiers. Experimental results on SEA and Forest Covertype Datasets demonstrate that the proposed EDTU algorithm is efficient in classifying data stream with uncertain attribute, and the performance is stable under the different parameters.

scholarly journals Decision Tree Algorithm for Mining "If Then Else" Rule in Single Slope Basin Solar Still plant

2020 ◽  
Vol 9 (3) ◽  
pp. 405-410
Keyword(s):  
Decision Making ◽  
Decision Tree ◽  
Information Gain ◽  
Learning Approaches ◽  
Decision Tree Algorithm ◽  
Rule Mining ◽  
Rule Based ◽  
Tree Algorithm ◽  
C4.5 Decision Tree ◽  
Learning Concept

Soft computing dedicatedly works for decision making. In this domain a number of techniques are used for prediction, classification, categorization, optimization, and information extraction. Among rule mining is one of the essential methodologies. “IF Then Else” can work as rules, to classify, or predict an event in real world. Basically, that is rule based learning concept, additionally it is frequently used in various data mining applications during decision making and machine learning. There are some supervised learning approaches are available which can be used for rule mining. In this context decision tree is a helpful algorithm. The algorithm works on data splitting strategy using entropy and information gain. The data information is mapped in a tree structure for developing “IF Then Else” rules. In this work an application of rule based learning is presented for recycling of water in a distillation unit. By using the designed experimental still plant different attributes are collected with the observed distillated yield and instantaneous efficiency. This observed data is learned with the C4.5 decision tree algorithm and also predict the distillated yield and instantaneous efficiency. Finally to classify and predict the required parameters “IF Then Else” rules are prepared. The experimental results demonstrate, the proposed C4.5 algorithm provides higher accuracy as compared to similar state of art techniques. The proposed technique offers up to 5-9% improved outcome in terms of accuracy.

The Analysis and Application of the C4.5 Algorithm in Decision Tree Technology

2012 ◽  
Vol 457-458 ◽  
pp. 754-757
Author(s):  
Hong Yan Zhao
Keyword(s):  
Data Mining ◽  
Decision Tree ◽  
Teaching Quality ◽  
Decision Tree Algorithm ◽  
Tree Algorithm ◽  
C4.5 Algorithm ◽  
C4.5 Decision Tree ◽  
Result Analysis

The Decision Tree technology, which is the main technology of the Data Mining classification and forecast, is the classifying rule that infers the Decision Tree manifestation through group of out-of-orders, the non-rule examples. Based on the research background of The Decision Tree’s concept, the C4.5 Algorithm and the construction of The Decision Tree, the using of C4.5 Decision Tree Algorithm was applied to result analysis of students’ score for the purpose of improving the teaching quality.

An Improved SPRINT Algorithm

2012 ◽  
Vol 532-533 ◽  
pp. 1685-1690 ◽  
Author(s):  
Zhi Kang Luo ◽  
Huai Ying Sun ◽  
De Wang
Keyword(s):  
Machine Learning ◽  
Data Mining ◽  
Decision Tree ◽  
Learning Communities ◽  
Information Gain ◽  
Decision Tree Algorithm ◽  
Tree Algorithm ◽  
Gain Ratio ◽  
Information Gain Ratio ◽  
Improved Algorithm

This paper presents an improved SPRINT algorithm. The original SPRINT algorithm is a scalable and parallelizable decision tree algorithm, which is a popular algorithm in data mining and machine learning communities. To improve the algorithm's efficiency, we propose an improved algorithm. Firstly, we select the splitting attributes and obtain the best splitting attribute from them by computing the information gain ratio of each attribute. After that, we calculate the best splitting point of the best splitting attribute. Since it avoids a lot of calculations of other attributes, the improved algorithm can effectively reduce the computation.

scholarly journals METODE ALGORITMA DECISION TREE C4.5 UNTUK ANALISIS KELAYAKAN KREDIT NASABAH PADA BSM KCP KEMANG PRATAMA

2019 ◽  
Vol 7 (2) ◽  
Author(s):  
Dyah Wulandari ◽  
Nur Lutfiyana ◽  
Heny Sumarno
Keyword(s):  
Decision Tree ◽  
Profit Sharing ◽  
Decision Tree Algorithm ◽  
Tree Algorithm ◽  
Customer Data ◽  
A Value ◽  
C4.5 Algorithm ◽  
C4.5 Decision Tree ◽  
Credit Worthiness

Abstract - Credit is the provision of money or equivalent claims, based on agreements or agreements on loans between banks and other parties which require the borrowing party to repay the debt after a certain period of time with the amount of interest, compensation or profit sharing. From the credit customer data available at BSM KCP Kemang Pratama still has Non Performing Financing (NPF) or Bad Credit.In analyzing a credit sometimes an analyst does an inaccurate analysis, so there are some customers who are less able to make credit payments, resulting in bad credit. So the researchers conducted an analysis using the C4.5 decision tree algorithm and Rapid Miner application for determining credit worthiness. From the analysis of credit customer data using the C4.5 decision tree algorithm method, the feasibility of credit recipient customers is very effective and produces a value of accuracy on Rapid Miner 5.3 of 80%, Precision of 100% and Recall of 0% so as to minimize the risk.Keywords— Credit, C4.5 Algorithm, Rapid Miner, Value AccuracyAbstrak - Kredit merupakan penyediaan uang atau tagihan yang dapat disamakan dengan hal itu, berdasarkan persetujuan atau kesepakatan pinjaman-pinjaman antara bank dengan pihak lain yang mewajibkan pihak peminjam untuk melunasi utangnya setelah jangka waktu tertentu dengan jumlah bunga, imbalan atau pembagian hasil keuntungan. Dari data nasabah kredit yang ada pada BSM KCP Kemang Pratama masih memiliki Non Performing Financing (NPF) atau Kredit Macet. Dalam menganalisa sebuah kredit terkadang seorang analis melakukan analisa tidak akurat, sehingga ada beberapa nasabah yang kurang mampu dalam melakukan pembayaran kredit, dan pada akhirnya mengakibatkan kredit macet. Peneliti melakukan analisis menggunakan algoritma decision tree C4.5 dan aplikasi Rapid Miner untuk penentuan kelayakan pemberian kredit. Dari analisis data nasabah kredit menggunakan metode Algoritma decision tree C4.5 menghasilkan kelayakan nasabah penerima kredit sangat efektif dan menghasilkan nilai akurasi pada Rapid Miner 5.3 sebesar 80%, Precision sebesar 100% dan Recall sebesar 0% sehingga dapat meminimalisir resiko yang terjadi.Kata kunci— Kredit, Algoritma C4.5, Rapid Miner, Nilai Akurasi

An Improved ID3 Decision Tree Algorithm

2014 ◽  
Vol 962-965 ◽  
pp. 2842-2847 ◽  
Author(s):  
Xiao Juan Chen ◽  
Zhi Gang Zhang ◽  
Yue Tong
Keyword(s):  
Decision Tree ◽  
Information Entropy ◽  
Information Gain ◽  
Classification Algorithm ◽  
Learning Ability ◽  
Decision Tree Algorithm ◽  
Tree Algorithm ◽  
Decision Tree Classification ◽  
Id3 Algorithm ◽  
Improved Algorithm

As the classical algorithm of the decision tree classification algorithm, ID3 algorithm is famous for the merits of high classifying speed, strong learning ability and easy construction. But when used to make classification, the problem of inclining to choose attributions which have many values affect its practicality. This paper presents an improved algorithm based on the expectation information entropy and Association Function instead of the traditional information gain. In the improved algorithm, it modified the expectation information entropy with the improved Association Function and the number of the attributes values. The experiment result shows that the improved algorithm can get more reasonable and more effective rules.

The Application of Decision Tree Algorithm in the Employment Management System

2014 ◽  
Vol 543-547 ◽  
pp. 1639-1642 ◽  
Author(s):  
Liang Li ◽  
Ying Zheng ◽  
Xiao Hua Sun ◽  
Fu Shun Wang
Keyword(s):  
Data Mining ◽  
Decision Tree ◽  
Effective Means ◽  
University Graduates ◽  
Decision Tree Algorithm ◽  
Tree Algorithm ◽  
Id3 Algorithm ◽  
Decision Attributes ◽  
C4.5 Algorithm ◽  
Employment Data

According to students' employment problem, employment data mining model of university graduates is presented. The decision tree is very effective means for classification, which is proposed according to the characteristics of employment data and C4.5 algorithm. The C4.5 algorithm is improved from ID3 algorithm that is the core algorithm in the decision tree. The C4.5 algorithm is suitable for its simple construction, high processing speed and easy implementation. The model includes preprocess of the data of employment selection of decision attributes, implementation of mining algorithm, and obtainment of rules from the decision tree. The rules point out which decision attributes decide the classification of employers. Case study shows that the decision tree algorithm applied to employment information data mining, can classify data of employment correctly with simple structure and faster speed, and find some valuable results for analysis and decision. so the proposed algorithm in this paper is effective.

Sign in / Sign up

Export Citation Format

Share Document