• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10b
• /
• pp.109-111
• /
• 2001

기존의 협력적 필터링 기술을 이용한 사용자 선호도 예측 방법에서는 아이템에 대한 사용자의 선호도를 기반으로 이웃 선정 방법(Nearest-Neighborhood Method)을 사용하고, 피어슨 상관 계수에 의해 사용자의 유사도를 구하므로 아이템에 대한 내용을 반영하지 못할 뿐만 아니라 희박성 문제를 해결하지 못하였다. 본 논문에서는 기존의 사용자 선호도 예측 방법의 문제점을 보완하기 위하여 연관 사용자 군집과 베이지안 분류를 이음한 사용자 선호도 예측 방법을 제안한다. 제안한 방법에서는 협력적 필터링 시스템에서의 희박성(Sparsity)문제를 해결하기 위하여 ARHP 알고리즘을 사용하여 사용자를 장르별로 군집하며 새로운 사용자는 Naive Bayes 분류자에 의해 이들 장르 중 하나로 분류된다. 또한, 분류된 장르 내에 속한 사용자들과 새로운 사용자의 유사도출 구하기 위해 Naive Bayes 학습을 통해 사용자가 평가한 아이템에 추정치를 달리 부여한다. 추정치가 부여된 선호도를 기존의 피어슨 상관 관계에 적용할 경우 결측치(Missing Value)로 인한 예측의 오류를 적게 하여 예측의 정확도를 높일 수 있다. 제안된 방법의 성능을 평가하기 위해서 기존의 협력적 필터링 기술과 비교 평가하였다.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.6
• /
• pp.1343-1351
• /
• 2010

Sample size determination is very important part in clinical trials because it influences the time and the cost of the experimental studies. In this article, we consider the Bayesian methods for sample size determination based on hypothesis testing. Specifically we compare the usual Bayesian method using Bayes factor with the decision theoretic method using Bayesian reference criterion in mean difference problem for the normal case with known variances. We illustrate two procedures numerically as well as graphically.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.397-410
• /
• 2016

This paper proposes a novel cooperative localization method for distributed wireless networks in 3-dimensional (3D) global positioning system (GPS) denied environments. The proposed method, which is referred to as hybrid ellipsoidal variational algorithm (HEVA), combines the use of non-parametric belief propagation (NBP) and variational Bayes (VB) to benefit from both the use of the rich information in NBP and compact communication size of a parametric form. InHEVA, two novel filters are also employed. The first one mitigates non-line-of-sight (NLoS) time-of-arrival (ToA) messages, permitting it to work well in high noise environments with NLoS bias while the second one decreases the number of calculations. Simulation results illustrate that HEVA significantly outperforms traditional NBP methods in localization while requires only 50% of their complexity. The superiority of VB over other clustering techniques is also shown.

• Journal of the Korean Data Analysis Society
• /
• v.20 no.6
• /
• pp.2747-2757
• /
• 2018

We consider the MLE (maximum likelihood estimate) and Bayesian estimates of three-parameter bathtub-shaped lifetime distribution based on the progressive type II censoring with binomial removal. Jung, Chung (2018) proposed the three-parameter bathtub-shaped distribution which is the extension of the two-parameter bathtub-shaped distribution given by Zhang (2004). Jung, Chung (2018) investigated its properties and estimations. The maximum likelihood estimates are computed using Newton-Raphson algorithm. Also, Bayesian estimates are obtained under the balanced loss function using MCMC (Markov chain Monte Carlo) method. In particular, BSEL (balanced squared error loss) function is considered as a special form of balanced loss function given by Zellner (1994). For comparing theirs MLEs with the corresponding Bayes estimates, some simulations are performed. It shows that Bayes estimates is better than MLEs in terms of risks. Finally, concluding remarks are mentioned.

• Language and Information
• /
• v.10 no.1
• /
• pp.21-46
• /
• 2006

This study proposes a Word Sense Disambiguation (WSD) algorithm, based on concept learning with special emphasis on statistically meaningful lowest frequency words. Previous works on WSD typically make use of frequency of collocation and its probability. Such probability based WSD approaches tend to ignore the lowest frequency words which could be meaningful in the context. In this paper, we show an algorithm to extract and make use of the meaningful lowest frequency words in WSD. Learning method is adopted from the Find-Specific algorithm of Mitchell (1997), according to which the search proceeds from the specific predefined hypothetical spaces to the general ones. In our model, this algorithm is used to find contexts with the most specific classifiers and then moves to the more general ones. We build up small seed data and apply those data to the relatively large test data. Following the algorithm in Yarowsky (1995), the classified test data are exhaustively included in the seed data, thus expanding the seed data. However, this might result in lots of noise in the seed data. Thus we introduce the 'maximum a posterior hypothesis' based on the Bayes' assumption to validate the noise status of the new seed data. We use the Naive Bayes Classifier and prove that the application of Find-Specific algorithm enhances the correctness of WSD.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.1
• /
• pp.53-58
• /
• 2012

With a game-theoretic view, p-persistence slotted ALOHA is structured as a non-cooperative game, in which a Nash equilibrium is sought to provide a value for the probability of attempting to deliver a packet. An expression of Nash equilibrium necessarily includes the number of active outer stations, which is hardly available in many practical applications. In this paper, we thus propose a Bayesian scheme of predicting the number of active outer stations prior to deciding whether to attempt to deliver a packet or not. Despite only requiring the minimal information that an outer station is genetically able to acquire by itself, the Bayesian scheme demonstrates the competitive predicting performance against a method which depends on heavy information.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.6009-6027
• /
• 2019

Support vector machine (SVM) classifiers have been widely used for object detection. These methods usually locate the object by finding the region with maximal score in an image. With bag-of-features representation, the SVM score of an image region can be written as the sum of its inside feature-weights. As a result, the searching process can be executed efficiently by using strategies such as branch-and-bound. However, the feature-weight derived by optimizing region classification cannot really reveal the category knowledge of a feature-point, which could cause bad localization. In this paper, we represent a region in an image by a collection of local feature-points and determine the object by the region with the maximum posterior probability of belonging to the object class. Based on the Bayes' theorem and Naive-Bayes assumptions, the posterior probability is reformulated as the sum of feature-scores. The feature-score is manifested in the form of the logarithm of a probability ratio. Instead of estimating the numerator and denominator probabilities separately, we readily employ the density ratio estimation techniques directly, and overcome the above limitation. Experiments on a car dataset and PASCAL VOC 2007 dataset validated the effectiveness of our method compared to the baselines. In addition, the performance can be further improved by taking advantage of the recently developed deep convolutional neural network features.

• Journal of the Korean Institute of Gas
• /
• v.19 no.2
• /
• pp.45-53
• /
• 2015

In order to improve the performance of the visual inspection process, in addition to existing automatic visual inspection machine and human inspectors have developed a new process configuration using a Naive Bayes classifier. By applying the classifier, defect leakage and human inspector's work amount could be improved at the same time. New classification method called AMPB was applied instead of conventional methods based on MAP classification. By experimental results using the filter product for camera modules, it was confirmed that it is possible to configure the process at the level of leakage ratio 1.14% and human inspector's work amount ratio 75.5%. It is significant that the result can be applied in such a wide range as gas leak detection which is the collaboration process between inspection machine and human inspector's

• Communications for Statistical Applications and Methods
• /
• v.27 no.2
• /
• pp.189-199
• /
• 2020

This paper studies a Bayesian ordered multiple linear regression model with skew normal error. It is reasonable that the kind of inherent information available in an applied regression requires some constraints on the coefficients to be estimated. In addition, the assumption of normality of the errors is sometimes not appropriate in the real data. Therefore, to explain such situations more flexibly, we use the skew-normal distribution given by Sahu et al. (The Canadian Journal of Statistics, 31, 129-150, 2003) for error-terms including normal distribution. For Bayesian methodology, the Markov chain Monte Carlo method is employed to resolve complicated integration problems. Also, under the improper priors, the propriety of the associated posterior density is shown. Our Bayesian proposed model is applied to NZAPB's apple data. For model comparison between the skew normal error model and the normal error model, we use the Bayes factor and deviance information criterion given by Spiegelhalter et al. (Journal of the Royal Statistical Society Series B (Statistical Methodology), 64, 583-639, 2002). We also consider the problem of detecting an influential point concerning skewness using Bayes factors. Finally, concluding remarks are discussed.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.76-78
• /
• 2014

Naive Bayes (NB, for shortly) learning is more popular, faster and effective supervised learning method to handle the labeled datasets especially in which have some noises, NB learning also has well performance. However, the conditional independent assumption of NB learning imposes some restriction on the property of handling data of real world. Some researchers proposed lots of methods to relax NB assumption, those methods also include attribute weighting, kernel density estimating. In this paper, we propose a novel approach called NB Based on Attribute Weighting in Kernel Density Estimation (NBAWKDE) to improve the NB learning classification ability via combining kernel density estimation and attribute weighting.