• The KIPS Transactions:PartB
• /
• v.13B no.7 s.110
• /
• pp.653-662
• /
• 2006

In ubiquitous computing that is to build computing environments to provide proper services according to user's context, human being's emotion recognition based on facial expression is used as essential means of HCI in order to make man-machine interaction more efficient and to do user's context-awareness. This paper addresses a problem of rigidly basic emotion recognition in context-sensitive facial expressions through a new Bayesian classifier. The task for emotion recognition of facial expressions consists of two steps, where the extraction step of facial feature is based on a color-histogram method and the classification step employs a new Bayesian teaming algorithm in performing efficient training and test. New context-sensitive Bayesian learning algorithm of EADF(Extended Assumed-Density Filtering) is proposed to recognize more exact emotions as it utilizes different classifier complexities for different contexts. Experimental results show an expression classification accuracy of over 91% on the test database and achieve the error rate of 10.6% by modeling facial expression as hidden context.

• Journal of KIISE:Software and Applications
• /
• v.31 no.12
• /
• pp.1569-1580
• /
• 2004

One commonly used approach to deal with uncertainty is Bayesian network which represents joint probability distributions of domain. There are some attempts to team the structure of Bayesian networks automatically and recently many researchers design structures of Bayesian network using evolutionary algorithm. However, most of them use the only one fittest solution in the last generation. Because it is difficult to combine all the important factors into a single evaluation function, the best solution is often biased and less adaptive. In this paper, we present a method of generating diverse Bayesian network structures through fitness sharing and combining them by Bayesian method for adaptive inference. In order to evaluate performance, we conduct experiments on learning Bayesian networks with artificially generated data from ASIA and ALARM networks. According to the experiments with diverse conditions, the proposed method provides with better robustness and adaptation for handling uncertainty.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.12
• /
• pp.885-893
• /
• 2006

The Bayesian network(BN) has emerged in recent years as a powerful technique for handling uncertainty iii complex domains. Parameter learning of BN to find the most proper network from given data set has been investigated to decrease the time and effort for designing BN. Off-line learning needs much time and effort to gather the enough data and since there are uncertainties in real world, it is hard to get the complete data. In this paper, we propose an online learning method of Bayesian network parameters from incomplete data. It provides higher flexibility through learning from incomplete data and higher adaptability on environments through online learning. The results of comparison with Voting EM algorithm proposed by Cohen at el. confirm that the proposed method has the same performance in complete data set and higher performance in incomplete data set, comparing with Voting EM algorithm.

• The KIPS Transactions:PartD
• /
• v.13D no.3 s.106
• /
• pp.369-376
• /
• 2006

This paper presents a new method of significantly improving conventional Bayesian statistical text classifier by incorporating accelerated EM(Expectation Maximization) algorithm. EM algorithm experiences a slow convergence and performance degrade in its iterative process, especially when real online-textual documents do not follow EM's assumptions. In this study, we propose a new accelerated EM algorithm with uncertainty-based selective sampling, which is simple yet has a fast convergence speed and allow to estimate a more accurate classification model on Naive Bayesian text classifier. Experiments using the popular Reuters-21578 document collection showed that the proposed algorithm effectively improves classification accuracy.

• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2009.11a
• /
• pp.95-98
• /
• 2009

본 연구는 주관 감성에 따른 생리 데이터의 패턴을 분류하고, 임의의 생리 데이터의 패턴을 확인하여 각성-이완, 쾌-불쾌의 감성을 추론하기 위해 베이지안 이론(Bayesian learning)을 기반으로 한 추론 모델을 제안하는 것이 목적이다. 본 연구에서 제안하는 모델은 학습데이터를 분류하여 사전확률을 도출하는 학습 단계와 사후확률로 임의의 생리 데이터의 패턴을 분류하여 감성을 추론하는 추론 단계로 이루어진다. 자율 신경계 생리변수(PPG, GSR, SKT) 각각의 패턴 분류를 위해 1~7로 정규화를 시킨 후 선형 관계를 구하여 분류된 패턴의 사전확률을 구하였다. 다음으로 임의의 사전 확률 분포에 대한 사후 확률 분포의 계산을 위해 베이지안 이론을 적용하였다. 본 연구를 통해 주관적 평가를 실시하지 않고 다중 생리변수 인식을 통해 감성을 추론 할 수 있는 모델을 제안하였다.

• The Journal of the Korea Contents Association
• /
• v.5 no.3
• /
• pp.227-235
• /
• 2005

Document filtering is a task of deciding whether a document has relevance to a specified topic. As Internet and Web becomes wide-spread and the number of documents delivered by e-mail explosively grows the importance of text filtering increases as well. In this paper, we treat document filtering problem as binary document classification problem and we proposed the News Filtering system based on the Bayesian Classifier. For we perform filtering, we make an experiment to find out how many training documents, and how accurate relevance checks are needed.

• Journal of Internet Computing and Services
• /
• v.9 no.6
• /
• pp.165-177
• /
• 2008

An important issue in Multiagent reinforcement learning is how an agent should learn its optimal policy in a dynamic environment where there exist other agents able to influence its own performance. Most previous works for Multiagent reinforcement learning tend to apply single-agent reinforcement learning techniques without any extensions or require some unrealistic assumptions even though they use explicit models of other agents. In this paper, a Naive Bayesian based policy model of the opponent agent is introduced and then the Multiagent reinforcement learning method using this model is explained. Unlike previous works, the proposed Multiagent reinforcement learning method utilizes the Naive Bayesian based policy model, not the Q function model of the opponent agent. Moreover, this learning method can improve learning efficiency by using a simpler one than other richer but time-consuming policy models such as Finite State Machines(FSM) and Markov chains. In this paper, the Cat and Mouse game is introduced as an adversarial Multiagent environment. And then effectiveness of the proposed Naive Bayesian based policy model is analyzed through experiments using this game as test-bed.

• Journal of the Korean Data and Information Science Society
• /
• v.12 no.2
• /
• pp.11-25
• /
• 2001

There are several algorithms for classification in modeling relations, patterns, and rules which exist in data. We learn to classify objects on the basis of instances presented to us, not by being given a set of classification rules. The Bayesian learning uses the probability distribution to express our knowledge about unknown parameters and update our knowledge by the law of probability as the evidence gathered from data. Also, the neural network models are designed for predicting an unknown category or quantity on the basis of known attributes by training. In this paper, we compare the misclassification error rates of Bayesian Neural Network method with those of other classification algorithms, CHAID, CART, and QUBST using several data sets.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2005.04a
• /
• pp.403-414
• /
• 2005

Most of the currently used spam-filters are based on a Bayesian classification technique, where some serious problems occur such as a limited precision/recall rate and the false positive error. This paper addresses a solution to the problems using a modified Bayesian classifier based on chi-square statistics. The resulting spam-filter is more accurate and flexible than traditional Bayesian spam-filters and can be a personalized one providing some parameters when the filter is teamed from training data.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.235-237
• /
• 2004

Microarray 로 표현되는 유전자 발현 데이터는 일반적으로 샘플(sample) 수에 비해 많은 수의 유전자를 포함한다. 피처 추출은 이러한 데이터에 기계학습 방법론을 효과적으로 적용하기 위한 방법 중 하나로, 학습성능을 향상시키고 계산 시간을 줄일 수 있을 뿐만 아니라 중요한 피처들을 발견할 수 있다는 점에서 큰 의미를 갖는다. 본 연구에서는 베이지안 신경망(Bayesian Neural Network)에 기반 한 자동유효성탐지(Automatic Relevance Detection, ARD) 기법을 사용하여 유전자 발현 데이터에서 학습 오류를 줄이는 동시에 학습에 필요한 최소한의 유전자 집합을 추출할 수 있는 방법을 제시했다. CAMDA 2003에서 제시된 폐종양 환자의 유전자 발현 데이터에 대해 실험한 결과, 12600 개의 유전자 중에서 가장 중요하다고 여겨지는 187 개의 유전자를 발견했으며, 높은 학습성능을 달성했다.