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

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.

2012 ◽  
Vol 457-458 ◽  
pp. 754-757
Author(s):  
Hong Yan Zhao

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.


2012 ◽  
Vol 466-467 ◽  
pp. 308-313
Author(s):  
Dan Guo

The decision tree algorithm is a kind of approximate discrete function value method with high precision, construction model of classification of noise data is simple and has good robustness etc, it is currently the most widely used in one of the inductive reasoning algorithms in data mining, extensive attention by researchers. This paper selects the decision tree ID3 algorithm to realize the standardization of lumber level division, to ensure the accuracy of the lumber division, while improving the partition of speed.


2018 ◽  
Vol 7 (2) ◽  
pp. 200-210
Author(s):  
Ronaldo Syahputra ◽  
Wifra Safitri

The Karate sport is a kind of sport that is quite popular today. All regions in Indonesia are racing to improve the performance of their karate athletes. Various developments were carried out to be able to improve karate sports achievements. This research will later be used as a benchmark for developing and realizing good sports performance, especially in the karate by using the concept of data mining. To apply the concept of Data Mining, one way that can be done is to implement the C4.5 algorithm. C4.5 algorithm or also called decision tree algorithm, is a very strong and well-known classification and prediction method. The application of the concept of data mining with C4.5 algorithm is done by analyzing what factors support the achievement of karate sports. After that, the C4.5 algorithm is calculated to find out what is the most decisive factor in the development of karate sports achievements. This aims to maximize the role of these achievement supporting factors. The results of this study are expected to provide great benefits for the development and improvement of the achievements of karate athletes in West Sumatra.


2014 ◽  
Vol 538 ◽  
pp. 460-464
Author(s):  
Xue Li

Based on inter-correlation and permeability among disciplines, the author makes an attempt to apply the information science to cognitive linguistics to provide a new perspective for the study of foreign languages. The correlation between self-efficacy and such four factors as anxiety, learning strategies, motivation and learners’ past achievement is analyzed by means of data mining and the extent to which the above factors affect self-efficacy in language learning is explored in this paper. The paper employs the decision tree algorithm in SPSS Clementine. C5.0 decision tree algorithm is adopted to analyze data in the study. The results are elicited from the researches carried out in this paper. The increased anxiety is bound to weaken learners’ motivation over time. It is obvious that learners have low self-efficacy. It is very important to employ strategies in foreign language learning. Ignorance of using learning strategies may result in unplanned learning with unsatisfactory achievements in spite of more efforts involved. Self-efficacy in foreign language learning may be weakened accordingly. Learners’ past achievement is a reference dimension in measuring self-efficacy with weaker influence.


2013 ◽  
Vol 397-400 ◽  
pp. 2296-2300 ◽  
Author(s):  
Fei Shuai ◽  
Jun Quan Li

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


2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Yuzhu Diao ◽  
Qing Zhang

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.


2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Win-Tsung Lo ◽  
Yue-Shan Chang ◽  
Ruey-Kai Sheu ◽  
Chun-Chieh Chiu ◽  
Shyan-Ming Yuan

Decision tree is one of the famous classification methods in data mining. Many researches have been proposed, which were focusing on improving the performance of decision tree. However, those algorithms are developed and run on traditional distributed systems. Obviously the latency could not be improved while processing huge data generated by ubiquitous sensing node in the era without new technology help. In order to improve data processing latency in huge data mining, in this paper, we design and implement a new parallelized decision tree algorithm on a CUDA (compute unified device architecture), which is a GPGPU solution provided by NVIDIA. In the proposed system, CPU is responsible for flow control while the GPU is responsible for computation. We have conducted many experiments to evaluate system performance of CUDT and made a comparison with traditional CPU version. The results show that CUDT is 5∼55 times faster than Weka-j48 and is 18 times speedup than SPRINT for large data set.


Sign in / Sign up

Export Citation Format

Share Document