• Title/Summary/Keyword: Discretization Algorithm

Search Result 124, Processing Time 0.026 seconds

Multi-Interval Discretization of Continuous-Valued Attributes for Constructing Incremental Decision Tree (증분 의사결정 트리 구축을 위한 연속형 속성의 다구간 이산화)

  • Baek, Jun-Geol;Kim, Chang-Ouk;Kim, Sung-Shick
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.27 no.4
    • /
    • pp.394-405
    • /
    • 2001
  • Since most real-world application data involve continuous-valued attributes, properly addressing the discretization process for constructing a decision tree is an important problem. A continuous-valued attribute is typically discretized during decision tree generation by partitioning its range into two intervals recursively. In this paper, by removing the restriction to the binary discretization, we present a hybrid multi-interval discretization algorithm for discretizing the range of continuous-valued attribute into multiple intervals. On the basis of experiment using semiconductor etching machine, it has been verified that our discretization algorithm constructs a more efficient incremental decision tree compared to previously proposed discretization algorithms.

  • PDF

Study on the Finite Element Discretization of the Level Set Redistancing Algorithm (Level Set Redistancing 알고리즘의 유한요소 이산화 기법에 대한 연구)

  • Kang Sungwoo;Yoo Jung Yul;Lee Yoon Pyo;Choi HyoungGwon
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.29 no.6 s.237
    • /
    • pp.703-710
    • /
    • 2005
  • A finite element discretization of the advection and redistancing equations of level set method has been studied. It has been shown that Galerkin spatial discretization combined with Crank-Nicolson temporal discretization of the advection equation of level set yields a good result and that consistent streamline upwind Petrov-Galerkin(CSUPG) discretization of the redistancing equation gives satisfactory solutions for two test problems while the solutions of streamline upwind Petrov-Galerkin(SUPG) discretization are dissipated by the numerical diffusion added for the stability of a hyperbolic system. Furthermore, it has been found that the solutions obtained by CSUPG method are comparable to those by second order ENO method.

Time Discretization of Nonlinear System with Variable Time-delay Input Using Taylor Series Expansion (Taylor series를 이용한 시변 지연 입력을 갖는 비선형 시스템의 이산화)

  • Choi Hyung Jo;Park Ji Hyang;Lee Su Young;Chong Kil To
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.11 no.1
    • /
    • pp.1-8
    • /
    • 2005
  • A new discretization algorithm for nonlinear systems with delayed input is proposed. The algorithm is represented by Taylor series expansion and ZOH assumption. This method is applied to the sampled-data representation of a nonlinear system with the time-delay input. Additionally, the delay in input is time varying and its amplitude is bounded. The maximum time-delay in input is assumed to be two sampling periods. The mathematical expressions of the discretization method are presented and the ability of the algorithm is tested for some of the examples. The computer simulation proves the proposed algorithm discretizes the nonlinear system with the variable time-delay input accurately.

Time Discretization of the Nonlinear System with Variable Time-delayed Input using a Taylor Series Expansion

  • Choi, Hyung-Jo;Chong, Kil-To
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.2562-2567
    • /
    • 2005
  • This paper suggests a new method discretization of nonlinear system using Taylor series expansion and zero-order hold assumption. This method is applied into the sampled-data representation of a nonlinear system with input time delay. Additionally, the delayed input is time varying and its amplitude is bounded. The maximum time-delayed input is assumed to be two sampling periods. Them mathematical expressions of the discretization method are presented and the ability of the algorithm is tested for some of the examples. And 'hybrid' discretization scheme that result from a combination of the ‘scaling and squaring' technique with the Taylor method are also proposed, especially under condition of very low sampling rates. The computer simulation proves the proposed algorithm discretized the nonlinear system with the variable time-delayed input accurately.

  • PDF

Development of Structure Analysis Program for Jointed Concrete Pavement Applying Load Discretization Algorithm (하중변환 알고리듬을 적용한 줄눈 콘크리트 포장해석 프로그램 개발)

  • Yun, Tae-Young;Kim, Ji-Won;Cho, Yoon-Ho
    • International Journal of Highway Engineering
    • /
    • v.5 no.4 s.18
    • /
    • pp.1-11
    • /
    • 2003
  • Recently, the new pavement design method considering Korean environment and the specification for improving performance of pavement are being developed in Korea. The Jointed Concrete Pavement Program Applying Load Discretization Algorithm (called HEART-JCP) is one of the results of Korea Pavement Research Project in Korea. HEART-JCP program is developed to analyze various loading condition using the load discretization algorithm without mesh refinement. In addition, it can be modified easily into multi-purpose concrete pavement nidyses program because of the modularized structure characteristic of HEART-JCP. The program consists of basic program part and load discretization part. In basic program part, the displacement and stress are computed in the concrete slab, sub-layer, and dowel bar, which are modeled with plate/shell element, spring element and beam element. In load discretization program part, load discretization algorithm that was used for the continuum solid element is modified to analyze the model with plate and shell element. The program can analyze the distributed load, concentrated load, thermal load and body load using load discretization algorithm. From the result of verification and sensitivity study, it was known that the loading position, the magnitude of load, and the thickness of slab were the major factors of concrete pavement behavior as expected. Since the result of the model developed is similar to the results of Westergaard solution and ILLISLAB, the program can be used to estimate the behavior of jointed concrete pavement reasonably.

  • PDF

AN ABS ALGORITHM FOR SOLVING SINGULAR NONLINEAR SYSTEMS WITH RANK ONE DEFECT

  • Ge, Ren-Dong;Xia, Zun-Quan
    • Journal of applied mathematics & informatics
    • /
    • v.9 no.1
    • /
    • pp.167-183
    • /
    • 2002
  • A modified discretization ABS algorithm for solving a class of singular nonlinear systems, F($\chi$)=0, where $\chi$, F $\in$ $R^n$, is presented, constructed by combining a discretization ABS algorithm arid a method of Hoy and Schwetlick (1990). The second order differential operation of F at a point is not required to be calculated directly in this algorithm. Q-quadratic convergence of this algorithm is given.

Comparison of Multiway Discretization Algorithms for Data Mining

  • Kim, Jeong-Suk;Jang, Young-Mi;Na, Jong-Hwa
    • Journal of the Korean Data and Information Science Society
    • /
    • v.16 no.4
    • /
    • pp.801-813
    • /
    • 2005
  • The discretization algorithms for continuous data have been actively studied in the area of data mining. These discretizations are very important in data analysis, especially for efficient model selection in data mining. So, in this paper, we introduce the principles of some mutiway discretization algorithms including KEX, 1R and CN4 algorithm and investigate the efficiency of these algorithms through numerical study. For various underlying distribution, we compare these algorithms in view of misclassification rate.

  • PDF

Time Discretization of Nonlinear Systems with Variable Time-Delayed Inputs using a Taylor Series Expansion

  • Choi Hyung-Jo;Chong Kil-To
    • Journal of Mechanical Science and Technology
    • /
    • v.20 no.6
    • /
    • pp.759-769
    • /
    • 2006
  • This paper proposes a new method of discretization for nonlinear systems using a Taylor series expansion and the zero-order hold assumption. The method is applied to sampled-data representations of nonlinear systems with input time delays. The delayed input varies in time and its amplitude is bounded. The maximum time-delayed input is assumed to be two sampling periods. The mathematical expressions of the discretization method are presented and the ability of the algorithm is tested using several examples. A computer simulation is used to demonstrate that the proposed algorithm accurately discretizes nonlinear systems with variable time-delayed inputs.

A Discretization Algorithm for Bi-Matrix Game Approach to Power Market Analysis (전력시장 해석을 위한 Bi-matrix 게임의 이산화 알고리즘)

  • 이광호
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.52 no.1
    • /
    • pp.62-67
    • /
    • 2003
  • An important aspect of the study of power system markets involves the assessment of strategic behavior of participants for maximizing their profits. In models of imperfect competition of a deregulated electricity system, the key task is to find the Nash equilibrium. In this paper, the bimatrix approach for finding Nash equilibria in electricity markets is investigated. This approach determines pure and mixed equilibria using the complementarity pivot algorithim. The mixed equilibrium in the matrix approach has the equal number of non-zero property. This property makes it difficult to reproduce a smooth continuous distribution for the mixed equilibrium. This paper proposes an algorithm for adjusting the quantization value of discretization to reconstruct a continuous distribution from a discrete one.

Time-Discretization of Non-Affine Nonlinear System with Delayed Input Using Taylor-Series

  • Park, Ji-Hyang;Chong, Kil-To;Kazantzis, Nikolaos;Parlos, Alexander G.
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.8
    • /
    • pp.1297-1305
    • /
    • 2004
  • In this paper, we propose a new scheme for the discretization of nonlinear systems using Taylor series expansion and the zero-order hold assumption. This scheme is applied to the sampled-data representation of a non-affine nonlinear system with constant input time-delay. The mathematical expressions of the discretization scheme are presented and the ability of the algorithm is tested for some of the examples. The proposed scheme provides a finite-dimensional representation for nonlinear systems with time-delay enabling existing controller design techniques to be applied to them. For all the case studies, various sampling rates and time-delay values are considered.