• 제목/요약/키워드: Discretization Algorithm

검색결과 124건 처리시간 0.024초

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

  • 백준걸;김창욱;김성식
    • 대한산업공학회지
    • /
    • 제27권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

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

  • 강성우;유정열;이윤표;최형권
    • 대한기계학회논문집B
    • /
    • 제29권6호
    • /
    • 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.

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

  • 최형조;박지향;이수영;정길도
    • 제어로봇시스템학회논문지
    • /
    • 제11권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년도 ICCAS
    • /
    • 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)

  • 윤태영;김지원;조윤호
    • 한국도로학회논문집
    • /
    • 제5권4호
    • /
    • pp.1-11
    • /
    • 2003
  • 최근 국내에서는 국내 여건을 고려한 설계법을 개발함과 동시에 이미 공용중에 있는 도로 포장의 성능향상을 위한 $\ulcorner$한국형 포장 설계법 개발과 성능개선 연구$\lrcorner$가 진행되고 있다. 본 연구에서 개발된 $\ulcorner$하중변환 알고리듬을 적용한 줄눈콘크리트 포장 해석 프로그램$\lrcorner$은 이러한 연구의 세부분야인 콘크리트 포장 설계법 개발분야의 연구 결과로서 기본 프로그램 부분과 하중변환 부분으로 구분되어 구성되며, 기본 프로그램 부분에서는 판/쉘 요소, 스프링 요소 보 요소를 이용하여 줄눈 콘크리트 포장의 콘크리트 슬래브, 하부층, 다웰바를 모사한다. 하중변환 부분에서는 기존의 연속체 요소에 대한 하중변환 알고리듬을 수정/적용하여 요소망에 제약을 받지 않고 다양한 하중 조건을 해석한다. 또한 프로그램은 하중변환 알고리듬을 적용하여 해석을 수행하는 등분포 하중 이외에, 집중하중. 온도하중, 자중 등을 고려할 수 있는 특징이 있다. 개발된 프로그램의 특성을 분석하기 위한 민감도 분석 결과 하중크기 및 위치와 콘크리트 슬래브의 두께가 포장의 거동에 가장 큰 영향을 미치는 인자로 분석되었으며 이는 Westergaard 계산식, ILLISLAB과 유사한 결과이다.

  • PDF

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

  • Ge, Ren-Dong;Xia, Zun-Quan
    • Journal of applied mathematics & informatics
    • /
    • 제9권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
    • /
    • 제16권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
    • /
    • 제20권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.

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

  • 이광호
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제52권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
    • /
    • 제18권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.