• 제목/요약/키워드: DT algorithm

검색결과 63건 처리시간 0.031초

대표적인 의사결정나무 알고리즘의 해석력 비교 (Interpretability Comparison of Popular Decision Tree Algorithms)

  • 홍정식;황근성
    • 산업경영시스템학회지
    • /
    • 제44권2호
    • /
    • pp.15-23
    • /
    • 2021
  • Most of the open-source decision tree algorithms are based on three splitting criteria (Entropy, Gini Index, and Gain Ratio). Therefore, the advantages and disadvantages of these three popular algorithms need to be studied more thoroughly. Comparisons of the three algorithms were mainly performed with respect to the predictive performance. In this work, we conducted a comparative experiment on the splitting criteria of three decision trees, focusing on their interpretability. Depth, homogeneity, coverage, lift, and stability were used as indicators for measuring interpretability. To measure the stability of decision trees, we present a measure of the stability of the root node and the stability of the dominating rules based on a measure of the similarity of trees. Based on 10 data collected from UCI and Kaggle, we compare the interpretability of DT (Decision Tree) algorithms based on three splitting criteria. The results show that the GR (Gain Ratio) branch-based DT algorithm performs well in terms of lift and homogeneity, while the GINI (Gini Index) and ENT (Entropy) branch-based DT algorithms performs well in terms of coverage. With respect to stability, considering both the similarity of the dominating rule or the similarity of the root node, the DT algorithm according to the ENT splitting criterion shows the best results.

ATM 망에서 다양한 트래픽을 지원하기 위한 동적 셀 스케줄링 알고리즘 (A New Implementable Scheduling Algorithm Supporting Various Traffics in ATM Networks)

  • 심재정;이원호;변재영;고성제
    • 한국통신학회논문지
    • /
    • 제25권4B호
    • /
    • pp.675-682
    • /
    • 2000
  • 본 논문에서는 ATM 네트워크에서 다양한 멀티미디어 트래픽을 효율적으로 전송하기 위해 동적 우선순위 셀 전송 스케쥴링 기법인 AWRR/DT(Adaptive Weighted Round Robin with Delay Tolerance)를 제안하였다. AWRR/DT는 멀티미디어 트랙픽을 지연 특성에 따라 여러 개의 실시간 클래스와 하나의 비실시간 클래스로 분류하고, 각 클래스의 지연 특성과 입력 트래픽의 양을 고려하여 매 사이클마다 해당 클래스에 적절한 가중치(weight)를 할당 하도록 설계되었다. 또한, 제안한 알고리즘은 셀 폐기 메커니즘을 가지고 있어서 순간적인 서비스 품질(QoS:Quality of Service)열화가 계속 연속적으로 이어지는 현상을 줄여준다. AWRR/DT의 성능을 평가하기 위하여, SLAM II를 이용한 컴퓨터 시뮬레이션을 통해 기존의 스케쥴링 기법들과 평균 지연 측면에서 비교하였다. 그 결과, 제안한 기법이 실시간 트래픽 클래스의 QoS를 만족하면서도 비실시간 트래픽 클래스의 평균 지연을 감소시키 수 있음을 확인하였다.

  • PDF

이차원 물체 정합을 위한 Robust Oriented Hausdorff Measure (Robust Oriented Hausdorff Measure for 2-D Object Matching)

  • 심동규;박래홍
    • 전자공학회논문지S
    • /
    • 제36S권11호
    • /
    • pp.60-67
    • /
    • 1999
  • 본 논문은 2-D 물체 정합을 위한 robust oriented Hausdorff measure (ROHM)을 제안하였다. 이 ROHM은 기존의 Hausdorff distance (HD) 알고리듬의 거리 개념을 Hough 변환의 누적기법으로 대치함으로써 제안되었다. 제안한 알고리듬은 distance transform (DT)을 사용하는 변형된 Hough transform으로 생각할 수 있다. 또한 각 화소의 방향각을 사용하여 부적절한 대응관계를 제거하였다. 여러가지 실험영상을 이용한 실험을 통하여 제안한 알고리듬이 기존의 알고리듬들에 비하여 효율적임을 보였다.

  • PDF

셀룰라 비선형 회로 구조를 이용한 optical flow 검출 (Detecton of OPtical Flow Using Cellular Nonlinear Neural Networks)

  • 손홍락;김형석
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2000년도 하계학술대회 논문집 D
    • /
    • pp.3053-3055
    • /
    • 2000
  • The Cellular Nonlinear Networks structure for Distance Transform (DT) and the robust optical flow detection algorithm based on the DT are proposed. The proposed algorithm is for detecting the optical flows on the trajectories only of the feature points. The translation lengths and the directions of feature movements are detected on the trajectories of feature points on which Distance Transform Field is developed. The robustness caused from the use of the Distance Transform and the easiness of hardware implementation with local analog circuits are the properties of the proposed structure, To verify the performance of the proposed structure and the algorithm, simulation has been done about zooming image.

  • PDF

피라미드 구조를 이용한 계층적 hausdorff distance 정합 (Hierarchical hausdorff distance matching using pyramid structures)

  • 권오규;심동규;박래홍
    • 전자공학회논문지S
    • /
    • 제34S권12호
    • /
    • pp.70-80
    • /
    • 1997
  • This paper proposes a hierarchical Hausdorff distance (HD) matching algorithm baased on coarse-to-fine approach. It reduces the computational complexity greatly by using the pyramidal structures consisting of distance transform (DT) and edge pyramids. Also, inthe proposed hierarchical HD matching, a thresholding method is presented to find an optimal matching position with small error, in which the threshold values are determined by using the property between adjacent level of a DT map pyramid. By computer simulation, the performance of the conventional and proposed hierarchical HD matching algorithms is compared in therms of the matching position for binary images containing uniform noise.

  • PDF

다차원 신호공간 분할을 이용한 데이터 복원 (Data Retrieval by Multi-Dimensional Signal Space Partitioning)

  • 전태현
    • 한국지능시스템학회논문지
    • /
    • 제14권6호
    • /
    • pp.674-677
    • /
    • 2004
  • 본 논문에서는 심볼간의 간섭이 존재하는 채널에서 고정 지연 값을 가지는 트리검색 신호검출기의 효율적인 구성방법을 다룬다. 이 접근방법은 효율적인 다차원 신호공간 분할에 기반을 두고 있다 다차원 공간에서의 Voronoi 다이어그램 (VoD)과 Delaunay 분할 (DT)이 신호검출 알고리즘의 구현에 적용된다 제안된 방식에서는 VOD/DT에 포함되어 있는 기하학적인 정보를 활용하여 관찰된 순차적인 신호의 상대적인 위치가 결정되며 이러한 방식이 구현치 복잡도를 감소시키는 장점이 있음을 보인다. 구체적인 구성 절차가 심볼간의 간섭이 존재하는 통신채널에서의 예를 가지고 논의되며 시뮬레이션 결과가 논의된다.

Performance Oriented Docket-NoC (Dt-NoC) Scheme for Fast Communication in NoC

  • Vijayaraj, M.;Balamurugan, K.
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • 제16권3호
    • /
    • pp.359-366
    • /
    • 2016
  • Today's multi-core technology rapidly increases with more and more Intellectual Property cores on a single chip. Network-on-Chip (NoC) is an emerging communication network design for SoC. For efficient on-chip communication, routing algorithms plays an important role. This paper proposes a novel multicast routing technique entitled as Docket NoC (Dt-NoC), which eliminates the need of routing tables for faster communication. This technique reduces the latency and computing power of NoC. This work uses a CURVE restriction based algorithm to restrict few CURVES during the communication between source and destination and it prevents the network from deadlock and livelock. Performance evaluation is done by utilizing cycle accurate RTL simulator and by Cadence TSMC 18 nm technology. Experimental results show that the Dt-NoC architecture consumes power approximately 33.75% 27.65% and 24.85% less than Baseline XY, EnA, OEnA architectures respectively. Dt-NoC performs good as compared to other routing algorithms such as baseline XY, EnA, OEnA distributed architecture in terms of latency, power and throughput.

A Three-phase Hybrid Power Flow Algorithm for Meshed Distribution System with Transformer Branches and PV Nodes

  • Li, Hongwei;Wu, Huabing;Jiang, Biyu;Zhang, Anan;Fang, Wei
    • Journal of Electrical Engineering and Technology
    • /
    • 제11권1호
    • /
    • pp.65-75
    • /
    • 2016
  • Aiming at analyzing the power flow of the distribution systems with distribution transformer (DT) branches and PV nodes, a hybrid three-phase power flow methodology is presented in this paper. The incidence formulas among node voltages, loop currents and node current injections have been developed based on node-branch incidence matrix of the distribution network. The method can solve the power flow directly and has higher efficiency. Moreover, the paper provides a modified method to model DT branches by considering winding connections, phase shifting and off-nominal tap ratio, and then DT branches could be seen like one transmission line with the proposed power flow method. To deal with the PV nodes, an improved approach to calculate reactive power increment at each PV node was deduced based on the assumption that the positive-sequence voltage magnitude of PV node is fixed at a given value. Then during calculating the power flow at each iteration, it only needs to update current injection at each PV node with the proposed algorithm. The process is very simple and clear. The results of IEEE 4 nodes and the modified IEEE 34 nodes test feeders verified the correctness and efficiency of the proposed hybrid power flow algorithm.

A Novel Resource Allocation Algorithm in Multi-media Heterogeneous Cognitive OFDM System

  • Sun, Dawei;Zheng, Baoyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제4권5호
    • /
    • pp.691-708
    • /
    • 2010
  • An important issue of supporting multi-users with diverse quality-of-service (QoS) requirements over wireless networks is how to optimize the systematic scheduling by intelligently utilizing the available network resource while, at the same time, to meet each communication service QoS requirement. In this work, we study the problem of a variety of communication services over multi-media heterogeneous cognitive OFDM system. We first divide the communication services into two parts. Multimedia applications such as broadband voice transmission and real-time video streaming are very delay-sensitive (DS) and need guaranteed throughput. On the other side, services like file transmission and email service are relatively delay tolerant (DT) so varying-rate transmission is acceptable. Then, we formulate the scheduling as a convex optimization problem, and propose low complexity distributed solutions by jointly considering channel assignment, bit allocation, and power allocation. Unlike prior works that do not care computational complexity. Furthermore, we propose the FAASA (Fairness Assured Adaptive Sub-carrier Allocation) algorithm for both DS and DT users, which is a dynamic sub-carrier allocation algorithm in order to maximize throughput while taking into account fairness. We provide extensive simulation results which demonstrate the effectiveness of our proposed schemes.

중국 콜드체인 물류에 관한 연구: 혼합유전알고리즘 접근법 (A Study of Cold Chain Logistics in China: Hybrid Genetic Algorithm Approach)

  • 진성;장은미
    • 한국산업정보학회논문지
    • /
    • 제25권6호
    • /
    • pp.159-169
    • /
    • 2020
  • 본 연구에서는 중국에서 유통되고 있는 냉장식품 (-1℃ to 8℃)에 대한 콜드체인 물류(Cold chain logistics: CCL) 모델이 개발되었다. CCL 모델은 분배센터 (Distribution center: DC)와 배포대상지점 (Distribution target points: DT)으로 구성되어 있으며, CCL 모델의 목적함수는 모든 유통업체의 총 유통경로를 최소화하는 것이다. 목적함수를 통한 최적결과 도출을 위해 혼합유전알고리즘(Hybrid genetic algorithm: HGA) 접근법을 제안한다. HGA 접근법은 개선된 K-means 방법과 유전알고리즘을 결합하여 구성된다. 사례연구에서는 유통경로와 유통 가능한 거리 기준으로 CCL 모델에 대해 3개의 시나리오를 고려하였으며, 이를 제안된 HGA접근법을 사용하여 해결하였다. 결과분석을 통해 제안된 HGA접근법을 사용할 경우 유통비용이 절감되고, 마일리지가 약 19%, 20%, 16% 정도 감소됨을 확인하였다.