• The Transactions of the Korea Information Processing Society
• /
• v.4 no.6
• /
• pp.1541-1549
• /
• 1997

Many classification algorithms require that training examples contain only discrete values. In order to use these algorithms when some attributes have continuous numeric values, the numeric attributes must be converted into discrete ones. This paper describes a new way of discretizing numeric values using information theory. Our method is context-sensitive in the sense that it takes into account the value of the target attribute. The amount of information each interval gives to the target attribute is measured using Hellinger divergence, and the interval boundaries are decided so that each interval contains as equal amount of information as possible. In order to compare our discretization method with some current discretization methods, several popular classification data sets are selected for experiment. We use back propagation algorithm and ID3 as classification tools to compare the accuracy of our discretization method with that of other methods.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.20 no.4
• /
• pp.419-425
• /
• 2014

The current work investigated the variation of numerical solutions according to the grid number, the distance of the first grid point off the ship surface, turbulence modeling and discretization. The subject vessel is KVLCC. A commercial code, Gridgen V15 and FLUENT were used the generation of the ship hull surface and spatial system and flow computation. The first part of examination, the effect of solutions were accessed depending on the grid number, turbulence modeling and discretization. The second part was focus on the suitable selection of the distance of the first grid point off the ship surface: $Y_P+$. When grid number and discretization were fixed the same value, the friction resistance showed differences within 1 % but the pressure resistance showed big differences 9 % depending on the turbulence modeling. When $Y_P+$ were set 30 and 50 for the same discretization, friction resistance showed almost same results within 1 % according to the turbulence modeling. However, when $Y_P+$ were fixed 100, friction resistance showed more differences of 3 % compared to $Y_P+$ of 30 and 50. Whereas pressure resistance showed big differences of 10 % regardless of turbulence modeling. When turbulence modeling and discretization were set the same value, friction, pressure and total resistance showed almost same result within 0.3 % depending on the grid number. Lastly, When turbulence modeling and discretization were fixed the same value, the friction resistance showed differences within 5~8 % but the pressure resistance showed small differences depending on the $Y_P+$.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.05a
• /
• pp.217-220
• /
• 2003

본 논문에서는 특정 매개변수의 입력 없이 속성(attribute)에 따른 목적속성(class)값의 분포를 고려하여 연속형(conti-nuous) 값을 범주형(categorical)의 형태로 변환시키는 새로운 방법을 제안하였다. 각각의 속성에 대해 목적속성의 분포를 1차원 공간에 사상(mapping)하고, 각 목적속성의 밀도, 다른 목적속성과의 중복 정도 등의 기준에 따라 구간을 군집화 한다. 이렇게 생성된 군집들은 각각 목적속성을 예측할 수 있는 확률적 수치에 기반한 것으로, 각 속성이 제공하는 정보의 손실을 최소화하는 이산화 경계선을 갖고 있다. 제안된 데이터 이산화 방법의 향상된 성능은 C4.5 알고리즘과 UCI Machine Learning Data Repository 데이터를 사용하여 확인할 수 있다.

• Journal of Intelligence and Information Systems
• /
• v.16 no.3
• /
• pp.77-97
• /
• 2010

Market timing is an investment strategy which is used for obtaining excessive return from financial market. In general, detection of market timing means determining when to buy and sell to get excess return from trading. In many market timing systems, trading rules have been used as an engine to generate signals for trade. On the other hand, some researchers proposed the rough set analysis as a proper tool for market timing because it does not generate a signal for trade when the pattern of the market is uncertain by using the control function. The data for the rough set analysis should be discretized of numeric value because the rough set only accepts categorical data for analysis. Discretization searches for proper "cuts" for numeric data that determine intervals. All values that lie within each interval are transformed into same value. In general, there are four methods for data discretization in rough set analysis including equal frequency scaling, expert's knowledge-based discretization, minimum entropy scaling, and na$\ddot{i}$ve and Boolean reasoning-based discretization. Equal frequency scaling fixes a number of intervals and examines the histogram of each variable, then determines cuts so that approximately the same number of samples fall into each of the intervals. Expert's knowledge-based discretization determines cuts according to knowledge of domain experts through literature review or interview with experts. Minimum entropy scaling implements the algorithm based on recursively partitioning the value set of each variable so that a local measure of entropy is optimized. Na$\ddot{i}$ve and Booleanreasoning-based discretization searches categorical values by using Na$\ddot{i}$ve scaling the data, then finds the optimized dicretization thresholds through Boolean reasoning. Although the rough set analysis is promising for market timing, there is little research on the impact of the various data discretization methods on performance from trading using the rough set analysis. In this study, we compare stock market timing models using rough set analysis with various data discretization methods. The research data used in this study are the KOSPI 200 from May 1996 to October 1998. KOSPI 200 is the underlying index of the KOSPI 200 futures which is the first derivative instrument in the Korean stock market. The KOSPI 200 is a market value weighted index which consists of 200 stocks selected by criteria on liquidity and their status in corresponding industry including manufacturing, construction, communication, electricity and gas, distribution and services, and financing. The total number of samples is 660 trading days. In addition, this study uses popular technical indicators as independent variables. The experimental results show that the most profitable method for the training sample is the na$\ddot{i}$ve and Boolean reasoning but the expert's knowledge-based discretization is the most profitable method for the validation sample. In addition, the expert's knowledge-based discretization produced robust performance for both of training and validation sample. We also compared rough set analysis and decision tree. This study experimented C4.5 for the comparison purpose. The results show that rough set analysis with expert's knowledge-based discretization produced more profitable rules than C4.5.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.907-910
• /
• 1999

본 논문에서는 고 농도로 불순물이 주입된 영역에서 전자 및 정공 농도를 정교하게 구현하기 위해 Fermi-Dirac 분포함수를 고려한 포아송 방정식의 이산화 방법을 제안하였다. Fermi-Dirac 분포를 근사시키기 위해서 Least-Squares 및 점근선 근사법을 사용하였으며 Galerkin 방법을 근간으로 한 유한 요소법을 이용하여 포아송 방정식을 이산화하였다. 구현한 모델을 검증하기 위해 전력 BJT 시료를 제작하여 자체 개발된 소자 시뮬레이터인 BANDIS를 이용하여 모의 실험을 수행한 결과, 상업용 2차원 소자 시뮬레이터인 MEDICI에 비해 최대 4%이내의 상대 오차를 보였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.1
• /
• pp.1-5
• /
• 2002

A common way to design a digital control system is to design an analog controller first and discretize it for digital implemention. In this paper, optimal digital controller design is studied within the framework of sampled -data control theory. In particular, multirate discretization of analog controller is considered using an Η$_2$optimality criterion. Solutions are obtained via multirate H2 optimization with a causality constraint due to the multirate structure. In design example, the comparison of the proposed methods is made with the conventional discretization methods, and demonstrate the superiority of the multirate design method.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.49 no.2
• /
• pp.17-25
• /
• 2012

A general discretization method for input-driven nonlinear continuous time-delay systems is proposed, which can be applied to general order sampling hold assumptions. It is based on a combination of Taylor series expansion and the theories of sampling and hold. The mathematical structure of the new discretization scheme is introduced in detail. The performance of the proposed discretization procedure is evaluated by two degrees of systems. The results show that the proposed scheme is applicable to control systems.

• Proceedings of the Korean Statistical Society Conference
• /
• 2003.10a
• /
• pp.301-305
• /
• 2003

최근에 R은 여러 분야에서 많이 사용되고 있다. 특히 모의실험(simulation)이나 통계학 관련 연구에 많이 사용되고 있다. 모의실험을 하는 경우에는 많은 반복으로 인해 R 프로그램의 수행 속도가 매우 중요하다. 또한 데이터마이닝 분야에서도 R을 많이 사용하고 있다. 우리는 데이터 마이닝에서 데이터의 전처리 과정 중 Fayyad & Irani 방법을 사용하여 연속형 변수를 이산화하는 실험을 하였으며, 이를 위해 R을 사용하였다. 이 프로그램은 재귀 함수를 이용하고 이런 과정에서 빈도표 작성, information계산, 빈도표의 분할, 정지 규칙 등의 여러 함수를 사용하게 되어있다. 우리가 작성한 R 로드를 사용하여 UCI DB의 Iono 자료를 (속성이 35개, 사례수가 약 1000개정도) 이산화 하였을 때 7초 이상의 상당한 시간이 소요된다. 반면에 JAVA로 만들어진 Weka에서 똑같은 Fayyad & Irani 방법을 수행했을 때 위와 같은 큰 자료를 이산화하는 속도가 매우 빨라 수행시간은 거의 무시할 만하였다. 이런 차이점을 보고 R 프로그램의 수행 속도를 늘이는 방법을 찾게 되었다. 이 본 발표에서는 R 코드 중 시간이 많이 소요되는 것들을 몇 가지 선정하고 이들을 더 효율적으로 만들 수 있는 코드를 작성하여 이들 코드의 수행속도를 비교하였다. 또한 몇 가지 명령에 대해서는SAS와도 비교하였다.

• The Journal of the Korea Contents Association
• /
• v.10 no.9
• /
• pp.97-106
• /
• 2010

Various time series representation methods have been suggested in order to process time series data efficiently and effectively. SAX is the representative time series representation method combining segmentation and discretization techniques, which has been successfully applied to the time series classification task. But SAX requires a large number of segments in order to represent the meaningful dynamic patterns of time series accurately, since it loss the dynamic property of time series in the course of smoothing the movement of time series. Therefore, this paper suggests a new time series representation method that combines PIPs detection and Persist discretization techniques. The suggested method represents the dynamic movement of high-diemensional time series in a lower dimensional space by detecting PIPs indicating the important inflection points of time series. And it determines the optimal discretizaton ranges by applying self-transition and marginal probabilities distributions to KL divergence measure. It minimizes the information loss in process of the dimensionality reduction. The suggested method enhances the performance of time series classification task by minimizing the information loss in the course of dimensionality reduction.

• Proceedings of the IEEK Conference
• /
• 2001.06b
• /
• pp.157-160
• /
• 2001

소자 내부의 전위와 전자 및 정공 의사 페르미 준위에 따른 반송자의 정확한 농도를 얻기 위해 Fermi-Dirac통계를 구현하는 방법을 제시하였다. 또한 Fermi-Dirac통계를 고려하여 반도체 방정식을 이산화하는 방법을 제안한다. 제안된 방법을 검증하기 위해 전력 바이폴라 접합 트랜지스터를 제작하였으며 모의 실험 결과 컬렉터-에미터 전압 대 컬렉터 전류는 현재 업계에서 상용화된 소자의 실측치와 비교하여 최대 15%이내의 상대오차를 보였다.