• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2007년도 한국컴퓨터종합학술대회논문집 Vol.34 No.1 (C)
• /
• pp.263-266
• /
• 2007

본 논문은 베이지안 통계 추론에 대하여 논의한다. 논문은 베이지안 추론, Markov Chain과 Monte Carlo 적분, MCMC(Markov Chain Monte Carlo) 기법, Metropolis-Hastings 알고리즘, Gibbs 샘플링, Maximum Likelihood Estimation, EM 알고리즘, 상실된 데이터 보완 기법, BMA(Bayesian Model Averaging) 순서로 논의를 진행한다. 이러한 통계적 기법들은 대용량의 데이터를 처리하는 생물학, 의학, 생명 공학, 과학과 공학, 그리고 일반 데이터 조사와 처리 등에 사용되고 있으며, 최적의 추론 결과를 이끌어 내는데 중요한 방법을 제공하고 있다. 그리고 마지막으로 PC(Principal Component) 분석 기법에 대하여 논의한다. PC 분석 기법도 데이터 분석과 연구에 많이 활용된다.

• 한국정보과학회논문지:데이타베이스
• /
• 제37권6호
• /
• pp.285-291
• /
• 2010

본 연구에서는 나이브 베이시안 학습의 환경에서 속성의 가중치를 계산하는 새로운 방식을 제안한다. 기존 방법들이 속성에 가중치를 부여하는 방식인데 반하여 본 연구에서는 한걸음 더 나아가 속성의 값에 가중치를 부여하는 새로운 방식을 연구하였다. 이러한 속성값의 가중치를 계산하기 위하여 Kullback-Leibler 함수를 이용하여 가중치를 계산하는 방식을 제안하였고 이러한 가중치들의 특성을 분석하였다. 제안된 알고리즘은 다수의 데이터를 이용하여 속성 가중치 방식과 비교하였고 대부분의 경우에 더 좋은 성능을 제공함을 알 수 있었다.

• International Journal of Internet, Broadcasting and Communication
• /
• 제13권1호
• /
• pp.238-242
• /
• 2021

Game theory has been regarded as a useful theoretical tool for modeling the interactions between distinct entities and thus it has been harnessed in various research field. In particular, research attention has been shown to how to apply game theory to modeling the interactions between malign and benign entities in the field of wireless networks. Although various game theoretic modeling work have been proposed in the field of wireless networks, our proposed work is disparate to the existing work in the sense that we focus on mobile malign node detection problem in static wireless sensor networks. More specifically, we propose a Bayesian game theoretic modeling for mobile malign node detection problem in static wireless sensor networks. In our modeling, we formulate a two-player static Bayesian game with imperfect information such that player 1 is aware of the type of player 2, but player 2 is not aware of the type of player 1. We use four strategies in our static Bayesian game. We obtain Bayesian Nash Equilibria with pure strategies under certain conditions.

• Journal of Information Processing Systems
• /
• 제12권3호
• /
• pp.381-391
• /
• 2016

The Joint Bayesian (JB) method has been used in most state-of-the-art methods for face verification. However, since the publication of the original JB method in 2012, no improved verification method has been proposed. A lot of studies on face verification have been focused on extracting good features to improve the performance in the challenging Labeled Faces in the Wild (LFW) database. In this paper, we propose an improved version of the JB method, called the two-dimensional Joint Bayesian (2D-JB) method. It is very simple but effective in both the training and test phases. We separated two symmetric terms from the three terms of the JB log likelihood ratio function. Using the two terms as a two-dimensional vector, we learned a decision line to classify same and not-same cases. Our experimental results show that the proposed 2D-JB method significantly outperforms the original JB method by more than 1% in the LFW database.

• Journal of the Korean Data and Information Science Society
• /
• 제13권1호
• /
• pp.139-145
• /
• 2002

This paper deals with the problem of obtaining the Bayesian predictive density function and the prediction intervals for a future observation and the p-th order statistics of n future observations for the exponential model under the censored sampling with incomplete information.

• 인지과학
• /
• 제20권4호
• /
• pp.535-554
• /
• 2009

모바일 장비에서 수집되는 정보는 개인의 기억을 보조하기 위한 수단으로 활용될 수 있지만, 그 양이 너무 많아 사용자가 효과적으로 검색하기에는 어려움이 있다. 데이터를 사람의 기억과 유사한 에피소드 방식으로 저장하기 위해 중요 이벤트인 랜드마크를 탐지하는 것이 필요하다. 본 논문에서는 사용자에게 새로운 서비스를 제공하기 위해서 다양한 컨텍스트 로그 정보로부터 자동으로 랜드마크를 찾아내는 속성별 베이지안 랜드마크 예측 모델을 제안한다. 랜드마크 예측 정확도를 높이기 위해 요일별, 주간별로 데이터를 나누고 다시 수집된 경로에 따른 속성으로 분류하여 학습을 통해 베이지안 네트워크를 생성하였다. 노키아의 로그데이터로 실험한 결과, 베이지안 네트워크를 사용한 방법이 SVM을 사용한 방법보다 예측성능이 높았으며, 주간별 및 요일별로 설계한 베이지안 네트워크에 비해 제안한 방법인 속성별 베이지안 네트워크의 성능이 가장 우수하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권2호
• /
• pp.583-599
• /
• 2015

We apply the Bayesian matching pursuit (BMP) algorithm to the estimation of time-frequency selective channels in orthogonal frequency division multiplexing (OFDM) systems. By exploiting prior statistics and sparse characteristics of propagation channels, the Bayesian method provides a more accurate and efficient detection of the channel status information (CSI) than do conventional sparse channel estimation methods that are based on compressive sensing (CS) technologies. Using a reasonable approximation of the system model and a skillfully designed pilot arrangement, the proposed estimation scheme is able to address the Doppler-induced inter-carrier interference (ICI) with a relatively low complexity. Moreover, to further reduce the computational cost of the channel estimation, we make some modifications to the BMP algorithm. The modified algorithm can make good use of the group-sparse structure of doubly selective channels and thus reconstruct the CSI more efficiently than does the original BMP algorithm, which treats the sparse signals in the conventional manner and ignores the specific structure of their sparsity patterns. Numerical results demonstrate that the proposed Bayesian estimation has a good performance over rapidly time-varying channels.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권9호
• /
• pp.4684-4705
• /
• 2019

Collaborative filtering recommender systems are vulnerable to shilling attacks in which malicious users may inject biased profiles to promote or demote a particular item being recommended. To tackle this problem, many robust collaborative recommendation methods have been presented. Unfortunately, the robustness of most methods is improved at the expense of prediction accuracy. In this paper, we construct a robust Bayesian probabilistic matrix factorization model for collaborative filtering recommender systems by incorporating the detection of user anomaly rating behaviors. We first detect the anomaly rating behaviors of users by the modified K-means algorithm and target item identification method to generate an indicator matrix of attack users. Then we incorporate the indicator matrix of attack users to construct a robust Bayesian probabilistic matrix factorization model and based on which a robust collaborative recommendation algorithm is devised. The experimental results on the MovieLens and Netflix datasets show that our model can significantly improve the robustness and recommendation accuracy compared with three baseline methods.

• Journal of the Korean Data and Information Science Society
• /
• 제21권1호
• /
• pp.163-172
• /
• 2010

In this paper, we deal with the problem for testing homogeneity of coecients of variation in several normal distributions. We propose Bayesian hypothesis testing procedures based on the Bayes factor under noninformative prior. The noninformative prior is usually improper which yields a calibration problem that makes the Bayes factor to be dened up to a multiplicative constant. So we propose the objective Bayesian hypothesis testing procedures based on the fractional Bayes factor and the intrinsic Bayes factor under the reference prior. Simulation study and a real data example are provided.

• Journal of the Korean Data and Information Science Society
• /
• 제18권4호
• /
• pp.1123-1134
• /
• 2007

This article addresses the problem of testing whether the shape parameters in k independent Weibull populations are equal. We propose a Bayesian model selection procedure for equality of the shape parameters. The noninformative prior is usually improper which yields a calibration problem that makes the Bayes factor to be defined up to a multiplicative constant. So we propose the objective Bayesian model selection procedure based on the fractional Bayes factor and the intrinsic Bayes factor under the reference prior. Simulation study and a real example are provided.