• Journal of Information Processing Systems
• /
• 제18권4호
• /
• pp.500-509
• /
• 2022

With the rapid development of educational informatization, teaching methods become diversified characteristics, but a large number of information data restrict the evaluation on teaching subject and object in terms of the effect of English education. Therefore, this study adopts the concept of incremental learning and eigenvalue interval algorithm to improve the weighted decision tree, and builds an English education effect evaluation model based on association rules. According to the results, the average accuracy of information classification of the improved decision tree algorithm is 96.18%, the classification error rate can be as low as 0.02%, and the anti-fitting performance is good. The classification error rate between the improved decision tree algorithm and the original decision tree does not exceed 1%. The proposed educational evaluation method can effectively provide early warning of academic situation analysis, and improve the teachers' professional skills in an accelerated manner and perfect the education system.

• 한국도로학회논문집
• /
• 제20권3호
• /
• pp.27-37
• /
• 2018

PURPOSES : The objective of this study is to develop a pavement rehabilitation decision tree considering current pavement condition by evaluating severity and distress types such as roughness, cracking and rutting. METHODS : To improve the proposed overall rehabilitation decision tree, current decision tree from Korea and decision trees from other countries were summarized and investigated. The problem when applying the current rehabilitation method obtained from the decision tree applied in Seoul was further analyzed. It was found that the current decision trees do not consider different distress characteristics such as crack type, road types and functions. Because of this, different distress values for IRI, crack rate and plastic deformation was added to the proposed decision tree to properly recommend appropriate pavement rehabilitation. Utilizing the 2017 Seoul pavement management system data and considering all factors as discussed, the proposed overall decision tree was revised and improved. RESULTS :In this study, the type of crack was included to the decision tree. Meanwhile current design thickness and special asphalt mixture were studied and improved to be applied on different pavement condition. In addition, the improved decision tree was incorporated with the Seoul asphalt overlay design program. In the case of Seoul's rehabilitation budget, rehabilitation budget can be optimized if a 25mm milling and overlay thickness is used. CONCLUSIONS:A practical and theoretical evaluation tool in pavement rehabilitation design was presented and proposed for Seoul City.

• 한국컴퓨터정보학회논문지
• /
• 제22권4호
• /
• pp.33-39
• /
• 2017

In this paper, we expand the process of classification to an ensemble of fuzzy decision tree. For indoor space recognition, many research use Boosted Tree, consists of Adaboost and decision tree. The Boosted Tree extracts an optimal decision tree in stages. On each stage, Boosted Tree extracts the good decision tree by minimizing the weighted error of classification. This decision tree performs a hard decision. In most case, hard decision offer some error when they classify nearby a dividing point. Therefore, We suggest an ensemble of fuzzy decision tree, which offer some flexibility to the Boosted Tree algorithm as well as a high performance. In experimental results, we evaluate that the accuracy of suggested methods improved about 13% than the traditional one.

• 대한산업공학회지
• /
• 제30권4호
• /
• pp.267-276
• /
• 2004

Much of previous attention on researches of the decision tree focuses on the splitting criteria and optimization of tree size. Nowadays the quantity of the data increase and relation of variables becomes very complex. And hence, this comes to have plenty number of unnecessary node and leaf. Consequently the confidence of the explanation and forecasting of the decision tree falls off. In this research report, we propose some decision tree algorithms considering the interaction of predictor variables. A generic algorithm, the k-1 Algorithm, dealing with the interaction with a combination of all predictor variable is presented. And then, the extended version k-k Algorithm which considers with the interaction every k-depth with a combination of some predictor variables. Also, we present an improved algorithm by introducing control parameter to the algorithms. The algorithms are tested by real field credit card data, census data, bank data, etc.

• International Journal of Computer Science & Network Security
• /
• 제24권6호
• /
• pp.83-88
• /
• 2024

In this paper we used classification algorithms on social networking. We are proposing, a new classification algorithm called the improved Decision Tree (IDT). Our model provides better classification accuracy than the existing systems for classifying the social network data. Here we examined the performance of some familiar classification algorithms regarding their accuracy with our proposed algorithm. We used Support Vector Machines, Naïve Bayes, k-Nearest Neighbors, decision tree in our research and performed analyses on social media dataset. Matlab is used for performing experiments. The result shows that the proposed algorithm achieves the best results with an accuracy of 84.66%.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2017년도 춘계학술발표대회
• /
• pp.787-790
• /
• 2017

Data quality is the main issue in the classification problems; generally, the presence of noisy instances in the training dataset will not lead to robust classification performance. Such instances may cause the generated decision tree to suffer from over-fitting and its accuracy may decrease. Decision trees are useful, efficient, and commonly used for solving various real world classification problems in data mining. In this paper, we introduce a preprocessing technique to improve the classification accuracy rates of the C4.5 decision tree algorithm. In the proposed preprocessing method, we applied the naive Bayes classifier to remove the noisy instances from the training dataset. We applied our proposed method to a real e-commerce sales dataset to test the performance of the proposed algorithm against the existing C4.5 decision tree classifier. As the experimental results, the proposed method improved the classification accuracy by 8.5% and 14.32% using training dataset and 10-fold crossvalidation, respectively.

• 산업공학
• /
• 제20권1호
• /
• pp.41-48
• /
• 2007

The main purpose of this paper is cost reduction in absurd pilot positive expense and human accident prevention which is caused by in the pilot selection process. We use classification models such as logistic regression, decision tree, and neural network based on aptitude test results of 505 ROK Air Force applicants in 2001~2004. First, we determine the reliability and propriety against the aptitude test system which has been improved. Based on this conference flight simulator test item was compared to the new aptitude test item in order to make additional yes or no decision from different models in terms of classification accuracy, ROC and Response Threshold side. Decision tree was selected as the most efficient for each sequential flight training result and the last flight training results predict excellent. Therefore, we propose that the standard of pilot selection be adopted by the decision tree and it presents in the aptitude test item which is new a conference flight simulator test.

• 한국지리정보학회지
• /
• 제21권3호
• /
• pp.205-213
• /
• 2018

초분광영상(Hyperspectral Image)은 다중분광영상에 비해 각 픽셀이 가지는 정보량이 많아 다양한 토지피복을 분류하는데 있어 가장 적합한 영상으로 평가 받고 있다. 하지만 최근의 초분광영상의 연구는 대분류에 해당하는 연구에 그치고 있다. 이에 본 연구에서는 다양한 토지피복분류에 대한 연구를 수행하기 위해 기존의 분석기법인 ED, SAM, SSS 기법을 토대로 Decision Tree를 구성하는 연구를 수행하였다. 그 결과, 대분류의 전체정확도는 1.68%, 세분류 전체정확도는 5.56%가 향상되는 결과를 얻을 수 있었다.

• International journal of advanced smart convergence
• /
• 제11권4호
• /
• pp.68-80
• /
• 2022

Since the launch of AI, technology development to implement complete and sophisticated AI functions has continued. In efforts to develop technologies for complete automation, Machine Learning techniques and deep learning techniques are mainly used. These techniques deal with supervised learning, unsupervised learning, and reinforcement learning as internal technical elements, and use the Big-data Analysis method again to set the cornerstone for decision-making. In addition, established decision-making is being improved through subsequent repetition and renewal of decision-making standards. In other words, big data analysis, which enables data classification and recognition/recognition, is important enough to be called a key technical element of AI function. Therefore, big data analysis itself is important and requires sophisticated analysis. In this study, among various tools that can analyze big data, we will use a Python program to find out what variables can affect addiction according to smartphone use in a decision tree environment. We the Python program checks whether data classification by decision tree shows the same performance as other tools, and sees if it can give reliability to decision-making about the addictiveness of smartphone use. Through the results of this study, it can be seen that there is no problem in performing big data analysis using any of the various statistical tools such as Python and R when analyzing big data.

• 대한산업공학회지
• /
• 제33권2호
• /
• pp.183-190
• /
• 2007

We present a new decision tree classification algorithm using rough set theory that can induce classification rules, the construction of which is based on core attributes and relationship between objects. Although decision trees have been widely used in machine learning and artificial intelligence, little research has focused on improving classification quality. We propose a new decision tree construction algorithm that can be simplified and provides an improved classification quality. We also compare the new algorithm with the ID3 algorithm in terms of the number of rules.