• Journal of KIISE
• /
• v.41 no.10
• /
• pp.785-791
• /
• 2014

Twitter is one of the most famous SNS(Social Network Service) in the world. Twitter spammer accounts that are created easily by E-mail authentication deliver harmful content to twitter users. This paper presents a spammer detection method that utilizes features based on the relationship between users in twitter. Relationship-based features include friends relationship that represents user preferences and type relationship that represents similarity between users. We compared the performance of the proposed method and conventional spammer detection method on a dataset with 3% to 30% spammer ratio, and the experimental results show that proposed method outperformed conventional method in Naive Bayesian Classification and Decision Tree Learning.

• Proceedings of the KSPS conference
• /
• 2005.11a
• /
• pp.151-154
• /
• 2005

원거리 음성인식에서 인식률의 성능향상을 위해 필수적인 다채널 마이크 환경에서 방 안의 도처에 분산되어있는 원거리 마이크를 사용하여 TV, 조명 등의 주변 환경을 음성으로 제어하고자 한다. 이를 위해 각 채널의 인식결과를 통합하여 최적의 결과를 얻고자 채널의N-best 결과와 N-best 결과에 포함된 hypothesis의 frame-normalized likelihood 값을 사용하여 Bayesian network을 훈련하고 인식결과를 통합하여 최선의 결과를 decision 하는데 사용함으로써 원거리 음성인식의 성능을 향상시키고 또한 hands-free 응용을 현실화하기위한 방향을 제시한다.

• 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.

• Journal of KIISE:Software and Applications
• /
• v.31 no.1
• /
• pp.1-7
• /
• 2004

For the handwritten digit recognition, this paper Proposes a hierarchical Gator features extraction method and a Bayesian network for them. Proposed Gator features are able to represent hierarchically different level information and Bayesian network is constructed to represent hierarchically structured dependencies among these Gator features. In order to extract such features, we define Gabor filters level by level and choose optimal Gabor filters by using Fisher's Linear Discriminant measure. Hierarchical Gator features are extracted by optimal Gabor filters and represent more localized information in the lower level. Proposed methods were successfully applied to handwritten digit recognition with well-known naive Bayesian classifier, k-nearest neighbor classifier. and backpropagation neural network and showed good performance.

• Journal of Computing Science and Engineering
• /
• v.9 no.4
• /
• pp.204-213
• /
• 2015

Under the conditional independence assumption among local features, the Naive Bayes Nearest Neighbor (NBNN) classifier has been recently proposed and performs classification without any training or quantization phases. While the original NBNN shows high classification accuracy without adopting an explicit training phase, the conditional independence among local features is against the compositionality of objects indicating that different, but related parts of an object appear together. As a result, the assumption of the conditional independence weakens the accuracy of classification techniques based on NBNN. In this work, we look into this issue, and propose a novel Bayesian network for an NBNN based classification to consider the conditional dependence among features. To achieve our goal, we extract a high-level feature and its corresponding, multiple low-level features for each image patch. We then represent them based on a simple, two-level layered Bayesian network, and design its classification function considering our Bayesian network. To achieve low memory requirement and fast query-time performance, we further optimize our representation and classification function, named relation-based Bayesian network, by considering and representing the relationship between a high-level feature and its low-level features into a compact relation vector, whose dimensionality is the same as the number of low-level features, e.g., four elements in our tests. We have demonstrated the benefits of our method over the original NBNN and its recent improvement, and local NBNN in two different benchmarks. Our method shows improved accuracy, up to 27% against the tested methods. This high accuracy is mainly due to consideration of the conditional dependences between high-level and its corresponding low-level features.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1031-1040
• /
• 2004

Electrocardiogram being the recording of the heart's electrical activity provides valuable clinical information about heart's status. Many re-searches have been pursued for heart disease diagnosis using ECG so far. However, electrocardio-graph uses foreign diagnosis algorithm due to inaccuracy of diagnosis results for a heart disease. This paper suggests ECG data collection, data preprocessing and heart disease pattern classification using data mining. This classification technique is the FB(Frequent pattern Bayesian) classifier and is a combination of two data mining problems, naive bayesian and frequent pattern mining. FB uses Product Approximation construction that uses the discovered frequent patterns. Therefore, this method overcomes weakness of naive bayesian which makes the assumption of class conditional independence.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.04a
• /
• pp.405-408
• /
• 2000

최근 인터넷의 발전으로 많은 정보와 지식을 우리는 인터넷에서 제공받을 수 있게되었다. 인터넷에 존재하는 정보는 수많은 웹서버에 산재되어 있으며, 정보의 위치는 주소(URL)를 가지고 존재하게 되는데 사용자는 자신이 관심있는 정보의 주소를 저장하기 위하여 웹브라우저 북마크(Bookmark)기능을 사용한다. 그러나 북마크 기능은 웹문서의 주소 저장에 일차적인 목적을 두고 있으며, 이후 북마크의 개수가 증가하면, 사용자는 북마크관리가 어렵게되므로 사용자 북마크 파일을 자동으로 분류하여 관리할수 있는 에이전트 기술을 사용하고자 한다. 대표적인 분류에이전트 시스템으로는 전자우편 분류 에이전트인 Maxims, 뉴스기사 분류 에이전트인 NewT, 엔터테인먼트(Entertainment) 선별 에이전트인 Ringo 등이 있다. 이러한 시스템들은 분류할 대상에 따라 조금씩 다른 모습의 에이전트 기능을 보이고 있으며, 본 논문은 기계학습 이론중 교사학습 알고리즘인 나이브 베이지안 학습방법(Naive Bayesian Learning method)을 사용하여 사용자가 분류하지 못한 북마크를 자동으로 분류하는 단일 에이전트 기반 북마크 분류기를 설계, 구현하고자한다.

• Journal of the Korean Data and Information Science Society
• /
• v.11 no.1
• /
• pp.19-30
• /
• 2000

As the number of online documents increases enormously with the expansion of information technology, the importance of automatic document classification is greatly enlarged. In this paper, an automatic document classification method is investigated and applied to UseNet 20 newsgroup articles to test its efficacy. The classification system uses Naive Bayes classification algorithm and the experimental result shows that a randomly selected newsgroup arcicle can be classified into its own category over 77% accuracy.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.10a
• /
• pp.323-326
• /
• 2016

웹 서비스를 기반으로 이루어진 MOOC(Massive Open Online Course)는 대규모 학습자에게 공개된 온라인 교육이다. MOOC는 교수와 학습자 사이 커뮤니티를 통해 상호 참여적으로 수업을 진행한다. 그러나 무료로 강의를 들을 수 있고 성적을 내지 않기 때문에 학습자들에게 큰 동기 부여가 되지 않아 등록하는 학습자는 많지만 수료하는 학습자는 현저히 적게 나타났다. 본 논문은 이러한 문제 해결 방안 마련을 위해 KDD Cup 2015에서 제공한 MOOC 데이터를 통해 중도 포기와 관련된 변수들을 선정하였으며, Decision Tree, KNN, Logistic Regression, Naive Bayesian, SVM, Neural Network인 6가지 머신 러닝 알고리즘을 통해 데이터 예측의 정확률을 확인하였다. 그 결과 Naive Bayesian이 89.3%로 가장 높은 정확률을 보였다. 본 연구를 통해 중도포기를 정확히 예측하며, 향후 학습자들에게 특정 동기부여의 효과로 학습을 수료하는 결과를 기대할 수 있다.

• Journal of Information Technology Services
• /
• v.2 no.2
• /
• pp.87-95
• /
• 2003

With the increasing proliferation of World Wide Web, electronic mail systems have become very widely used communication tools. Researches on e-mail classification have been very important in that e-mail classification system is a major engine for e-mail response management systems which mine unstructured e-mail messages and automatically categorize them. in this research we develop e-mail classifiers for e-mail Response Management Systems (ERMS) using naive bayesian learning and centroid-based classification. We analyze which method performs better under which conditions, comparing classification accuracies which may depend on the structure, the size of training data set and number of classes, using the different data set of an on-line shopping mall and a credit card company. The developed e-mail classifiers have been successfully implemented in practice. The experimental results show that naive bayesian learning performs better, while centroid-based classification is more robust in terms of classification accuracy.