• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.385-389
• /
• 1994

So far many researches have studied to control a cart system with a pole on the top of itself (forwards we call it simply a cart system) which is movable only to the directions to which a cart moves, using neural networks and genetic algorithms. Especially which it wag solved by genetic algorithms, it was possible to control a cart system more robustly than ordinary methods using neural networks but it had problems too, i.e., the control time to be achieved was short and the processing time for it was long. However we could control a cart system using standard genetic algorithm longer than ordinary neural network methods (for example error backpropagation) and could see that robust control was possible. Computer simulation was performed through the personal computer and the results showed the possibility of real time control because the cpu time which was occupied by processes was relatively short.

• 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.

• Journal of Distribution Science
• /
• v.12 no.3
• /
• pp.33-41
• /
• 2014

Purpose - The purpose of this study was to predict the selection of independent auditors in the companies listed on the Tehran Stock Exchange (TSE) using a combination of PSO algorithm and CART. This study involves applied research. Design, approach and methodology - The population consisted of all the companies listed on TSE during the period 2005-2010, and the sample included 576 data specimens from 95 companies during six consecutive years. The independent variables in the study were the financial ratios of the sample companies, which were analyzed using two data mining techniques, namely, PSO algorithm and CART. Results - The results of this study showed that among the analyzed variables, total assets, current assets, audit fee, working capital, current ratio, debt ratio, solvency ratio, turnover, and capital were predictors of independent auditor selection. Conclusion - The current study is practically the first to focus on this topic in the specific context of Iran. In this regard, the study may be valuable for application in developing countries.

• Journal of Korea Water Resources Association
• /
• v.43 no.7
• /
• pp.597-608
• /
• 2010

In this study, a method for soil moisture estimation was proposed to obtain the nationwide soil moisture distribution map using on-site soil moisture observations, rainfall, surface temperature, NDVI, land cover, effective soil depth, and CART (Classification And Regression Tree) algorithm. The method was applied to the Yong-dam dam basin since the soil moisture data (4 sites) of the basin were reliable. Soil moisture observations of 3 sites (Bu-gui, San-jeon, Cheon-cheon2) were used for training the algorithm and 1 site (Gye-buk2) was used for the algorithm validation. The correlation coefficient between the observed and estimated data of soil moisture in the validation sites is about 0.737. Results show that even though there are limitations of the lack of reliable soil moisture observation for various land use, soil type, and topographic conditions, the soil moisture estimation method using ancillary data and CART algorithm can be a reasonable approach since the algorithm provided a fairly good estimation of soil moisture distribution for the study area.

• Proceedings of the KIEE Conference
• /
• 1998.07b
• /
• pp.578-580
• /
• 1998

The paper presents an approach to the structure identification based on the CART (Classification And Regression Tree) algorithm and to the parameter identification by hybrid learning method in neuro-fuzzy system. By using the CART algorithm, the proposed method can roughly estimate the numbers of membership function and fuzzy rule using the centers of decision regions. Then the parameter identification is carried out by the hybrid learning scheme using BP (Back-propagation) and RLSE (Recursive Least Square Estimation) from the numerical data. Finally, we will show it's usefulness for fuzzy modeling to truck backer upper control.

• 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.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 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.

• Speech Sciences
• /
• v.14 no.2
• /
• pp.91-103
• /
• 2007

The purpose of this paper is to develop a model enabling to predict the prosody of Korean text-to-speech synthesis using the CART and SKES algorithms. CART prefers a prediction variable in many instances. Therefore, a partition method by F-Test was applied to CART which had reduced the number of instances by grouping phonemes. Furthermore, the quality of the text-to-speech synthesis was evaluated after applying the SKES algorithm to the same data size. For the evaluation, MOS tests were performed on 30 men and women in their twenties. Results showed that the synthesized speech was improved in a more clear and natural manner by applying the SKES algorithm.

• 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.