• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.817-819
• /
• 2003

Land degradation is a crucial issue in mountainous areas and is manifested in a variety of processes. For its assessment, application of existing models is not straightforward. In addition, data availability might be a problem. In this paper, a procedure for land degradation assessment is described, which follows a four-step approach: (1) detection, inventory and mapping of land degradation features, (2) assessing the magnitude of soil loss, (3) study of causal factors, and (4) hazard assessment by applying decision trees. This approach is applied to a case study in the Middle Mountain region of Nepal. The study shows that individual mass movement features such as debris slides and slumps can be easily mapped by photo interpretation techniques. Application of soil loss estimation models helps get insight on the magnitude of soil losses. In the study area soil losses are higher in rainfed crops on sloping terraces (highest soil loss is 32 tons/ha/yr) and minimal under dense forest and in irrigated rice fields (less than 1 ton/ha/yr). However there is high frequency of slope failures in the form of slumps in the rice fields. Debris slides are more common on south-facing slopes under rainfed agriculture or in degraded forest. Field evidences and analysis of causal factors for land degradation helps in building decision trees, the use of which for modelling land degradation has the advantage that attributes can be ranked and tested according to their importance. In addition, decision trees are simple to construct, easy to implement and very flexible in adaptations.

• The Korean Journal of Applied Statistics
• /
• v.35 no.4
• /
• pp.517-525
• /
• 2022

In the era of big data, various data mining techniques have been proposed as major analysis methodologies. As complex and diverse data is mass-produced, data mining techniques have attracted attention as a method that forms the foundation of data science. In this paper, we focused on the decision tree, which is frequently used in practice and easy to understand as one of representative data mining methods. Specifically, we analyzed the effect of the splitting method of decision trees on the model performance. We compared the prediction power and structures of decision tree models with different split methods based on various simulated data. The results show that the linear combination split method can improve the prediction accuracy of decision trees in the case of data simulated from nonlinear models with complex structure.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3286-3300
• /
• 2016

High Efficiency Video Coding (HEVC) Standard, as the latest coding standard, introduces satisfying compression structures with respect to its predecessor Advanced Video Coding (H.264/AVC). The new coding standard can offer improved encoding performance compared with H.264/AVC. However, it also leads to enormous computational complexity that makes it considerably difficult to be implemented in real time application. In this paper, based on machine learning, a fast partitioning method is proposed, which can search for the best splitting structures for Intra-Prediction. In view of the video texture characteristics, we choose the entropy of Gray-Scale Difference Statistics (GDS) and the minimum of Sum of Absolute Transformed Difference (SATD) as two important features, which can make a balance between the computation complexity and classification performance. According to the selected features, adaptive decision trees can be built for the Coding Units (CU) with different size by offline training. Furthermore, by this way, the partition of CUs can be resolved as a binary classification problem. Experimental results have shown that the proposed algorithm can save over 34% encoding time on average, with a negligible Bjontegaard Delta (BD)-rate increase.

• International Journal of Highway Engineering
• /
• v.20 no.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.

• Journal of Information Science Theory and Practice
• /
• v.7 no.4
• /
• pp.56-64
• /
• 2019

Planting intercropping in rubber plantations is another alternative for generating more income for farmers. However, farmers still lack the knowledge of choosing plants. In addition, information for decision making comes from many sources and is knowledge accumulated by the expert. Therefore, this research aims to create a decision support system for growing rubber trees for individual farmers. It aims to get the highest income and the lowest cost by using semantic web technology so that farmers can access knowledge at all times and reduce the risk of growing crops, and also support the decision supporting system (DSS) to be more intelligent. The integrated intercropping ontology and rule are a part of the decision-making process for selecting plants that is suitable for individual rubber plots. A list of suitable plants is important for decision variables in the allocation of planting areas for each type of plant for multiple purposes. This article presents designing and developing the intercropping ontology for DSS which defines a class based on the principle of intercropping in rubber plantations. It is grouped according to the characteristics and condition of the area of the farmer as a concept of the rubber plantation. It consists of the age of rubber tree, spacing between rows of rubber trees, and water sources for use in agriculture and soil group, including slope, drainage, depth of soil, etc. The use of ontology for recommended plants suitable for individual farmers makes a contribution to the knowledge management field. Besides being useful in DSS by offering options with accuracy, it also reduces the complexity of the problem by reducing decision variables and condition variables in the multi-objective optimization model of DSS.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10c
• /
• pp.223-225
• /
• 2002

Decision tree는 목표 데이터에 대한 계층적 관점을 보여준다는 의미에서 데이터를 보다 잘 이해하는데 많은 도움이 되나 탐욕법(greedy algorithm)에 의한 트리 생성법의 한계로 인해 최적의 예측자라고는 할 수가 없다. 이와 같은 약점을 보완하기 위하여 일반적 방법으로 생성한 decision tree에 대하여 다차원 연관규칙 알고리즘을 적용함으로써 짱은 길이의 최적 부분 규칙집합을 구하는 방법을 제시하였고 실험을 통해 그와 같은 사실을 확인하였다.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.3
• /
• pp.132-140
• /
• 1994

SCRIPT (Symbol/Character Recognition In Pen-based Technology) is an algorithm for on-line recognition of handwriting Hangeul. English upperacase letters, decimal digits, and some keyboard symbols. The shape of handwriting symbols has a large variation even when written by the same person. Though the feature analysis approach using a conventional decision tree is efficient, it is not robust under shape variations and prone to misclassification. Thus, a new method to overcome this shortcoming is necessary. In this paper, a feature analysis algorithm using two fuzzy decision trees which utilize the hierarchical property of the pattern is proposed. The first tree is used to represent the stroke shape, and the other tree is used to represent the relation between the strokes. since this method stores various possibilities. it is robust to shape variations and can readily modify false selections. In addition, there is a large increase in the recognition rate of high-level patterns due to low-level candidated. Experimental results show 91% recognition rate for Hangeul at the recognition speed of 0.33 second per character, and the recognition rate of alphanumerics and some keyboard symbols is 95% at 0.08 second per symbol. This is 8~18% increase in the recognition rate over th method not applying fuzzy decision trees.

• Nuclear Engineering and Technology
• /
• v.26 no.2
• /
• pp.168-178
• /
• 1994

Accident Management involves all measures to prevent core damage and retain the core within the reactor vessel, maintain containment integrity and minimize off-site releases. The accident management approach includes : (1) advanced evaluation of candidate strategies, (2) development of procedures to execute appropriate actions efficiently, and (3) identification and provision for materials, tools, and possible modifications to the plant system that may be needed for such execution. When assessing accident management strategies it effectiveness, adverse effect and its feasibility, including information needs and compatibility with existing procedures, must be considered. The objective of this paper is to introduce analytical tools of decision trees and influence diagrams to develop a framework for modeling and assessing severe accident management strategies. The characteristics associated with these took are presented. Based on decision trees and influence diagrams, the framework is applied to a simple example associated with a single decision.

• Communications for Statistical Applications and Methods
• /
• v.10 no.3
• /
• pp.845-857
• /
• 2003

We explore the use of genetic programming to evolve decision trees directly for classification problems with both discrete and continuous predictors. We demonstrate that the derived hypotheses of standard algorithms can substantially deviated from the optimum. This deviation is partly due to their top-down style procedures. The performance of the system is measured on a set of real and simulated data sets and compared with the performance of well-known algorithms like CHAID, CART, C5.0, and QUEST. Proposed algorithm seems to be effective in handling problems caused by top-down style procedures of existing algorithms.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.5
• /
• pp.79-89
• /
• 2016

In this paper, we proposed the object classification method using genetic and dynamic random forest consisting of optimal combination of unit tree. The random forest can ensure good generalization performance in combination of large amount of trees by assigning the randomization to the training samples and feature selection, etc. allocated to the decision tree as an ensemble classification model which combines with the unit decision tree based on the bagging. However, the random forest is composed of unit trees randomly, so it can show the excellent classification performance only when the sufficient amounts of trees are combined. There is no quantitative measurement method for the number of trees, and there is no choice but to repeat random tree structure continuously. The proposed algorithm is composed of random forest with a combination of optimal tree while maintaining the generalization performance of random forest. To achieve this, the problem of improving the classification performance was assigned to the optimization problem which found the optimal tree combination. For this end, the genetic algorithm methodology was applied. As a result of experiment, we had found out that the proposed algorithm could improve about 3~5% of classification performance in specific cases like common database and self infrared database compare with the existing random forest. In addition, we had shown that the optimal tree combination was decided at 55~60% level from the maximum trees.