• Title/Summary/Keyword: Random selection

Search Result 641, Processing Time 0.024 seconds

Bayesian Pattern Mixture Model for Longitudinal Binary Data with Nonignorable Missingness

  • Kyoung, Yujung;Lee, Keunbaik
    • Communications for Statistical Applications and Methods
    • /
    • v.22 no.6
    • /
    • pp.589-598
    • /
    • 2015
  • In longitudinal studies missing data are common and require a complicated analysis. There are two popular modeling frameworks, pattern mixture model (PMM) and selection models (SM) to analyze the missing data. We focus on the PMM and we also propose Bayesian pattern mixture models using generalized linear mixed models (GLMMs) for longitudinal binary data. Sensitivity analysis is used under the missing not at random assumption.

THE APPLICATION OF STOCHASTIC DIFFERENTIAL EQUATIONS TO POPULATION GENETIC MODEL

  • Choi, Won;Choi, Dug-Hwan
    • Bulletin of the Korean Mathematical Society
    • /
    • v.40 no.4
    • /
    • pp.677-683
    • /
    • 2003
  • In multi-allelic model $X\;=\;(x_1,\;x_2,\;\cdots\;,\;x_d),\;M_f(t)\;=\;f(p(t))\;-\;{\int_0}^t\;Lf(p(t))ds$ is a P-martingale for diffusion operator L under the certain conditions. In this note, we examine the stochastic differential equation for model X and find the properties using stochastic differential equation.

An Evolutionary Algorithm preventing Consanguineous Marriage

  • Woojin Oh;Oh, Se-Young
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.110.2-110
    • /
    • 2002
  • Evolutionary Algorithm is the general method that can search the optimum value for the various problems. Evolutionary method consists of random selection, crossover, mutation, etc. Since the next generation is selected based on the fitness values, the crossover between chromosomes does not have any restrictions. Not only normal marriage but also consanguineous marriage will take place. In human world, consanguineous marriage was reported to cause various genetic defects, such as poor immunity about new diseases and new environment disaster, These problems translate into searching for the local optimum, not the global optimum. So, a new evolutionary algorithm is needed that prevents traps to...

  • PDF

Robust Optimal Positioning of Strain Gauges on Blades (Strain Gauge의 Blade내 설치위치 최적화)

  • Park, Byeong-Keun;Yang, Bo-Suk;Marc P. Mignolet
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2002.11a
    • /
    • pp.345.2-345
    • /
    • 2002
  • This paper focuses on the formulation and validation of an automatic strategy for the selection of the locations and directions of strain gauges to capture at best the modal response of a blade in a series of modes. These locations and directions are selected to render the strain measurements as robust as possible with respect to random mispositioning of the gauges and gauge failures. (omitted)

  • PDF

ON THE RATIO X/(X + Y) FOR WEIBULL AND LEVY DISTRIBUTIONS

  • ALI M. MASOOM;NADARAJAH SARALEES;WOO JUNGSOO
    • Journal of the Korean Statistical Society
    • /
    • v.34 no.1
    • /
    • pp.11-20
    • /
    • 2005
  • The distributional properties of R = X/(X + Y) and related estimation procedures are derived when X and Y are independent and identically distributed according to the Weibull or Levy distribution. The work is of interest in biological and physical sciences, econometrics, engineering and ranking and selection.

A Comparison of Design-based and Model-based Inference in Survey Sampling (표본추출이론에서 설계기반 추론과 모형기반 추론의 비교)

  • 홍기학;이기성;손창균
    • Proceedings of the Korean Association for Survey Research Conference
    • /
    • 2002.06a
    • /
    • pp.74-84
    • /
    • 2002
  • 본 연구에서는 1970년 Royall에 의해 표본추출방법의 한 대안으로서 다시 주목받기 시작한 균형추출방법(purposive selection or balanced sampling)과 확률추출방법(random sampling)의 장.단점을 층화추출법과 비추정량의 경우를 예로 들어 비교하고자 한다. 균형추출방법은 강건성(robustness)과 효율성(efficiency) 측면에서 확률추출방법은 추출의 간편성과 사회적 인식 측면에서 각각의 장점을 지니고 있는 것으로 볼 수 있다.

  • PDF

Compiler Analysis Framework Using SVM-Based Genetic Algorithm : Feature and Model Selection Sensitivity (SVM 기반 유전 알고리즘을 이용한 컴파일러 분석 프레임워크 : 특징 및 모델 선택 민감성)

  • Hwang, Cheol-Hun;Shin, Gun-Yoon;Kim, Dong-Wook;Han, Myung-Mook
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.30 no.4
    • /
    • pp.537-544
    • /
    • 2020
  • Advances in detection techniques, such as mutation and obfuscation, are being advanced with the development of malware technology. In the malware detection technology, unknown malware detection technology is important, and a method for Malware Authorship Attribution that detects an unknown malicious code by identifying the author through distributed malware is being studied. In this paper, we try to extract the compiler information affecting the binary-based author identification method and to investigate the sensitivity of feature selection, probability and non-probability models, and optimization to classification efficiency between studies. In the experiment, the feature selection method through information gain and the support vector machine, which is a non-probability model, showed high efficiency. Among the optimization studies, high classification accuracy was obtained through feature selection and model optimization through the proposed framework, and resulted in 48% feature reduction and 53 faster execution speed. Through this study, we can confirm the sensitivity of feature selection, model, and optimization methods to classification efficiency.

Machine Learning Perspective Gene Optimization for Efficient Induction Machine Design

  • Selvam, Ponmurugan Panneer;Narayanan, Rengarajan
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.3
    • /
    • pp.1202-1211
    • /
    • 2018
  • In this paper, induction machine operation efficiency and torque is improved using Machine Learning based Gene Optimization (ML-GO) Technique is introduced. Optimized Genetic Algorithm (OGA) is used to select the optimal induction machine data. In OGA, selection, crossover and mutation process is carried out to find the optimal electrical machine data for induction machine design. Initially, many number of induction machine data are given as input for OGA. Then, fitness value is calculated for all induction machine data to find whether the criterion is satisfied or not through fitness function (i.e., objective function such as starting to full load torque ratio, rotor current, power factor and maximum flux density of stator and rotor teeth). When the criterion is not satisfied, annealed selection approach in OGA is used to move the selection criteria from exploration to exploitation to attain the optimal solution (i.e., efficient machine data). After the selection process, two point crossovers is carried out to select two crossover points within a chromosomes (i.e., design variables) and then swaps two parent's chromosomes for producing two new offspring. Finally, Adaptive Levy Mutation is used in OGA to select any value in random manner and gets mutated to obtain the optimal value. This process gets iterated till finding the optimal value for induction machine design. Experimental evaluation of ML-GO technique is carried out with performance metrics such as torque, rotor current, induction machine operation efficiency and rotor power factor compared to the state-of-the-art works.

Effect of Probability Distribution of Coefficient of Consolidation on Probabilistic Analysis of Consolidation in Heterogeneous Soil (비균질 지반에서 압밀계수의 확률분포가 압밀의 확률론적 해석에 미치는 영향)

  • Bong, Tae-Ho;Heo, Joon;Son, Young-Hwan
    • Journal of The Korean Society of Agricultural Engineers
    • /
    • v.60 no.3
    • /
    • pp.63-70
    • /
    • 2018
  • In this study, a simple probabilistic approach using equivalent coefficient of consolidation ($c_e$) was proposed to consider the spatial variability of coefficient of vertical consolidation ($c_v$), and the effect of the probability distribution of coefficient of consolidation on degree of consolidation in heterogeneous soil was investigated. The statistical characteristics of consolidation coefficient were estimated from 1,226 field data, and four probability distributions (Normal, Log-normal, Gamma, and Weibull) were applied to consider the effect of probability distribution. The random fields of coefficient of consolidation were generated based on Karhunen-Loeve expansion. Then, the equivalent coefficient of consolidation was calculated from the random field and used as the input value of consolidation analysis. As a result, the probabilistic analysis can be performed effectively by separating random field and numerical analysis, and probabilistic analysis was performed using a Latin hypercube Monte Carlo simulation. The results showed that the statistical properties of $c_e$ were changed by the probability distribution and spatial variability of $c_v$, and the probability distribution of $c_v$ has considerable effects on the probabilistic results. There was a large difference of failure probability depend on the probability distribution when the autocorrelation distance was small (i.e., highly heterogeneous soil). Therefore, the selection of a suitable probability distribution of $c_v$ is very important for reliable probabilistic analysis of consolidation.

IP Address Auto-configuration for Mobile Ad Hoc Networks (이동 애드 혹 네트워크를 위한 인터넷 프로토콜 주소 자동 설정 기법)

  • Choi, Nak-Jung;Joung, Uh-Jin;Kim, Dong-Kyun;Choi, Yang-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.3A
    • /
    • pp.297-309
    • /
    • 2007
  • We introduce two distributed IP address auto-configuration mechanisms for mobile ad hoc networks. RADA (Random ADdress Allocation) is based on random IP address selection, while LiA (Linear Address Allocation) assigns new addresses sequentially, using the current maximum IP address. An improved version of LiA, hewn as LiACR (Linear Address Allocation with Collision Resolution) further reduces the control overhead. Simulation results show that, when many nodes join a network during a short period, RADA assigns addresses more quickly than LiA and LiACR. However, RADA uses the address space less efficiently, due to its random allocation of IP addresses. Hence, RADA is particularly useful in battlefield scenarios or rescue operations where fast setup is needed, while LiA and LiACR are more suitable for ad hoc networks that are moderate, confined and subject to some form of governance control, such as that orchestrated by a wireless service provider.