• Title/Summary/Keyword: Tree-Reconstruction

Search Result 107, Processing Time 0.038 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.

A Mobile Multicast Routing Mechanism based on the Comparison of Tree Reconstruction Cost and Tunneling Cost (트리 재구성 비용과 터널링 비용의 비교에 근거한 모바일 멀티캐스트 라우팅 기법)

  • Kim Jae-Soo;Baek Deuk-Hwa
    • Journal of Internet Computing and Services
    • /
    • v.5 no.5
    • /
    • pp.17-26
    • /
    • 2004
  • Mobile multicast schemes are classified into remote subscription and bi-directional tunneling. While the former scheme has much overhead in the maintenances of multicast tree, the latter suffers from inefficient routing. In this paper, we propose dynamic mobile multicast routing (DMMR) scheme, which is operated on the basis of cost functions related with forwarding cost and tree reconstruction cost, Basically DMMR intends to find lower cost between forwarding cost and tree reconstruction cost. Forwarding cost is the cost of tunneling multicast packets from home agent, and tree reconstruction cost is the joining cost of foreign agent to multicast group. In the case that a mobile host moves to the other area, its foreign agent calculates cost functions related with forwarding cost and tree reconstruction cost. If forwarding cost is higher than tree reconstruction cost, foreign agent joins to multicast group and reconstructs the multicast tree. Accordingly, foreign agent can dynamically adapt remote subscription or bi-directional tunneling, Our scheme provides more stable multicast service to the mobile hosts regardless of the movements of mobile host and the number of mobile group members.

  • PDF

3-D Inverse Radon Transform by Use of Tree-Structured Filter Bank

  • Morikawa, Yoshitaka;Murakami, Junichi
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.184-187
    • /
    • 2002
  • Two-dimensional (2-D) X-ray computerized tomography (CT) equipments are widely used in industrial and medical fields, and nowadays studies on reconstruction algorithm for 3-D cone-beam acquisition systems are active for better utilization. The authors recent-By have proposed a fast reconstruction aigorithm using tree-structured filter bank for 2-D C1, and shown the algorithm is applicable to an approximate reconstruction of 3-D CT. For exact 3-D CT reconstruction, however, we have to backproject 1-D signal into 3-D space. This paper proposes a fast implementation method for this back-projection by use of tree-structured filter bank. and shows the proposed method works approximately 700 times faster than the direct one with almost same reconstruction image quality.

  • PDF

A File/Directory Reconstruction Method of APFS Filesystem for Digital Forensics

  • Cho, Gyu-Sang;Lim, Sooyeon
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.14 no.3
    • /
    • pp.8-16
    • /
    • 2022
  • In this paper, we propose a method of reconstructing the file system to obtain digital forensics information from the APFS file system when meta information that can know the structure of the file system is deleted due to partial damage to the disk. This method is to reconstruct the tree structure of the file system by only retrieving the B-tree node where file/directory information is stored. This method is not a method of constructing nodes based on structural information such as Container Superblock (NXSB) and Volume Checkpoint Superblock (APSB), and B-tree root and leaf node information. The entire disk cluster is traversed to find scattered B-tree leaf nodes and to gather all the information in the file system to build information. It is a method of reconstructing a tree structure of a file/directory based on refined essential data by removing duplicate data. We demonstrate that the proposed method is valid through the results of applying the proposed method by generating numbers of user files and directories.

Annual Precipitation Reconstruction Based on Tree-ring Data at Seorak (설악산 지역의 Tree-ring 자료를 이용한 연 강수량 재생성)

  • Kwak, Jae Won;Han, Heechan;Lee, Minjung;Kim, Hung Soo;Mun, Jangwon
    • Journal of Korean Society on Water Environment
    • /
    • v.31 no.1
    • /
    • pp.19-28
    • /
    • 2015
  • The purpose of this research is reconstruction of annual precipitation based on Tree-ring series at Seorak mountain and examine its effectiveness. To do so we performed nonlinear time series characteristics test of Tree-ring series and reconstructed annual precipitation of Gangneung from 1687 to 1911 using Artificial neural network and Nonlinear autoregressive exogeneous input (NARX) model which reflects stochastic properties. As a result, Tree-ring series at Seorak Mountain shows nonlinear time series property and reconstructed annual precipitation series drawn from NARX is similar in statistical characteristics of observed annual time series.

Region Query Reconstruction Method Using Trie-Structured Quad Tree in USN Middleware (USN 미들웨어에서 트라이 구조 쿼드 트리를 이용한 영역 질의 재구성 기법)

  • Cho, Sook-Kyoung;Jeong, Mi-Young;Jung, Hyun-Meen;Kim, Jong-Hoon
    • Journal of Korea Spatial Information System Society
    • /
    • v.10 no.1
    • /
    • pp.15-28
    • /
    • 2008
  • In ubiquitous sensor networks(USN) environment, it is essential to process region query for user-demand services. Using R-tree is a preferred technique to process region query for in-network query environment. In USN environment, USN middleware must select sensors that transfers region query with accuracy because the lifetime of sensors is that of whole sensor networks. When R-tree is used, however, it blindly passes the region query including non-existent sensors where MBR(Minimum Boundary Rectangle) of R-tree is Intersected by region of query. To solve in this problem, we propose a reconstruction of region query method which is a trie-structured Quad tree in the base station that includes sensors in region of query select with accuracy. We observed that the proposed method delays response time than R-tree, but is useful for reducing communication cost and energy consumption.

  • PDF

Preconfigured Multicast Delivery Tree in Mobile IP (Mobile IP에서 기설정된 전달 트리를 이용한 멀티캐스팅 방안)

  • C.B. Chun;C.H. Kang;Lee, J.H.;Kwon, K.H.;Kim, B.S.;Hong, J.P.
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10e
    • /
    • pp.76-78
    • /
    • 2002
  • Multicasting over mobile IP network becomes more important with the increasing needs of supporting multimedia services in mobile network. The IETF has suggested two approaches which are remote subscription and bidirectional tunneling for supporting mobility management in multicasting over mobile IP. But these protocols have problems - the frequent reconstruction of multicast delivery tree, packet less during handoff, convergence problem, and so on. In this paper, we propose to use preconfiguration of multicast delivery tree when mobile host enters the foreign network. It will decrease the frequency of multicast delivery tree reconstruction, and reduce the packet loss during handoff, Also the multicast delivery tree maintained by Keep Alive messages makes the signaling overload of networks diminished.

  • PDF

Optimal Terminal Interconnection Reconstruction along with Terminal Transition in Randomly Divided Planes

  • Youn, Jiwon;Hwang, Byungyeon
    • Journal of information and communication convergence engineering
    • /
    • v.20 no.3
    • /
    • pp.160-165
    • /
    • 2022
  • This paper proposes an efficient method of reconstructing interconnections when the terminals of each plane change in real-time situations where randomly divided planes are interconnected. To connect all terminals when the terminals of each plane are changed, we usually reconstruct the interconnections between all terminals. This ensures a minimum connection length, but it takes considerable time to reconstruct the interconnection for the entire terminal. This paper proposes a solution to obtain an optimal tree close to the minimum spanning tree (MST) in a short time. The construction of interconnections has been used in various design-related areas, from networks to architecture. One of these areas is an ad hoc network that only consists of mobile hosts and communicates with each other without a fixed wired network. Each host of an ad hoc network may appear or disappear frequently. Therefore, the heuristic proposed in this paper may expect various cost savings through faster interconnection reconstruction using the given information in situations where the connection target is changing.

RECONSTRUCTION OF THE CUT TREE (CUT TREE의 재구축)

  • Kim, Chae-Bogk
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.19 no.3
    • /
    • pp.51-57
    • /
    • 1993
  • This paper develops 0($n^3$) algorithm to construct a cut-tree generated by Gomory-Hu algorithm. The algorithm only requires node sets defined by the minimal cut in each of the (n-1) maximal flow determinations. Merging computerized facility layout procedure that uses cut-tree concept to generate design skeletons with our algorithm requires less storage space than merging it with Gomory-Hu algorithm. Also, the cut-tree can easily be modified when the (n-1) minimal cut-sets are updated due to changes on arc capacities.

  • PDF

An Optimal Multicast Routing Protocol for Guaranting Host Mobility in IPv6-Based Mobile Networks (IPv6 기반 이동망에서 호스트 이동성 보장을 위한 최적화된 멀티캐스트 라우팅 프로토콜)

  • 양승제;강명규;박성한
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.5
    • /
    • pp.1-9
    • /
    • 2004
  • In this paper, we propose a multicast routing protocol for the seamless delivery of multicast data to mobile hosts through the optimal route in IPv6-Based mobile networks. The proposed multicast routing protocol reduces the tree reconstruction overhead by limiting the tunneling length according to the mobility of mobile hosts. In this way, our protocol satisfies the bound of the end-to-end delay and supports the seamless handoff. Analytical and simulation results show that the proposed protocol has better performance in terms of the tree reconstruction, tunneling service and multicast packet loss than the previous protocols does.