• Title/Summary/Keyword: Tree-Based

Search Result 4,242, Processing Time 0.033 seconds

A Comparative Study of Medical Data Classification Methods Based on Decision Tree and System Reconstruction Analysis

  • Tang, Tzung-I;Zheng, Gang;Huang, Yalou;Shu, Guangfu;Wang, Pengtao
    • Industrial Engineering and Management Systems
    • /
    • v.4 no.1
    • /
    • pp.102-108
    • /
    • 2005
  • This paper studies medical data classification methods, comparing decision tree and system reconstruction analysis as applied to heart disease medical data mining. The data we study is collected from patients with coronary heart disease. It has 1,723 records of 71 attributes each. We use the system-reconstruction method to weight it. We use decision tree algorithms, such as induction of decision trees (ID3), classification and regression tree (C4.5), classification and regression tree (CART), Chi-square automatic interaction detector (CHAID), and exhausted CHAID. We use the results to compare the correction rate, leaf number, and tree depth of different decision-tree algorithms. According to the experiments, we know that weighted data can improve the correction rate of coronary heart disease data but has little effect on the tree depth and leaf number.

Bus Reconfiguration Strategy Based on Local Minimum Tree Search for the Event Processing of Automated Distribution Substation (자동화된 변전소의 이벤트 발생시 준최적 탐색법에 기반한 모선 재구성 전략의 개발)

  • Ko Yun-Seok
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.53 no.10
    • /
    • pp.565-572
    • /
    • 2004
  • This paper proposes an expert system which can enhance the accuracy of real-time bus reconfiguration strategy by adopting local minimum tree search method and minimize the spreading effect of the fault by considering totally the operating condition when a main transformer fault occurs in the automated substation. The local minimum tree search method to expand the best-first search method. This method has an advantage which can improve the performance of solution within the limits of the real-time condition. The inference strategy proposed expert system consists of two stages. The first stage determines the switching candidate set by searching possible switching candidates starting from the main transformer or busbar related to the event. And, second stage determines the rational real-time bus reconfiguration strategy based on heuristic rules for the obtained switching candidate set. Also, this paper studies the generalized distribution substation modelling using graph theory and a substation database is designed based on the study result. The inference engine of the expert system and the substation database is implemented in MFC function of Visual C++. Finally, the performance and effectiveness of the proposed expert system is verified by comparing the best-first search solution and local minimum tree search solution based on diversity event simulations for typical distribution substation.

Night-time Vehicle Detection Based On Multi-class SVM (다중-클래스 SVM 기반 야간 차량 검출)

  • Lim, Hyojin;Lee, Heeyong;Park, Ju H.;Jung, Ho-Youl
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.10 no.5
    • /
    • pp.325-333
    • /
    • 2015
  • Vision based night-time vehicle detection has been an emerging research field in various advanced driver assistance systems(ADAS) and automotive vehicle as well as automatic head-lamp control. In this paper, we propose night-time vehicle detection method based on multi-class support vector machine(SVM) that consists of thresholding, labeling, feature extraction, and multi-class SVM. Vehicle light candidate blobs are extracted by local mean based thresholding following by labeling process. Seven geometric and stochastic features are extracted from each candidate through the feature extraction step. Each candidate blob is classified into vehicle light or not by multi-class SVM. Four different multi-class SVM including one-against-all(OAA), one-against-one(OAO), top-down tree structured and bottom-up tree structured SVM classifiers are implemented and evaluated in terms of vehicle detection performances. Through the simulations tested on road video sequences, we prove that top-down tree structured and bottom-up tree structured SVM have relatively better performances than the others.

Detection of Individual Tree Species Using Object-Based Classification Method with Unmanned Aerial Vehicle (UAV) Imagery

  • Park, Jeongmook;Sim, Woodam;Lee, Jungsoo
    • Journal of Forest and Environmental Science
    • /
    • v.35 no.3
    • /
    • pp.181-188
    • /
    • 2019
  • This study was performed to construct tree species classification map according to three information types (spectral information, texture information, and spectral and texture information) by altitude (30 m, 60 m, 90 m) using the unmanned aerial vehicle images and the object-based classification method, and to evaluate the concordance rate through field survey data. The object-based, optimal weighted values by altitude were 176 for 30 m images, 111 for 60 m images, and 108 for 90 m images in the case of Scale while 0.4/0.6, 0.5/0.5, in the case of the shape/color and compactness/smoothness respectively regardless of the altitude. The overall accuracy according to the type of information by altitude, the information on spectral and texture information was about 88% in the case of 30 m and the spectral information was about 98% and about 86% in the case of 60 m and 90 m respectively showing the highest rates. The concordance rate with the field survey data per tree species was the highest with about 92% in the case of Pinus densiflora at 30 m, about 100% in the case of Prunus sargentii Rehder tree at 60 m, and about 89% in the case of Robinia pseudoacacia L. at 90 m.

A Proposal on Game Engine Behavior Tree (게임 엔진 행동 트리 제안)

  • Lee, Myoun-Jae
    • Journal of Digital Convergence
    • /
    • v.14 no.8
    • /
    • pp.415-421
    • /
    • 2016
  • A behavior tree is to express the behavior of artificial intelligence. The behavior tree has a characteristic that is easy to change state transitions than FSM(Finite State Machine), see the progress of the action. For these reasons, the behavior tree is widely used in more than FSM. This paper is to analyze the advantages and disadvantages on behavior trees of game engines, proposes the improved behavior tree based on analyzed them. To achieve this, in this paper, first, examines the role of node and the behavior tree structure of the unity engine, unreal engine. Second, discusses the advantages and disadvantages based on it. Third, proposes the behavior tree to improve the disadvantages of behavior tree of unity engine and unreal engine, depth of behavior tree and search time required to select the execution node. This paper can help developers using the tree to develop the game.

Region-based Tree Multicasting Protocol in Wireless Ad-Hoc Networks (무선 에드혹 네트워크에서 지역 기반 트리를 이용한 멀티캐스팅 프로토콜)

  • Lim Jung-Eun;Yoo Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.11B
    • /
    • pp.772-783
    • /
    • 2005
  • In this paper, we propose an effective multicasting protocol in wireless ad-hoc networks. Conventional wired and wireless network multicast protocols do not perform well in wireless ad hoc networks because they were designed without consideration of ad hoc environments such as node mobility, limited bandwidth, high error probability. To solve this problem, some multicasting protocols for ad hoc network have been proposed in the literature. However, these protocols can not provide high packet delivery ratio, low control packet overhead and low expended bandwidth at the same time. Therefore, in this paper, we propose RTMA that improves multicasting performance in wireless ad hoc networks. RTMA calculates its current region from its position information by using GPS in order to make tree among the multicast group nodes in the same region. The proposed region-based tree method is for high packet delivery ratio, low control packet overhead when many senders send data packets. RTMA makes a reliable tree by using speed information to fill a gap of the weak points of the tree structure. When searching the routing path, RTMA selects the reliable path excluding high speed nodes.

Decision Tree based Scheduling for Static and Dynamic Flexible Job Shops with Multiple Process Plans (다중 공정계획을 가지는 정적/동적 유연 개별공정에 대한 의사결정 나무 기반 스케줄링)

  • Yu, Jae-Min;Doh, Hyoung-Ho;Kwon, Yong-Ju;Shin, Jeong-Hoon;Kim, Hyung-Won;Nam, Sung-Ho;Lee, Dong-Ho
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.32 no.1
    • /
    • pp.25-37
    • /
    • 2015
  • This paper suggests a decision tree based approach for flexible job shop scheduling with multiple process plans. The problem is to determine the operation/machine pairs and the sequence of the jobs assigned to each machine. Two decision tree based scheduling mechanisms are developed for static and dynamic flexible job shops. In the static case, all jobs are given in advance and the decision tree is used to select a priority dispatching rule to process all the jobs. Also, in the dynamic case, the jobs arrive over time and the decision tree, updated regularly, is used to select a priority rule in real-time according to a rescheduling strategy. The two decision tree based mechanisms were applied to a flexible job shop case with reconfigurable manufacturing cells and a conventional job shop, and the results are reported for various system performance measures.

Network Architecture and Routing Protocol for Supporting Mobile IP in Mobile Ad Hoc Networks (이동 애드 혹 네트워크의 Mobile IP 지원을 위한 네트워크 구조 및 라우팅 프로토콜)

  • Oh, Hoon;TanPhan, Anh
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.1A
    • /
    • pp.24-35
    • /
    • 2008
  • We propose a tree-based integrated network of infrastructure network and mobile ad hoc network to effectively support Mobile IP for mobile ad hoc networks and also proposed a network management protocol for formation and management of the integrated network and a tree-based routing protocol suitable for the integrated network. The integrated network has fixed gateways(IGs) that connect two hybrid networks and the mobile nodes in the network form a small sized trees based on the mobile nodes that are in the communication distance with a IG. A new node joins an arbitrary tree and is registered with its HA and FA along tree path. In addition, the proposed protocol establishes a route efficiently by using the tree information managed in every node. We examined the effectiveness of the tree-based integrated network for some possible network deployment scenarios and compared our routing protocol against the Mobile IP supported AODV protocol.

KDBcs-Tree : An Efficient Cache Conscious KDB-Tree for Multidimentional Data (KDBcs-트리 : 캐시를 고려한 효율적인 KDB-트리)

  • Yeo, Myung-Ho;Min, Young-Soo;Yoo, Jae-Soo
    • Journal of KIISE:Databases
    • /
    • v.34 no.4
    • /
    • pp.328-342
    • /
    • 2007
  • We propose a new cache conscious indexing structure for processing frequently updated data efficiently. Our proposed index structure is based on a KDB-Tree, one of the representative index structures based on space partitioning techniques. In this paper, we propose a data compression technique and a pointer elimination technique to increase the utilization of a cache line. To show our proposed index structure's superiority, we compare our index structure with variants of the CR-tree(e.g. the FF CR-tree and the SE CR-tree) in a variety of environments. As a result, our experimental results show that the proposed index structure achieves about 85%, 97%, and 86% performance improvements over the existing index structures in terms of insertion, update and cache-utilization, respectively.

A Hybrid Approach to Arbitrate Tag Collisions in RFID systems (RFID 시스템에서 태그 충돌 중재를 위한 하이브리드 기법)

  • Ryu, Ji-Ho;Lee, Ho-Jin;Seok, Yong-Ho;Kwon, Tae-Kyoung;Choi, Yang-Hee
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.6
    • /
    • pp.483-492
    • /
    • 2007
  • In this paper, we propose a new hybrid approach based on query tree protocol to arbitrate tag collisions in RFID systems. The hybrid query tree protocol that combines a tree based query protocol with a slotted backoff mechanism. The proposed protocol decreases the average identification delay by reducing collisions and idle time. To reduce collisions, we use a 4-ary query tree instead of a binary query tree. To reduce idle time, we introduce a slotted backoff mechanism to reduce the number of unnecessary Query commands. Simulation and numerical analysis reveal that the proposed protocol achieves lower identification delay than existing tag collision arbitration protocols.