• Title/Summary/Keyword: 이산형변수

Search Result 72, Processing Time 0.02 seconds

Discretization Method for Continuous Data using Wasserstein Distance (Wasserstein 거리를 이용한 연속형 변수 이산화 기법)

  • Ha, Sang-won;Kim, Han-joon
    • Database Research
    • /
    • v.34 no.3
    • /
    • pp.159-169
    • /
    • 2018
  • Discretization of continuous variables intended to improve the performance of various algorithms such as data mining by transforming quantitative variables into qualitative variables. If we use appropriate discretization techniques for data, we can expect not only better performance of classification algorithms, but also accurate and concise interpretation of results and speed improvements. Various discretization techniques have been studied up to now, and however there is still demand of research on discretization studies. In this paper, we propose a new discretization technique to set the cut-point using Wasserstein distance with considering the distribution of continuous variable values with classes of data. We show the superiority of the proposed method through the performance comparison between the proposed method and the existing proven methods.

Group Sequential Tests Using both Type I and Type II Error Spending Rate Functions on Binomial Response (이산형 반응변수에서 오류 분배율 함수를 적용한 집단축차 검정)

  • Kim, Dong-Uk;Nam, Jin-Hyun
    • Communications for Statistical Applications and Methods
    • /
    • v.17 no.1
    • /
    • pp.127-140
    • /
    • 2010
  • In interim analysis, group sequential tests are widely used for the ethical, scientific, and economic reasons. In this paper, we propose the group sequential tests using both type I and type II error spending rate functions when the response variable is discrete, especially binomial distribution, in the interim analysis. In addition, we propose new error spending rate function which covers the formerly proposed. Our method has good property that is flexible, fast and easily applicable. A numerical simulations are carried out to evaluate our method and it shows good performance.

A Comparative Study on Discretization Algorithms for Data Mining (데이터 마이닝을 위한 이산화 알고리즘에 대한 비교 연구)

  • Choi, Byong-Su;Kim, Hyun-Ji;Cha, Woon-Ock
    • Communications for Statistical Applications and Methods
    • /
    • v.18 no.1
    • /
    • pp.89-102
    • /
    • 2011
  • The discretization process that converts continuous attributes into discrete ones is a preprocessing step in data mining such as classification. Some classification algorithms can handle only discrete attributes. The purpose of discretization is to obtain discretized data without losing the information for the original data and to obtain a high predictive accuracy when discretized data are used in classification. Many discretization algorithms have been developed. This paper presents the results of our comparative study on recently proposed representative discretization algorithms from the view point of splitting versus merging and supervised versus unsupervised. We implemented R codes for discretization algorithms and made them available for public users.

A Generalized Likelihood Ratio Test in Outlier Detection (이상점 탐지를 위한 일반화 우도비 검정)

  • Jang Sun Baek
    • The Korean Journal of Applied Statistics
    • /
    • v.7 no.2
    • /
    • pp.225-237
    • /
    • 1994
  • A generalized likelihood ratio test is developed to detect an outlier associated with monitoring nuclear proliferation. While the classical outlier detection methods consider continuous variables only, our approach allows both continuous and discrete variables or a mixture of continuous and discrete variables to be used. In addition, our method is free of the normality assumption, which is the key assumption in most of the classical methods. The proposed test is constructed by applying the bootstrap to a generalized likelihood ratio. We investigate the performance of the test by studying the power with simulations.

  • PDF

Analysis of Detecting Effectiveness of a Homing Torpedo using Combined Discrete Event & Discrete Time Simulation Model Architecture (이산 사건/이산 시간 혼합형 시뮬레이션 모델 구조를 사용한 유도 어뢰의 탐지 효과도 분석)

  • Ha, Sol;Cha, Ju-Hwan;Lee, Kyu-Yeul
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.2
    • /
    • pp.17-28
    • /
    • 2010
  • Since a homing torpedo system consists of various subsystems, organic interactions of which dictate the performance of the torpedo system, it is necessary to estimate the effects of individual subsystems in order to obtain an optimized design of the overall system. This paper attempts to gain some insight into the detection mechanism of a torpedo run, and analyze the relative importance of various parameters of a torpedo system. A database for the analysis was generated using a simulation model based on the combined discrete event and discrete time architecture. Multiple search schemes, including the snake-search method, were applied to the torpedo model, and some parameters of the torpedo were found to be stochastic. We then analyzed the effectiveness of torpedo’s detection capability according to the torpedo speed, the target speed, and the maximum detection range.

Dynamic Graphics Using Line Mosaic Plot (선 모자이크 도표를 이용한 동적 그래픽스)

  • Cha, Woon-Ock;Lee, Kyung-Mi;Choi, Byong-Su
    • Communications for Statistical Applications and Methods
    • /
    • v.17 no.2
    • /
    • pp.153-164
    • /
    • 2010
  • This study is about the dynamic graphics which can be used for the exploration of the characteristics of data comprising discrete and continuous variables. Simultaneously using line mosaic plot for the relation of discrete variables and box plot together with scatter plot for the relation of continuous variables, we have applied dynamic methods among these plots to demonstrate that the structure and characteristics of the multivariate data could be easily analyzed.

Discrete Optimization of Unsymmetric Composite Laminates Using Linear Aproximation Method (선형 근사화방법을 이용한 비대칭 복합 적층평판의 이산최적화)

  • 이상근;구봉근;한상훈
    • Computational Structural Engineering
    • /
    • v.10 no.2
    • /
    • pp.255-263
    • /
    • 1997
  • The optimum design of most structural systems used in practice requires considering design variables as discrete quantities. The present paper shows that the linear approximation method is very effective as a tool for the discrete optimum designs of unsymmetric composite laminates. The formulated design problem is subjected to a multiple in-plane loading condition due to shear and axial forces, bending and twisting moments, which is controlled by maximum strain criterion for each of the plys of a composite laminate. As an initial approach, the process of continuous variable optimization by FDM is required only once in operating discrete optimization. The nonlinear discrete optimization problem that has the discrete and continuous variables is transformed into the mixed integer programming problem by SLDP. In numerical examples, the discrete optimum solutions for the unsymmetric composite laminates consisted of six plys according to rotated stacking sequence were found, and then compared the results with the nonlinear branch and bound method to verify the efficiency of present method.

  • PDF

Multi-Level Optimization for Steel Frames using Discrete Variables (이산형 변수를 이용한 뼈대구조물의 다단계 최적설계)

  • 조효남;민대홍;박준용
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.15 no.3
    • /
    • pp.453-462
    • /
    • 2002
  • Discrete-sizing or standardized steel profiles are used in steel design and construction practice. However, most of numerical optimization methods follow additional step(round-up discrete-sizing routine) to use the standardized steel section profiles, and accordingly the optimality of the resulting design nay be doubtful. Thus, in this paper, an efficient multi-level optimization algorithm is proposed to improve the shortcoming of the conventional optimization methods using the round-up discrete-sizing routine. Also, multi-level optimization technique with a decomposition method that separates both system-level and element-level is incorporated in the algorithm to enhance the performance of the proposed algorithms. The proposed algorithm is expected to achieve considerable improvement on both the efficiency of the numerical process and the accuracy of the global optimum.