• Title/Summary/Keyword: answer tree

Search Result 38, Processing Time 0.029 seconds

Environmental Predictors of Atopic Dermatitis in Children - Using Answer Tree Analysis - (아동 아토피 피부염을 예측하는 환경적 요인들 - 의사결정 나무분석의 적용 -)

  • Lee, Ju-Lie
    • Korean Journal of Child Studies
    • /
    • v.31 no.2
    • /
    • pp.183-195
    • /
    • 2010
  • This study sought to investigate the environmental predictors of atopic dermatitis in children. The participants were 1050 (age 3-5) children taken from data data from the Ministry for Health, Welfare and Family Affairs. A data mining decision tree model revealed that the factors of medical neglect, breakfast, attachment to mother, and mother's depression influenced atopic dermatitis in children. Our results revealed that in the factors considered above, medical neglect had the greatest influence upon atopic dermatitis in children.

Selection of an Optimal Algorithm among Decision Tree Techniques for Feature Analysis of Industrial Accidents in Construction Industries (건설업의 산업재해 특성분석을 위한 의사결정나무 기법의 상용 최적 알고리즘 선정)

  • Leem Young-Moon;Choi Yo-Han
    • Journal of the Korea Safety Management & Science
    • /
    • v.7 no.5
    • /
    • pp.1-8
    • /
    • 2005
  • The consequences of rapid industrial advancement, diversified types of business and unexpected industrial accidents have caused a lot of damage to many unspecified persons both in a human way and a material way Although various previous studies have been analyzed 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. The main objective of this study is to find an optimal algorithm for data analysis of industrial accidents and 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 AnswerTree of SPSS will be used to evaluate the validity of the results of the four algorithms. The sample for this work chosen from 19,574 data related to construction industries during three years ($2002\sim2004$) in Korea.

Recognition Surrey of Patients about Eight Constitution Medicine (8체질의학에 대한 환자 인식 조사)

  • Park, Jae-Sung;Park, Young-Jae;Min, Jae-Young;Shin, Yong-Sup;Lee, Sang-Chul;Park, Young-Bae;Kim, Min-Yong
    • The Journal of the Society of Korean Medicine Diagnostics
    • /
    • v.11 no.1
    • /
    • pp.130-145
    • /
    • 2007
  • Background and purpose: The purpose of this study is to search recognition patients in Eight constitution Oriental Medical Clinic. And we compare Eight constitution acupuncture methods with the another acupuncture methods. Methods: The subjects were comprised of 200 volunteers. In 3 Eight constitution Oriental Medical Clinic participants were chosen through questionnaire. Finishing answer participants put in their lacked name questionnaire to gathering box. DecisionTree (AnswerTree 3.0 Ver.) statistical software was used for statistical analysis. Results and Conclusion: As a result of the analysis of cognition to Eight constitution acupuncture methods was influenced to patients health, dietetic therapy is best influenced. Next influenced acupuncture reflex degree, age, job, constitution, cure periods, sex distinction, cure degree, diagnosed participant's Constitution by pulse diagnosis in 8 Constitution Medicine.

  • PDF

Unusual data local access using inverse order tree (역순트리를 이용한 특이데이터 국소적 접근)

  • Rim, Kwang-Cheol;Seol, Jung-Ja
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.3
    • /
    • pp.595-601
    • /
    • 2014
  • With the advent of the Smart information-communication era, the number of data has increased exponentially. Accordingly, figuring out and analyzing in which area and circumstance the data has been created becomes one of the factors for prompt actions. In this paper identifies how to analyze the data by implementing a route from the lowest module to highest one in an inverse order for the part judgement for the particular data. The script first identifies cluster analisys, paralizes the analysis using the sum of each factors of the cluster with the tree structure, and finally transpose the answer into number. Also, it is designed to place priority on particular answer, thereafter, draws the wanted answer real-time.

Comparison of cardiac arrests from sport & leisure activities with patients returning of spontaneous circulation using Answer Tree analysis (의사결정나무분석에 의한 스포츠 레저활동 심정지군과 자발순환 회복군의 비교)

  • Park, Sang-Kyu;Uhm, Tai-Hwan
    • The Korean Journal of Emergency Medical Services
    • /
    • v.15 no.3
    • /
    • pp.57-70
    • /
    • 2011
  • Purpose : The purpose of this study was to reveal some factors of ROSC & survival for cardiac arrests from sport & leisure activities(CASLs). Methods : A retrospective study of the 1,341 out of hospital cardiac arrests(OHCAs) treated by EMS in Gyeonggi Provincial Fire and Disaster Headquarters from January to December in 2008 was conducted. The primary end-point was admission to emergency room. To clarify the factors through comparison of CASLs(n=58) with ROSCs & survivals(n=58), Answer Tree analysis for data mining with the CHAID algorithm was performed and alpha was set at .05. Mean, median, and percentile of time intervals, distances, and age on the 58 CASLs, 75 ROSCs, and 27 survivals(patients admitted to emergency room) were analysed. Results : Fourteen CASLs(24.1%), 41 ROSCs(54.7%), 16 survivals(59.3%) were treated with CPR within 5 min., and only 2 CASLs(3.4%), 11 ROSCs(14.7%), 10 survivals(37.0%) were treated with defilbrillation within 10 min. from arrest. If time recording from arrest to defilbrillation, the patients were classified 81.0%($X^2=9.83$, p=.005) into ROSCs & survivals. And the patients with no history, 100.0%($X^2=5.44$, p=.020). The other patients with no intention, 87.5%($X^2=7.00$, p=.024). Whereas the other patients with intention, treated with CPR after 4 min. from arrest were classified 67.2%($X^2=3.99$, p=.046) into CASLs. Conclusion : CPR within 4 minutes was the most important factor that discriminates between CASLs and ROSCs & survivals to record cardiac arrests-defilbrillation time. CPR within 4 min. from arrest, no history, and no intention were factors for improved ROSC & survival.

The prediction Models for Clearance Times for the unexpected Incidences According to Traffic Accident Classifications in Highway (고속도로 사고등급별 돌발상황 처리시간 예측모형 및 의사결정나무 개발)

  • Ha, Oh-Keun;Park, Dong-Joo;Won, Jai-Mu;Jung, Chul-Ho
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.9 no.1
    • /
    • pp.101-110
    • /
    • 2010
  • In this study, a prediction model for incident reaction time was developed so that we can cope with the increasing demand for information related to the accident reaction time. For this, the time for dealing with accidents and dependent variables were classified into incident grade, A, B, and C. Then, fifteen independent variables including traffic volume, number of accident-related vehicles and the accidents time zone were utilized. As a result, traffic volume, possibility of including heavy vehicles, and an accident time zone were found as important variables. The results showed that the model has some degree of explanatory power. In addition, when the CHAID Technique was applied, the Answer Tree was constructed based on the variables included in the prediction model for incident reaction time. Using the developed Answer Tree model, accidents firstly were classified into grades A, B, and C. In the secondary classification, they were grouped according to the traffic volume. This study is expected to make a contribution to provide expressway users with quicker and more effective traffic information through the prediction model for incident reaction time and the Answer Tree, when incidents happen on expressway

A New Flash TPR-tree for Indexing Moving Objects with Frequent Updates

  • Lim, Seong-Chae
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.14 no.1
    • /
    • pp.95-104
    • /
    • 2022
  • A TPR-tree is a well-known indexing structure that is developed to answer queries about the current or future time locations of moving objects. For the purpose of space efficiency, the TPR-tree employs the notion of VBR (velocity bounding rectangle)so that a regionalrectangle presents varying positions of a group of moving objects. Since the rectangle computed from a VBR always encloses the possible maximum range of an indexed object group, a search process only has to follow VBR-based rectangles overlapped with a given query range, while searching toward candidate leaf nodes. Although the TPR-tree index shows up its space efficiency, it easily suffers from the problem of dead space that results from fast and constant expansions of VBR-based rectangles. Against this, the TPR-tree index is enforced to update leaf nodes for reducing dead spaces within them. Such an update-prone feature of the TPR-tree becomes more problematic when the tree is saved in flash storage. This is because flash storage has very expensive update costs. To solve this problem, we propose a new Bloom filter based caching scheme that is useful for reducing updates in a flash TPR-tree. Since the proposed scheme can efficiently control the frequency of updates on a leaf node, it can offer good performance for indexing moving objects in modern flash storage.

A Simple and Fast Anti-collision Protocol for Large-scale RFID Tags Identification

  • Jia, Xiaolin;Feng, Yuhao;Gu, Yajun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.4
    • /
    • pp.1460-1478
    • /
    • 2020
  • This paper proposes a novel anti-collision protocol for large-scale RFID tags identification, named Bi-response Collision Tree Protocol (BCT). In BCT, two group of tags answer the reader's same query in two response-cycles respectively and independently according to the bi-response pattern. BCT improves the RFID tag identification performance significantly by decreasing the query cycles and the bits transmitted by the reader and tags during the identification. Computation and simulation results indicate that BCT improves the RFID tag identification performance effectively, e.g. the tag identification speed is improved more than 13.0%, 16.9%, and 22.9% compared to that of Collision Tree Protocol (CT), M-ary Collision Tree Protocol (MCT), and Dual Prefix Probe Scheme (DPPS) respectively when tags IDs are distributed uniformly.

Estimating the determinants of victory and defeat through analyzing records of Korean pro-basketball (한국남자프로농구 경기기록 분석을 통한 승패결정요인 추정: 2010-2011시즌, 2011-2012시즌 정규리그 기록 적용)

  • Kim, Sae-Hyung;Lee, Jun-Woo;Lee, Mi-Sook
    • Journal of the Korean Data and Information Science Society
    • /
    • v.23 no.5
    • /
    • pp.993-1003
    • /
    • 2012
  • The purpose of this study was to estimate the determinants of victory and defeat through analyzing records of Korean men pro-basketball. Statistical models of victory and defeat were established by collecting present basketball records (2010-2011, 2011-2012 season). Korea Basketball League (KBL) informs records of every pro-basketball game data. The six offence variables (2P%, 3P%, FT%, OR, AS, TO), and the four defense variables (DR, ST, GD, BS) were used in this study. PASW program was used for logistic regression and Answer Tree program was used for the decision tree. All significance levels were set at .05. Major results were as follows. In the logistic regression, 2P%, 3P%, and TO were three offense variables significantly affecting victory and defeat, and DR, ST, and BS were three significant defense variables. Offensive variables 2P%, 3P%, TO, and AS are used in constructing the decision tree. The highest percentage of victory was 80.85% when 2P% was in 51%-58%, 3P% was more than 31 percent, and TO was less than 11 times. In the decision tree of the defence variables, the highest percentage of victory was 94.12% when DR was more than 24, ST was more than six, and BS was more than two times.

An Indexing Technique for Range Sum Queries in Spatio - Temporal Databases (시공간 데이타베이스에서 영역 합 질의를 위한 색인 기법)

  • Cho Hyung-Ju;Choi Yong-Jin;Min Jun-Ki;Chung Chin-Wan
    • Journal of KIISE:Databases
    • /
    • v.32 no.2
    • /
    • pp.129-141
    • /
    • 2005
  • Although spatio-temporal databases have received considerable attention recently, there has been little work on processing range sum queries on the historical records of moving objects despite their importance. Since to answer range sum queries, the direct access to a huge amount of data incurs prohibitive computation cost, materialization techniques based on existing index structures are recently suggested. A simple but effective solution is to apply the materialization technique to the MVR-tree known as the most efficient structure for window queries with spatio-temporal conditions. However, the MVR-tree has a difficulty in maintaining pre-aggregated results inside its internal nodes due to cyclic paths between nodes. Aggregate structures based on other index structures such as the HR-tree and the 3DR-tree do not provide satisfactory query performance. In this paper, we propose a new indexing technique called the Adaptive Partitioned Aggregate R-Tree (APART) and query processing algorithms to efficiently process range sum queries in many situations. Experimental results show that the performance of the APART is typically above 2 times better than existing aggregate structures in a wide range of scenarios.