• Title/Summary/Keyword: Decision-Tree-Model

Search Result 723, Processing Time 0.024 seconds

A study on decision tree creation using intervening variable (매개 변수를 이용한 의사결정나무 생성에 관한 연구)

  • Cho, Kwang-Hyun;Park, Hee-Chang
    • Journal of the Korean Data and Information Science Society
    • /
    • v.22 no.4
    • /
    • pp.671-678
    • /
    • 2011
  • Data mining searches for interesting relationships among items in a given database. The methods of data mining are decision tree, association rules, clustering, neural network and so on. The decision tree approach is most useful in classification problems and to divide the search space into rectangular regions. Decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, customer classification, etc. When create decision tree model, complicated model by standard of model creation and number of input variable is produced. Specially, there is difficulty in model creation and analysis in case of there are a lot of numbers of input variable. In this study, we study on decision tree using intervening variable. We apply to actuality data to suggest method that remove unnecessary input variable for created model and search the efficiency.

A Study on the Prediction of Community Smart Pension Intention Based on Decision Tree Algorithm

  • Liu, Lijuan;Min, Byung-Won
    • International Journal of Contents
    • /
    • v.17 no.4
    • /
    • pp.79-90
    • /
    • 2021
  • With the deepening of population aging, pension has become an urgent problem in most countries. Community smart pension can effectively resolve the problem of traditional pension, as well as meet the personalized and multi-level needs of the elderly. To predict the pension intention of the elderly in the community more accurately, this paper uses the decision tree classification method to classify the pension data. After missing value processing, normalization, discretization and data specification, the discretized sample data set is obtained. Then, by comparing the information gain and information gain rate of sample data features, the feature ranking is determined, and the C4.5 decision tree model is established. The model performs well in accuracy, precision, recall, AUC and other indicators under the condition of 10-fold cross-validation, and the precision was 89.5%, which can provide the certain basis for government decision-making.

Inter-Process Correlation Model based Hybrid Framework for Fault Diagnosis in Wireless Sensor Networks

  • Zafar, Amna;Akbar, Ali Hammad;Akram, Beenish Ayesha
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.2
    • /
    • pp.536-564
    • /
    • 2019
  • Soft faults are inherent in wireless sensor networks (WSNs) due to external and internal errors. The failure of processes in a protocol stack are caused by errors on various layers. In this work, impact of errors and channel misbehavior on process execution is investigated to provide an error classification mechanism. Considering implementation of WSN protocol stack, inter-process correlations of stacked and peer layer processes are modeled. The proposed model is realized through local and global decision trees for fault diagnosis. A hybrid framework is proposed to implement local decision tree on sensor nodes and global decision tree on diagnostic cluster head. Local decision tree is employed to diagnose critical failures due to errors in stacked processes at node level. Global decision tree, diagnoses critical failures due to errors in peer layer processes at network level. The proposed model has been analyzed using fault tree analysis. The framework implementation has been done in Castalia. Simulation results validate the inter-process correlation model-based fault diagnosis. The hybrid framework distributes processing load on sensor nodes and diagnostic cluster head in a decentralized way, reducing communication overhead.

An Analysis of Service Robot Quality Attributes through the Kano Model and Decision Tree : Financial Service Robot for Introduction to Bank Branches (카노와 의사결정나무를 활용한 금융서비스 로봇의 품질속성 분석 : 은행지점 도입용 금융서비스 로봇 사례)

  • Song, Young-gue;Lee, Jungwoo;Han, Chang Hee
    • Journal of Information Technology Services
    • /
    • v.20 no.2
    • /
    • pp.111-126
    • /
    • 2021
  • A Kano model was used to classify the quality attributes of the service robot function for actual deployment that can support and replace bank employees. Quality attributes for a total of 6 dimensions and 23 service elements were divided into bank employees and customer groups, and service priorities were derived after comparative analysis. The Decision tree model was used to supplement the excessive simplification of quality attributes by the modest number of Kano models and to classify and predict by segment market. Of the 23 services, 16 were classified into the same attributes in both groups. 6 services classified as combination attributes used a Decision tree to identify differences in perception of quality attributes among groups. In terms of basic financial services and professional financial services, it was confirmed that bank employees feel financial service robots more attractive than ordinary customers. In the design of IT convergence service, we propose a methodology for deriving quality attributes by combining a Kano model for classifying quality attributes of two groups and a Decision tree for forecasting subdivision markets.

Real Option Decision Tree Models for R&D Project Investment (R&D 프로젝트 투자 의사결정을 위한 실물옵션 의사결정나무 모델)

  • Choi, Gyung-Hyun;Cho, Dae-Myeong;Joung, Young-Ki
    • IE interfaces
    • /
    • v.24 no.4
    • /
    • pp.408-419
    • /
    • 2011
  • R&D is a foundation for new business chance and productivity improvement leading to enormous expense and a long-term multi-step process. During the R&D process, decision-makers are confused due to the various future uncertainties that influence economic and technical success of the R&D projects. For these reasons, several decision-making models for R&D project investment have been suggested; they are based on traditional methods such as Discounted Cash Flow (DCF), Decision Tree Analysis (DTA) and Real Option Analysis (ROA) or some fusion forms of the traditional methods. However, almost of the models have constraints in practical use owing to limits on application, procedural complexity and incomplete reflection of the uncertainties. In this study, to make the constraints minimized, we propose a new model named Real Option Decision Tree Model which is a conceptual combination form of ROA and DTA. With this model, it is possible for the decision-makers to simulate the project value applying the uncertainties onto the decision making nodes.

An Application of Decision Tree Method for Fault Diagnosis of Induction Motors

  • Tran, Van Tung;Yang, Bo-Suk;Oh, Myung-Suck
    • Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
    • /
    • 2006.11a
    • /
    • pp.54-59
    • /
    • 2006
  • Decision tree is one of the most effective and widely used methods for building classification model. Researchers from various disciplines such as statistics, machine learning, pattern recognition, and data mining have considered the decision tree method as an effective solution to their field problems. In this paper, an application of decision tree method to classify the faults of induction motors is proposed. The original data from experiment is dealt with feature calculation to get the useful information as attributes. These data are then assigned the classes which are based on our experience before becoming data inputs for decision tree. The total 9 classes are defined. An implementation of decision tree written in Matlab is used for these data.

  • PDF

Adaptive Decision Tree Algorithm for Machine Diagnosis (기계 진단을 위한 적응형 의사결정 트리 알고리즘)

  • 백준걸;김강호;김창욱;김성식
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.235-238
    • /
    • 2000
  • This article presents an adaptive decision tree algorithm for dynamically reasoning machine failure cause out of real-time, large-scale machine status database. On the basis of experiment using semiconductor etching machine, it has been verified that our model outperforms previously proposed decision tree models.

  • PDF

Decision Tree State Tying Modeling Using Parameter Estimation of Bayesian Method (Bayesian 기법의 모수 추정을 이용한 결정트리 상태 공유 모델링)

  • Oh, SangYeob
    • Journal of Digital Convergence
    • /
    • v.13 no.1
    • /
    • pp.243-248
    • /
    • 2015
  • Recognition model is not defined when you configure a model, Been added to the model after model building awareness, Model a model of the clustering due to lack of recognition models are generated by modeling is causes the degradation of the recognition rate. In order to improve decision tree state tying modeling using parameter estimation of Bayesian method. The parameter estimation method is proposed Bayesian method to navigate through the model from the results of the decision tree based on the tying state according to the maximum probability method to determine the recognition model. According to our experiments on the simulation data generated by adding noise to clean speech, the proposed clustering method error rate reduction of 1.29% compared with baseline model, which is slightly better performance than the existing approach.

Local Feature Based Facial Expression Recognition Using Adaptive Decision Tree (적응형 결정 트리를 이용한 국소 특징 기반 표정 인식)

  • Oh, Jihun;Ban, Yuseok;Lee, Injae;Ahn, Chunghyun;Lee, Sangyoun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.2
    • /
    • pp.92-99
    • /
    • 2014
  • This paper proposes the method of facial expression recognition based on decision tree structure. In the image of facial expression, ASM(Active Shape Model) and LBP(Local Binary Pattern) make the local features of a facial expressions extracted. The discriminant features gotten from local features make the two facial expressions of all combination classified. Through the sum of true related to classification, the combination of facial expression and local region are decided. The integration of branch classifications generates decision tree. The facial expression recognition based on decision tree shows better recognition performance than the method which doesn't use that.

Interpretation of Data Mining Prediction Model Using Decision Tree

  • Kang, Hyuncheol;Han, Sang-Tae;Choi, Jong-Ho
    • Communications for Statistical Applications and Methods
    • /
    • v.7 no.3
    • /
    • pp.937-943
    • /
    • 2000
  • Data mining usually deal with undesigned massive data containing many variables for which their characteristics and association rules are unknown, therefore it is actually not easy to interpret the results of analysis. In this paper, it is shown that decision tree can be very useful in interpreting data mining prediction model using two real examples.

  • PDF