• Communications for Statistical Applications and Methods
• /
• v.17 no.5
• /
• pp.667-678
• /
• 2010

It is important to detect the gene-gene interaction in GWAS(Genome-Wide Association Study). There are many studies about detecting gene-gene interaction. The one is Multifactor dimensionality reduction method. But MDR method is not applied continuous data and expanded multifactor dimensionality reduction(E-MDR) method is suggested. The goal of this study is to evaluate the power of E-MDR for identifying gene-gene interaction by simulation. Also we applied the method on the identify interaction e ects of single nucleotid polymorphisms(SNPs) responsible for economic traits in a Korean cattle population (real data).

• The Korean Journal of Applied Statistics
• /
• v.14 no.2
• /
• pp.475-486
• /
• 2001

데이터마이닝 패키지에 구현된 분류나무 알고리즘 가운데 CART, CHAID, QUEST, C4.5에서 변수 선택법을 비교하였다. CART의 전체탐색법이 편의를 갖는다는 사실은 잘알려졌으며, 여기서는 상품화된 패키지들에서 이들 알고리즘의 편의와 선택력을 모의실험 연구를 통하여 비교하였다. 상용 패키지로는 CART, Enterprise Miner, AnswerTree, Clementine을 사용하였다. 본 논문의 제한된 모의실험 연구 결과에 의하면 C4.5와 CART는 모두 변수선택에서 심각한 편의를 갖고 있으며, CHAID와 QUEST는 비교적 안정된 결과를 보여주고 있었다.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.6
• /
• pp.849-854
• /
• 2011

To minimize the spreading effect from the events of the system, a rule-based expert system is very effective. However, because the events of the large-scale system are diverse and the load condition is very variable, it is very difficult to construct the rule-based expert system. To solve this problem, this paper studies a methodology which constructs a rule-based expert system by applying a CART(Classification and Regression Trees) algorithm based decision tree determination method to event case examples.

• The Korean Journal of Applied Statistics
• /
• v.18 no.2
• /
• pp.343-354
• /
• 2005

The goal of this paper is to compare classification performances and to find a better classifier based on the characteristics of data. The compared methods are CART with two ensemble algorithms, bagging or boosting and SVM. In the empirical study of twenty-eight data sets, we found that SVM has smaller error rate than the other methods in most of data sets. When comparing bagging, boosting and SVM based on the characteristics of data, SVM algorithm is suitable to the data with small numbers of observation and no missing values. On the other hand, boosting algorithm is suitable to the data with number of observation and bagging algorithm is suitable to the data with missing values.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.5
• /
• pp.57-62
• /
• 2010

Recently, decision tree techniques have been studied in terms of quick searching and extracting of massive data in medical fields. Although many different techniques have been developed such as CART, C4.5 and CHAID which are belong to a pie in Clermont decision tree classification algorithm, those methods can jeopardize remained data by the binary method during procedures. In brief, C4.5 method composes a decision tree by entropy levels. In contrast, CART method does by entropy matrix in categorical or continuous data. Therefore, we compared C4.5 and CART methods which were belong to a same pie using breast cancer data to evaluate their performance respectively. To convince data accuracy, we performed cross-validation of results in this paper.

• The Korean Journal of Applied Statistics
• /
• v.17 no.3
• /
• pp.459-473
• /
• 2004

It has well known that an exhaustive search algorithm suggested by Breiman et. a1.(1984) has a trend to select the variable having relatively many possible splits as an splitting rule. We propose an algorithm to overcome this variable selection bias problem and then construct unbiased regression trees based on the algorithm. The proposed algorithm runs two steps of selecting a split variable and determining a split rule for binary split based on the split variable. Simulation studies were performed to compare the proposed algorithm with Breiman et a1.(1984)'s CART(Classification and Regression Tree) in terms of degree of variable selection bias, variable selection power, and MSE(Mean Squared Error). Also, we illustrate the proposed algorithm with real data sets.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.4
• /
• pp.157-162
• /
• 2010

The cart-pole balancing problem is a pseudo-standard benchmark problem from the field of control methods including genetic algorithms, artificial neural networks, and reinforcement learning. In this paper, we propose a novel approach by using online reinforcement learning(OREL) to solve this cart-pole balancing problem. The objective is to analyze the learning method of the OREL learning system in the cart-pole balancing problem. Through experiment, we can see that approximate faster the optimal value-function than Q-learning.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.9
• /
• pp.2309-2314
• /
• 1997

The study introduces a neural network to predict the bankruptcy of insurance companies. As a method to optimize the network, a genetic algorithm suggests optimal structure and network parameters. The neural network designed by genetic algorithm is compared with discriminant analysis, logistic regression, ID3, and CART. The robust neural network model shows the best performance among those models compared.

• The Korean Journal of Applied Statistics
• /
• v.19 no.1
• /
• pp.149-161
• /
• 2006

The most important component in decision tree algorithm is the rule for split variable selection. Many earlier algorithms such as CART and C4.5 use greedy search algorithm for variable selection. Recently, many methods were developed to cope with the weakness of greedy search algorithm. Most algorithms have different selection criteria depending on the type of variables: continuous or nominal. However, ordinal type variables are usually treated as continuous ones. This approach did not cause any trouble for the methods using greedy search algorithm. However, it may cause problems for the newer algorithms because they use statistical methods valid for continuous or nominal types only. In this paper, we propose a ordinal variable selection method that uses Cramer-von Mises testing procedure. We performed comparisons among CART, C4.5, QUEST, CRUISE, and the new method. It was shown that the new method has a good variable selection power for ordinal type variables.

• Proceedings of the Korean Statistical Society Conference
• /
• 2004.11a
• /
• pp.283-288
• /
• 2004

지금까지 의사결정나무에서 분리 변수의 선택에 관한 연구는 많았으나, 대부분 연속형 변수와 명목형 변수에 국한되어 왔다. 본 연구에서는 순서형 변수에 주목하여 CART, QUEST, CRUISE 등 기존 알고리즘과 본 연구에서 제안하는 비모수적 접근 방법인 K-S test, framer-von Misos test 방법의 변수 선택력을 비교하였다. 그 결과 본 연구에서 제안하는 framer-von Mises test 방법이 다른 알고리즘에 비하여, 변수 선택력과 안정성에 있어서 좋은 성과를 보였다.