• Title/Summary/Keyword: decision tree model

Search Result 722, Processing Time 0.028 seconds

Length-of-Stay Prediction Model of Appendicitis using Artificial Neural Networks and Decision Tree (신경망과 의사결정 나무를 이용한 충수돌기염 환자의 재원일수 예측모형 개발)

  • Chung, Suk-Hoon;Han, Woo-Sok;Suh, Yong-Moo;Rhee, Hyun-SiIl
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.6
    • /
    • pp.1424-1432
    • /
    • 2009
  • For the efficient management of hospital sickbeds, it is important to predict the length of stay (LoS) of appendicitis patients. This study analyzed the patient data to find factors that show high positive correlation with LoS, build LoS prediction models using neural network and decision tree models, and compare their performance. In order to increase the prediction accuracy, we applied the ensemble techniques such as bagging and boosting. Experimental results show that decision tree model which was built with less number of variables shows prediction accuracy almost equal to that of neural network model, and that bagging is better than boosting. In conclusion, since the decision tree model which provides better explanation than neural network model can well predict the LoS of appendicitis patients and can also be used to select the input variables, it is recommended that hospitals make use of the decision tree techniques more actively.

A study on decision tree creation using marginally conditional variables (주변조건부 변수를 이용한 의사결정나무모형 생성에 관한 연구)

  • Cho, Kwang-Hyun;Park, Hee-Chang
    • Journal of the Korean Data and Information Science Society
    • /
    • v.23 no.2
    • /
    • pp.299-307
    • /
    • 2012
  • Data mining is a method of searching for an interesting relationship among items in a given database. The decision tree is a typical algorithm of data mining. The decision tree is the method that classifies or predicts a group as some subgroups. In general, when researchers create a decision tree model, the generated model can be complicated by the standard of model creation and the number of input variables. In particular, if the decision trees have a large number of input variables in a model, the generated models can be complex and difficult to analyze model. When creating the decision tree model, if there are marginally conditional variables (intervening variables, external variables) in the input variables, it is not directly relevant. In this study, we suggest the method of creating a decision tree using marginally conditional variables and apply to actual data to search for efficiency.

A Study on the Categorization of Context-dependent Phoneme using Decision Tree Modeling (결정 트리 모델링에 의한 한국어 문맥 종속 음소 분류 연구)

  • 이선정
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.2
    • /
    • pp.195-202
    • /
    • 2001
  • In this paper, we show a study on how to model a phoneme of which acoustic feature is changed according to both left-hand and right-hand phonemes. For this purpose, we make a comparative study on two kinds of algorithms; a unit reduction algorithm and decision tree modeling. The unit reduction algorithm uses only statistical information while the decision tree modeling uses statistical information and Korean acoustical information simultaneously. Especially, we focus on how to model context-dependent phonemes based on decision tree modeling. Finally, we show the recognition rate when context-dependent phonemes are obtained by the decision tree modeling.

  • PDF

Decision-Tree-Based Markov Model for Phrase Break Prediction

  • Kim, Sang-Hun;Oh, Seung-Shin
    • ETRI Journal
    • /
    • v.29 no.4
    • /
    • pp.527-529
    • /
    • 2007
  • In this paper, a decision-tree-based Markov model for phrase break prediction is proposed. The model takes advantage of the non-homogeneous-features-based classification ability of decision tree and temporal break sequence modeling based on the Markov process. For this experiment, a text corpus tagged with parts-of-speech and three break strength levels is prepared and evaluated. The complex feature set, textual conditions, and prior knowledge are utilized; and chunking rules are applied to the search results. The proposed model shows an error reduction rate of about 11.6% compared to the conventional classification model.

  • PDF

Prediction method of slope hazards using a decision tree model (의사결정나무모형을 이용한 급경사지재해 예측기법)

  • Song, Young-Suk;Chae, Byung-Gon;Cho, Yong-Chan
    • Proceedings of the Korean Geotechical Society Conference
    • /
    • 2008.03a
    • /
    • pp.1365-1371
    • /
    • 2008
  • Based on the data obtained from field investigation and soil testing to slope hazards occurrence section and non-occurrence section in gneiss area, a prediction technique was developed by the use of a decision tree model. The slope hazards data of Seoul and Kyonggi Province were 104 sections in gneiss area. The number of data applied in developing prediction model was 61 sections except a vacant value. The statistical analyses using the decision tree model were applied to the entrophy index. As the results of analyses, a slope angle, a degree of saturation and an elevation were selected as the classification standard. The prediction model of decision tree using entrophy index is most likely accurate. The classification standard of the selected prediction model is composed of the slope angle, the degree of saturation and the elevation from the first choice stage. The classification standard values of the slope angle, the degree of saturation and elevation are $17.9^{\circ}$, 52.1% and 320m, respectively.

  • PDF

Decision-tree Model of Treatment-seeking Behaviors after Detecting Symptoms by Korean Stroke Patients

  • Oh Hyo-Sook;Park Hyeoun-Ae
    • Journal of Korean Academy of Nursing
    • /
    • v.36 no.4
    • /
    • pp.662-670
    • /
    • 2006
  • Purpose. This study was performed to develop and test a decision-tree model of treatment-seeking behaviors about when Korean patients visit a doctor after experiencing stroke symptoms. Methods. The study used methodological triangulation. The model was developed based on qualitative data collected from in-depth interviews with 18 stroke patients. The model was tested using quantitative data collected from interviews and a structured questionnaire involving 150 stroke patients. The predictability of the decision-tree model was quantified as the proportion of participants who followed the pathway predicted by the model. Results. Decision outcomes of the model were categorized into immediate and delayed treatment-seeking behavior. The model was influenced by lowered consciousness, social-group influences, perceived seriousness of symptoms, past history of hypertension or stroke, and barriers to hospital visits. The predictability of the model was found to be 90.7%. Conclusions. The results from this study can help healthcare personnel understand the education needs of stroke patients regarding treatment-seeking behaviors, and hence aid in the development of educational strategies for stroke patients.

Ensemble Gene Selection Method Based on Multiple Tree Models

  • Mingzhu Lou
    • Journal of Information Processing Systems
    • /
    • v.19 no.5
    • /
    • pp.652-662
    • /
    • 2023
  • Identifying highly discriminating genes is a critical step in tumor recognition tasks based on microarray gene expression profile data and machine learning. Gene selection based on tree models has been the subject of several studies. However, these methods are based on a single-tree model, often not robust to ultra-highdimensional microarray datasets, resulting in the loss of useful information and unsatisfactory classification accuracy. Motivated by the limitations of single-tree-based gene selection, in this study, ensemble gene selection methods based on multiple-tree models were studied to improve the classification performance of tumor identification. Specifically, we selected the three most representative tree models: ID3, random forest, and gradient boosting decision tree. Each tree model selects top-n genes from the microarray dataset based on its intrinsic mechanism. Subsequently, three ensemble gene selection methods were investigated, namely multipletree model intersection, multiple-tree module union, and multiple-tree module cross-union, were investigated. Experimental results on five benchmark public microarray gene expression datasets proved that the multiple tree module union is significantly superior to gene selection based on a single tree model and other competitive gene selection methods in classification accuracy.

Hybridized Decision Tree methods for Detecting Generic Attack on Ciphertext

  • Alsariera, Yazan Ahmad
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.7
    • /
    • pp.56-62
    • /
    • 2021
  • The surge in generic attacks execution against cipher text on the computer network has led to the continuous advancement of the mechanisms to protect information integrity and confidentiality. The implementation of explicit decision tree machine learning algorithm is reported to accurately classifier generic attacks better than some multi-classification algorithms as the multi-classification method suffers from detection oversight. However, there is a need to improve the accuracy and reduce the false alarm rate. Therefore, this study aims to improve generic attack classification by implementing two hybridized decision tree algorithms namely Naïve Bayes Decision tree (NBTree) and Logistic Model tree (LMT). The proposed hybridized methods were developed using the 10-fold cross-validation technique to avoid overfitting. The generic attack detector produced a 99.8% accuracy, an FPR score of 0.002 and an MCC score of 0.995. The performances of the proposed methods were better than the existing decision tree method. Similarly, the proposed method outperformed multi-classification methods for detecting generic attacks. Hence, it is recommended to implement hybridized decision tree method for detecting generic attacks on a computer network.

Comparison of Performance Measures for Credit-Card Delinquents Classification Models : Measured by Hit Ratio vs. by Utility (신용카드 연체자 분류모형의 성능평가 척도 비교 : 예측률과 유틸리티 중심으로)

  • Chung, Suk-Hoon;Suh, Yong-Moo
    • Journal of Information Technology Applications and Management
    • /
    • v.15 no.4
    • /
    • pp.21-36
    • /
    • 2008
  • As the great disturbance from abusing credit cards in Korea becomes stabilized, credit card companies need to interpret credit-card delinquents classification models from the viewpoint of profit. However, hit ratio which has been used as a measure of goodness of classification models just tells us how much correctly they classified rather than how much profits can be obtained as a result of using classification models. In this research, we tried to develop a new utility-based measure from the viewpoint of profit and then used this new measure to analyze two classification models(Neural Networks and Decision Tree models). We found that the hit ratio of neural model is higher than that of decision tree model, but the utility value of decision tree model is higher than that of neural model. This experiment shows the importance of utility based measure for credit-card delinquents classification models. We expect this new measure will contribute to increasing profits of credit card companies.

  • PDF

Classification Method of Congestion Change Type for Efficient Traffic Management (효율적인 교통관리를 위한 혼잡상황변화 유형 분류기법 개발)

  • Shim, Sangwoo;Lee, Hwanpil;Lee, Kyujin;Choi, Keechoo
    • International Journal of Highway Engineering
    • /
    • v.16 no.4
    • /
    • pp.127-134
    • /
    • 2014
  • PURPOSES : To operate more efficient traffic management system, it is utmost important to detect the change in congestion level on a freeway segment rapidly and reliably. This study aims to develop classification method of congestion change type. METHODS: This research proposes two classification methods to capture the change of the congestion level on freeway segments using the dedicated short range communication (DSRC) data and the vehicle detection system (VDS) data. For developing the classification methods, the decision tree models were employed in which the independent variable is the change in congestion level and the covariates are the DSRC and VDS data collected from the freeway segments in Korea. RESULTS : The comparison results show that the decision tree model with DSRC data are better than the decision tree model with VDS data. Specifically, the decision tree model using DSRC data with better fits show approximately 95% accuracies. CONCLUSIONS : It is expected that the congestion change type classified using the decision tree models could play an important role in future freeway traffic management strategy.