• Title/Summary/Keyword: Bayesian Dynamic Model

Search Result 94, Processing Time 0.031 seconds

Intervention analysis for spread of COVID-19 in South Korea using SIR model (SIR 모형을 이용한 한국의 코로나19 확산에 대한 개입 효과 분석)

  • Cho, Sumin;Kim, Jaejik
    • The Korean Journal of Applied Statistics
    • /
    • v.34 no.3
    • /
    • pp.477-489
    • /
    • 2021
  • COVID-19 has spread seriously around the world in 2020 and it is still significantly affecting our whole daily life. Currently, the whole world is still undergoing the pandemic and South Korea is no exception to it. During the pandemic, South Korea had several events that prevented or accelerated its spread. To establish the prevention policies for infectious diseases, it is very important to evaluate the intervention effect of such events. The susceptible-infected-removed (SIR) model is often used to describe the dynamic behavior of the spread of infectious diseases through ordinary differential equations. However, the SIR model is a deterministic model without considering the uncertainty of observed data. To consider the uncertainty in the SIR model, the Bayesian approach can be employed, and this approach allows us to evaluate the intervention effects by time-varying functions of the infection rate in the SIR model. In this study, we describe the time trend of the spread of COVID-19 in South Korea and investigate the intervention effects for the events using the stochastic SIR model based on the Bayesian approach.

Object Relationship Modeling based on Bayesian Network Integration for Improving Object Detection Performance of Service Robots (서비스 로봇의 물체 탐색 성능 향상을 위한 베이지안 네트워크 결합 기반 물체 관계 모델링)

  • Song Youn-Suk;Cho Sung-Bae
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.7
    • /
    • pp.817-822
    • /
    • 2005
  • Recently tile study that exploits visual information for tile services of robot in indoor environments is active. Conventional image processing approaches are based on the pre-defined geometric models, so their performances are likely to decrease when they are applied to the uncertain and dynamic environments. For this, diverse researches to manage the uncertainty based on the knowledge for improving image recognition performance have been doing. In this paper we propose a Bayesian network modeling method for predicting the existence of target objects when they are occluded by other ones for improving the object detection performance of the service robots. The proposed method makes object relationship, so that it allows to predict the target object through observed ones. For this, we define the design method for small size Bayesian networks (primitive Bayesian netqork), and allow to integrate them following to the situations. The experiments are performed for verifying the performance of constructed model, and they shows $82.8\%$ of accuracy in 5 places.

A Constrained Learning Method based on Ontology of Bayesian Networks for Effective Recognition of Uncertain Scenes (불확실한 장면의 효과적인 인식을 위한 베이지안 네트워크의 온톨로지 기반 제한 학습방법)

  • Hwang, Keum-Sung;Cho, Sung-Bae
    • Journal of KIISE:Software and Applications
    • /
    • v.34 no.6
    • /
    • pp.549-561
    • /
    • 2007
  • Vision-based scene understanding is to infer and interpret the context of a scene based on the evidences by analyzing the images. A probabilistic approach using Bayesian networks is actively researched, which is favorable for modeling and inferencing cause-and-effects. However, it is difficult to gather meaningful evidences sufficiently and design the model by human because the real situations are dynamic and uncertain. In this paper, we propose a learning method of Bayesian network that reduces the computational complexity and enhances the accuracy by searching an efficient BN structure in spite of insufficient evidences and training data. This method represents the domain knowledge as ontology and builds an efficient hierarchical BN structure under constraint rules that come from the ontology. To evaluate the proposed method, we have collected 90 images in nine types of circumstances. The result of experiments indicates that the proposed method shows good performance in the uncertain environment in spite of few evidences and it takes less time to learn.

Evolutionary Algorithms with Distribution Estimation by Variational Bayesian Mixtures of Factor Analyzers (변분 베이지안 혼합 인자 분석에 의한 분포 추정을 이용하는 진화 알고리즘)

  • Cho Dong-Yeon;Zhang Byoung-Tak
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.11
    • /
    • pp.1071-1083
    • /
    • 2005
  • By estimating probability distributions of the good solutions in the current population, some researchers try to find the optimal solution more efficiently. Particularly, finite mixtures of distributions have a very useful role in dealing with complex problems. However, it is difficult to choose the number of components in the mixture models and merge superior partial solutions represented by each component. In this paper, we propose a new continuous evolutionary optimization algorithm with distribution estimation by variational Bayesian mixtures of factor analyzers. This technique can estimate the number of mixtures automatically and combine good sub-solutions by sampling new individuals with the latent variables. In a comparison with two probabilistic model-based evolutionary algorithms, the proposed scheme achieves superior performance on the traditional benchmark function optimization. We also successfully estimate the parameters of S-system for the dynamic modeling of biochemical networks.

Dynamic Bayesian Network Modeling and Reasoning Based on Ontology for Occluded Object Recognition of Service Robot (서비스 로봇의 가려진 물체 인식을 위한 온톨로지 기반 동적 베이지안 네트워크 모델링 및 추론)

  • Song, Youn-Suk;Cho, Sung-Bae
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.13 no.2
    • /
    • pp.100-109
    • /
    • 2007
  • Object recognition of service robots is very important for most of services such as delivery, and errand. Conventional methods are based on the geometric models in static industrial environments, but they have limitations in indoor environments where the condition is changable and the movement of service robots occur because the interesting object can be occluded or small in the image according to their location. For solving these uncertain situations, in this paper, we propose the method that exploits observed objects as context information for predicting interesting one. For this, we propose the method for modeling domain knowledge in probabilistic frame by adopting Bayesian networks and ontology together, and creating knowledge model dynamically to extend reasoning models. We verify the performance of our method through the experiments and show the merit of inductive reasoning in the probabilistic model

Generating high resolution of daily mean temperature using statistical models (통계적모형을 통한 고해상도 일별 평균기온 산정)

  • Yoon, Sanghoo
    • Journal of the Korean Data and Information Science Society
    • /
    • v.27 no.5
    • /
    • pp.1215-1224
    • /
    • 2016
  • Climate information of the high resolution grid units is an important factor to explain the phenomenon in a variety of research field. Statistical linear interpolation models are computationally inexpensive and applicable to any climate data compared to the dynamic simulation method at regional scales. In this paper, we considered four different linear-based statistical interpolation models: general linear model, generalized additive model, spatial linear regression model, and Bayesian spatial linear regression model. The climate variable of interest was the daily mean temperature, where the spatial variability was explained using geographic terrain information: latitude, longitude, elevation. The data were collected by weather stations in January from 2003 and 2012. In the sense of RMSE and correlation coefficient, Bayesian spatial linear regression model showed better performance in reflecting the spatial pattern compared to the other models.

SOCMTD: Selecting Optimal Countermeasure for Moving Target Defense Using Dynamic Game

  • Hu, Hao;Liu, Jing;Tan, Jinglei;Liu, Jiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.10
    • /
    • pp.4157-4175
    • /
    • 2020
  • Moving target defense, as a 'game-changing' security technique for network warfare, realizes proactive defense by increasing network dynamics, uncertainty and redundancy. How to select the best countermeasure from the candidate countermeasures to maximize defense payoff becomes one of the core issues. In order to improve the dynamic analysis for existing decision-making, a novel approach of selecting the optimal countermeasure using game theory is proposed. Based on the signal game theory, a multi-stage adversary model for dynamic defense is established. Afterwards, the payoffs of candidate attack-defense strategies are quantified from the viewpoint of attack surface transfer. Then the perfect Bayesian equilibrium is calculated. The inference of attacker type is presented through signal reception and recognition. Finally the countermeasure for selecting optimal defense strategy is designed on the tradeoff between defense cost and benefit for dynamic network. A case study of attack-defense confrontation in small-scale LAN shows that the proposed approach is correct and efficient.

Multiprocess Discount Survival Models With Survival Times

  • Shim, Joo-Yong
    • Journal of the Korean Statistical Society
    • /
    • v.26 no.2
    • /
    • pp.277-288
    • /
    • 1997
  • For the analysis of survival data including covariates whose effects vary in time, the multiprocess discount survival model is proposed. The parameter vector modeling the time-varying effects of covariates is to vary between time intervals and its evolution between time intervals depends on the perturbation of the next time interval. The recursive estimation of the parameter vector can be obtained at the end of each time interval. The retrospective estimation of the survival function and the forecasting of the survival function of individuals of the specific covariates also can be obtained based on the information gathered until the end of the time interval.

  • PDF

Neural Network-Based Prediction of Dynamic Properties (인공신경망을 활용한 동적 물성치 산정 연구)

  • Min, Dae-Hong;Kim, YoungSeok;Kim, Sewon;Choi, Hyun-Jun;Yoon, Hyung-Koo
    • Journal of the Korean Geotechnical Society
    • /
    • v.39 no.12
    • /
    • pp.37-46
    • /
    • 2023
  • Dynamic soil properties are essential factors for predicting the detailed behavior of the ground. However, there are limitations to gathering soil samples and performing additional experiments. In this study, we used an artificial neural network (ANN) to predict dynamic soil properties based on static soil properties. The selected static soil properties were soil cohesion, internal friction angle, porosity, specific gravity, and uniaxial compressive strength, whereas the compressional and shear wave velocities were determined for the dynamic soil properties. The Levenberg-Marquardt and Bayesian regularization methods were used to enhance the reliability of the ANN results, and the reliability associated with each optimization method was compared. The accuracy of the ANN model was represented by the coefficient of determination, which was greater than 0.9 in the training and testing phases, indicating that the proposed ANN model exhibits high reliability. Further, the reliability of the output values was verified with new input data, and the results showed high accuracy.

Determining on Model-based Clusters of Time Series Data (시계열데이터의 모델기반 클러스터 결정)

  • Jeon, Jin-Ho;Lee, Gye-Sung
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.6
    • /
    • pp.22-30
    • /
    • 2007
  • Most real word systems such as world economy, stock market, and medical applications, contain a series of dynamic and complex phenomena. One of common methods to understand these systems is to build a model and analyze the behavior of the system. In this paper, we investigated methods for best clustering over time series data. As a first step for clustering, BIC (Bayesian Information Criterion) approximation is used to determine the number of clusters. A search technique to improve clustering efficiency is also suggested by analyzing the relationship between data size and BIC values. For clustering, two methods, model-based and similarity based methods, are analyzed and compared. A number of experiments have been performed to check its validity using real data(stock price). BIC approximation measure has been confirmed that it suggests best number of clusters through experiments provided that the number of data is relatively large. It is also confirmed that the model-based clustering produces more reliable clustering than similarity based ones.