The Application of Improved Decision Tree Algorithm in Data Mining of Employment Rate: Evidence from China

Author(s):  
Yuxiang Shao ◽  
Qing Chen ◽  
Weiming Yin
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.


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.


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.


2011 ◽  
Vol 230-232 ◽  
pp. 1303-1307 ◽  
Author(s):  
Fa Chao Li ◽  
Hong Ze Yin ◽  
Fei Guan

This paper is for refining database in the data mining process. Based on the analysis of the features and disadvantages of this decision tree algorithm and the substantive characteristics of data mining, we propose the concept of the core samples set and prove its invariance. On this basis, we build an attribute reduction method based on decision tree algorithm and then give a specific implementation steps, further, combined with a specific instance analyze the characteristics and efficiency of the method. Results show that the attribute reduction method based on the decision tree has good maneuverability and explicableness. This method can simply realize the attribute reduction of information system and its basic ideas completely adapt to the attribute reduction problems of the uncertain environment.


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.


Sign in / Sign up

Export Citation Format

Share Document