• Title/Summary/Keyword: QUEST algorithm

Search Result 27, Processing Time 0.019 seconds

A Decision Tree Algorithm using Genetic Programming

  • Park, Chongsun;Ko, Young Kyong
    • 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.

A Study on Development of A Web-Based Forecasting System of Industrial Accidents (웹 기반의 산업재해 예측시스템 개발에 관한 연구)

  • Leem, Young-Moon;Hwang, Young-Seob;Choi, Yo-Han
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2007.11a
    • /
    • pp.269-274
    • /
    • 2007
  • Ultimate goal of this research is to develop a web-based forecasting system of industrial accidents. As an initial step for the purpose of this study, this paper provides a comparative analysis of 4 kinds of algorithms including CHAID, CART, C4.5, and QUEST. In addition, this paper presents the logical process for development of a forecasting system. Decision tree algorithm is utilized to predict results using objective and quantified data as a typical technique of data mining. The sample for this work was chosen from 10,536 data related to manufacturing industries during three years(2002$^{\sim}$2004) in korea.

  • PDF

Development of Discriminant Model of PIH Pregnant using Decision Tree

  • Park, Young-Sun;Choi, Hang-Suk;Lee, Young-Koun;Cha, Kyung-Joon;Lee, Sung-Hoon;Park, Moon-Il
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 2004.04a
    • /
    • pp.141-149
    • /
    • 2004
  • The various methods have been studied to develop discriminant model for Pregnancy Induced Hypertension(PIH) as high risk pregnant. In this study, we adapt the approximate entropy which is the non-linear chaotic measuring method. Then, we develop the system to discriminant PIH pregnant using QUEST with S-PLUS.

  • PDF

Averaging TRIAD Algorithm for Attitude Determination (평균 TRIAD를 이용한 자세 결정)

  • Kim, Dong-Hoon;Lee, Henzeh;Oh, Hwa-Suk
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.37 no.1
    • /
    • pp.36-41
    • /
    • 2009
  • In general, accurate attitude information is essential to perform the mission. Two algorithms are well-known to determine the attitude through two or more vector observations. One is deterministic method such as TRIAD algorithm, the other is optimal method such as QUEST algorithm. This Paper suggests the idea to improve performance of the TRIAD algorithm and to determine the attitude by combination of different sensors. First, we change the attitude matrix to Euler angle instead of using orthogonalization method and also use covariance in place of variance, then apply an unbiased minimum variance formula for more accurate solutions. We also suggest the methodology to determine the attitude when more than two measurements are given. The performance of the Averaging TRIAD algorithm upon the combination of different sensors is analyzed by numerical simulation in terms of standard deviation and probability.

Ordinal Variable Selection in Decision Trees (의사결정나무에서 순서형 분리변수 선택에 관한 연구)

  • Kim Hyun-Joong
    • 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.

Performance Analysis of Quaternion-based Least-squares Methods for GPS Attitude Estimation (GPS 자세각 추정을 위한 쿼터니언 기반 최소자승기법의 성능평가)

  • Won, Jong-Hoon;Kim, Hyung-Cheol;Ko, Sun-Jun;Lee, Ja-Sung
    • Proceedings of the KIEE Conference
    • /
    • 2001.07d
    • /
    • pp.2092-2095
    • /
    • 2001
  • In this paper, the performance of a new alternative form of three-axis attitude estimation algorithm for a rigid body is evaluated via simulation for the situation where the observed vectors are the estimated baselines of a GPS antenna array. This method is derived based on a simple iterative nonlinear least-squares with four elements of quaternion parameter. The representation of quaternion parameters for three-axis attitude of a rigid body is free from singularity problem. The performance of the proposed algorithm is compared with other eight existing methods, such as, Transformation Method (TM), Vector Observation Method (VOM), TRIAD algorithm, two versions of QUaternion ESTimator (QUEST), Singular Value Decomposition (SVD) method, Fast Optimal Attitude Matrix (FOAM), Slower Optimal Matrix Algorithm (SOMA).

  • PDF

Selection of an Optimal Algorithm for Prevention of Industrial Accidents (산업재해 예방을 위한 최적 알고리즘 선정)

  • Leem, Young-Moon;Hwang, Young-Seob
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2005.11a
    • /
    • pp.328-331
    • /
    • 2005
  • 산업재해 통계분석의 커다란 목적은 각 산업별로 주 위험요인을 도출하고 이에 따른 안전교육의 실시 또는 안전장치 등을 보완함으로써 산업재해를 줄이거나 예방하는데 있다고 볼 수 있다. 그러나 일반 제조업이나 건설업 등에서는 아직까지도 정량적 위험성 평가 기법이 개발되어 있지 않은 실정이다. 따라서 효율적인 위험성 평가 기법의 개발이 필요하다. 본 연구에서는 데이터마이닝 기법을 이용한 산업재해 예방을 위한 최적 알고리즘 선정 방법을 제시한다.

  • PDF

The empirical comparison of efficiency in classification algorithms (분류 알고리즘의 효율성에 대한 경험적 비교연구)

  • 전홍석;이주영
    • Journal of the Korea Safety Management & Science
    • /
    • v.2 no.3
    • /
    • pp.171-184
    • /
    • 2000
  • We may be given a set of observations with the classes or clusters. The aim of this article is to provide an up-to-date review of different approaches to classification, compare their performance on a wide range of challenging data-sets. In this paper, machine learning algorithm classifiers based on CART, C4.5, CAL5, FACT, QUEST and statistical discriminant analysis are compared on various datasets in classification error rate and algorithms.

  • PDF

Development of an Expert System for Prevention of Industrial Accidents in Manufacturing Industries (제조업에서의 산업재해 예방을 위한 전문가 시스템 개발)

  • Leem Young-Moon;Choi Yo-Han
    • Journal of the Korea Safety Management & Science
    • /
    • v.8 no.1
    • /
    • pp.53-64
    • /
    • 2006
  • Many researches and analyses have been focused on industrial accidents in order to predict and reduce them. As a similar endeavor, this paper is to develop an expert system for prevention of industrial accidents. Although various previous studies have been performed to prevent industrial accidents, these studies only provide managerial and educational policies using frequency analysis and comparative analysis based on data from past industrial accidents. As an initial step for the purpose of this study, this paper provides a comparative analysis of 4 kinds of algorithms including CHAID, CART, C4.5, and QUEST. Decision tree algorithm is utilized to predict results using objective and quantified data as a typical technique of data mining. Enterprise Miner of SAS and Answer Tree of SPSS will be used to evaluate the validity of the results of the four algorithms. The sample for this work was chosen from 10,536 data related to manufacturing industries during three years$(2002\sim2004)$ in korea. The initial sample includes a range of different businesses including the construction and manufacturing industries, which are typically vulnerable to industrial accidents.

HARQ Switching Metric of MIMO-OFDM Systems using Joint Tx/Rx Antenna Scheduling (송.수신 안테나 스케줄링에 기반한 MIMO-OFDM 시스템의 HARQ 스위칭 기법)

  • Kim, Kyoo-Hyun;Knag, Seoung-Won;Chang, Kyung-Hi;Jeong, Byung-Jang;Chung, Hyun-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.6A
    • /
    • pp.519-536
    • /
    • 2007
  • In this paper, we combine the Hybrid-Automatic Repeat reQuest (HARQ) algorithm with joint Tx and Rx antenna selection based on the reliability of the individual antennas links. The cyclic redundancy check (CRC) is applied on the data before being encoded using the Turbo encoder. In the receiver the CRC is used to detect errors of each antenna stream and to decide whether a retransmission is required or not. The receiver feeds back the transmitter with the Tx antennas ordering and the acknowledgement of each antenna (ACK or NACK). If the number of ACK antennas is higher than the NACK antennas, then the retransmission takes place from the ACK antennas using the Chase Combining (CC). If the number of the NACK antennas is higher than the ACK antennas then the ACK antennas are used to retransmit the data streams using the CC algorithm and additional NACK antennas are used to retransmit the remaining streams using Incremental Redundancy (IR, i.e. the encoder rate is reduced). Furthermore, the HARQ is used with the I-BLAST (Iterative-BLAST) which grantees a high transmission rate.