• Title/Summary/Keyword: Improved Decision Tree

Search Result 83, Processing Time 0.029 seconds

Case Analyses of the Selection Process of an Excavation Method (지하공사 사례를 기반으로 한 터파기 공법 선정프로세스 분석)

  • Park, Sang-Hyun;Lee, Ghang;Choi, Myung-Seok;Kang, Hyun-Jeong;Rhim, Hong-Cheol
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2007.04a
    • /
    • pp.101-104
    • /
    • 2007
  • As the proportion of underground construction increases, the impact of inappropriate selection of a underground construction method for a construction size increases. The purpose of this study is to develop an objective way of selecting an excavation method. There have been several attempts to achieve the same goal using various data mining methods such as the artificial neural network, the support vector machine, and the case-based reasoning. However, they focused only on the selection of a retaining wall construction method out of six types of retaining walls. When we categorized an underground construction work into four groups and added more number of independent variables (i.e., more number of construction methods), the predictability decreased. As an alternative, we developed a decision tree by analyzing 25 earthwork cases with detailed information. We implemented the developed decision tree as a computer-supported program called Dr. underground and are still in the process of validating and revising the decision tree. This study is still in a preliminary stage and will be improved by collecting and analyzing more cases.

  • PDF

Evaluation of Patients' Queue Environment on Medical Service Using Queueing Theory (대기행렬이론을 활용한 의료서비스 환자 대기환경 평가)

  • Yeo, Hyun-Jin;Bak, Won-Sook;Yoo, Myung-Chul;Park, Sang-Chan;Lee, Sang-Chul
    • Journal of Korean Society for Quality Management
    • /
    • v.42 no.1
    • /
    • pp.71-79
    • /
    • 2014
  • Purpose: The purpose of this study is to develop the methods for evaluating patients' queue environment using decision tree and queueing theory. Methods: This study uses CHAID decision tree and M/G/1 queueing theory to estimate pain point and patients waiting time for medical service. This study translates hospital physical data process to logical process to adapt queueing theory. Results: This study indicates that three nodes of the system has predictable problem with patients waiting time and can be improved by relocating patients to other nodes. Conclusion: This study finds out three seek points of the hospital through decision tree analysis and substitution nodes through the queueing theory. Revealing the hospital patients' queue environment, this study has several limitations such as lack of various case and factors.

Improved Decision Tree-Based State Tying In Continuous Speech Recognition System (연속 음성 인식 시스템을 위한 향상된 결정 트리 기반 상태 공유)

  • ;Xintian Wu;Chaojun Liu
    • The Journal of the Acoustical Society of Korea
    • /
    • v.18 no.6
    • /
    • pp.49-56
    • /
    • 1999
  • In many continuous speech recognition systems based on HMMs, decision tree-based state tying has been used for not only improving the robustness and accuracy of context dependent acoustic modeling but also synthesizing unseen models. To construct the phonetic decision tree, standard method performs one-level pruning using just single Gaussian triphone models. In this paper, two novel approaches, two-level decision tree and multi-mixture decision tree, are proposed to get better performance through more accurate acoustic modeling. Two-level decision tree performs two level pruning for the state tying and the mixture weight tying. Using the second level, the tied states can have different mixture weights based on the similarities in their phonetic contexts. In the second approach, phonetic decision tree continues to be updated with training sequence, mixture splitting and re-estimation. Multi-mixture Gaussian as well as single Gaussian models are used to construct the multi-mixture decision tree. Continuous speech recognition experiment using these approaches on BN-96 and WSJ5k data showed a reduction in word error rate comparing to the standard decision tree based system given similar number of tied states.

  • PDF

The Automated Threshold Decision Algorithm for Node Split of Phonetic Decision Tree (음소 결정트리의 노드 분할을 위한 임계치 자동 결정 알고리즘)

  • Kim, Beom-Seung;Kim, Soon-Hyob
    • The Journal of the Acoustical Society of Korea
    • /
    • v.31 no.3
    • /
    • pp.170-178
    • /
    • 2012
  • In the paper, phonetic decision tree of the triphone unit was built for the phoneme-based speech recognition of 640 stations which run by the Korail. The clustering rate was determined by Pearson and Regression analysis to decide threshold used in node splitting. Using the determined the clustering rate, thresholds are automatically decided by the threshold value according to the average clustering rate. In the recognition experiments for verifying the proposed method, the performance improved 1.4~2.3 % absolutely than that of the baseline system.

Classification Tree-Based Feature-Selective Clustering Analysis: Case of Credit Card Customer Segmentation (분류나무를 활용한 군집분석의 입력특성 선택: 신용카드 고객세분화 사례)

  • Yoon Hanseong
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.19 no.4
    • /
    • pp.1-11
    • /
    • 2023
  • Clustering analysis is used in various fields including customer segmentation and clustering methods such as k-means are actively applied in the credit card customer segmentation. In this paper, we summarized the input features selection method of k-means clustering for the case of the credit card customer segmentation problem, and evaluated its feasibility through the analysis results. By using the label values of k-means clustering results as target features of a decision tree classification, we composed a method for prioritizing input features using the information gain of the branch. It is not easy to determine effectiveness with the clustering effectiveness index, but in the case of the CH index, cluster effectiveness is improved evidently in the method presented in this paper compared to the case of randomly determining priorities. The suggested method can be used for effectiveness of actively used clustering analysis including k-means method.

Study on the Classification Methodology for DSRC Travel Speed Patterns Using Decision Trees (의사결정나무 기법을 적용한 DSRC 통행속도패턴 분류방안)

  • Lee, Minha;Lee, Sang-Soo;Namkoong, Seong;Choi, Keechoo
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.13 no.2
    • /
    • pp.1-11
    • /
    • 2014
  • In this paper, travel speed patterns were deducted based on historical DSRC travel speed data using Decision Tree technique to improve availability of the massive amount of historical data. These patterns were designed to reflect spatio-temporal vicissitudes in reality by generating pattern units classified by months, time of day, and highway sections. The study area was from Seoul TG to Ansung IC sections on Gyung-bu highway where high peak time of day frequently occurs in South Korea. Decision Tree technique was applied to categorize travel speed according to day of week. As a result, five different pattern groups were generated: (Mon)(Tue Wed Thu)(Fri)(Sat)(Sun). Statistical verification was conducted to prove the validity of patterns on nine different highway sections, and the accuracy of fitting was found to be 93%. To reduce travel pattern errors against individual travel speed data, inclusion of four additional variables were also tested. Among those variables, 'traffic condition on previous month' variable improved the pattern grouping accuracy by reducing 50% of speed variance in the decision tree model developed.

Decision Tree Algorithm with Improved Entropy Using an Expert Opinion (전문가 의견을 반영하는 향상된 의사결정나무의 엔트로피 기법)

  • Bak, Sun-Bin;Kim, Dong-Moon;Yoon, Tae-Bok;Lee, Jee-Hyong
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2007.11a
    • /
    • pp.239-242
    • /
    • 2007
  • 최근 데이터의 양이 많아지고 다양해짐에 따라서 데이터를 활용하기 위한 데이터 마이닝에 관한 관심이 중대되고 있다. 데이터 분석을 위한 수집 데이터에는 수집 과정에서 분석가가 원치 않은 데이터 잡음이 발생하는 경우가 있고 그 데이터가 다른 데이터들과 같은 가중치로 데이터 마이닝에 반영되는 경우 예상과 다른 결과를 얻을 수 있다. 따라서 데이터 분석 시 데이터와 전문가 의견이 고려된 데이터 엔트로피(Entropy)를 사용하여 잡음 데이터를 다를 필요가 있다. 본 논문에서는 전문가의견을 이용한 전문가 의견 목록을 만들고 이를 데이터와 비교하여 유사한 정도에 따라 각 데이터에 가중치를 부여한다. 그리고 이 데이터를 활용한 의사결정나무(Decision Tree)를 사용하여 기존 데이터를 이용한 의사결정나무 보다 데이터 잡음의 영향을 줄이는 방법을 제안한다. 제안한 방법은 학습자의 학습 활동에서 수집된 학습 행위 데이터를 사용하여 실험하였다.

  • PDF

Hand Language Translation Using Kinect

  • Pyo, Junghwan;Kang, Namhyuk;Bang, Jiwon;Jeong, Yongjin
    • Journal of IKEEE
    • /
    • v.18 no.2
    • /
    • pp.291-297
    • /
    • 2014
  • Since hand gesture recognition was realized thanks to improved image processing algorithms, sign language translation has been a critical issue for the hearing-impaired. In this paper, we extract human hand figures from a real time image stream and detect gestures in order to figure out which kind of hand language it means. We used depth-color calibrated image from the Kinect to extract human hands and made a decision tree in order to recognize the hand gesture. The decision tree contains information such as number of fingers, contours, and the hand's position inside a uniform sized image. We succeeded in recognizing 'Hangul', the Korean alphabet, with a recognizing rate of 98.16%. The average execution time per letter of the system was about 76.5msec, a reasonable speed considering hand language translation is based on almost still images. We expect that this research will help communication between the hearing-impaired and other people who don't know hand language.

P2P Traffic Classification using Advanced Heuristic Rules and Analysis of Decision Tree Algorithms (개선된 휴리스틱 규칙 및 의사 결정 트리 분석을 이용한 P2P 트래픽 분류 기법)

  • Ye, Wujian;Cho, Kyungsan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.3
    • /
    • pp.45-54
    • /
    • 2014
  • In this paper, an improved two-step P2P traffic classification scheme is proposed to overcome the limitations of the existing methods. The first step is a signature-based classifier at the packet-level. The second step consists of pattern heuristic rules and a statistics-based classifier at the flow-level. With pattern heuristic rules, the accuracy can be improved and the amount of traffic to be classified by statistics-based classifier can be reduced. Based on the analysis of different decision tree algorithms, the statistics-based classifier is implemented with REPTree. In addition, the ensemble algorithm is used to improve the performance of statistics-based classifier Through the verification with the real datasets, it is shown that our hybrid scheme provides higher accuracy and lower overhead compared to other existing schemes.

A Study of Decision Tree Modeling for Predicting the Prosody of Corpus-based Korean Text-To-Speech Synthesis (한국어 음성합성기의 운율 예측을 위한 의사결정트리 모델에 관한 연구)

  • Kang, Sun-Mee;Kwon, Oh-Il
    • 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.

  • PDF