• Title/Summary/Keyword: 나이브 베이지안 분류기

Search Result 24, Processing Time 0.033 seconds

A Hierarchical CPV Solar Generation Tracking System based on Modular Bayesian Network (베이지안 네트워크 기반 계층적 CPV 태양광 추적 시스템)

  • Park, Susang;Yang, Kyon-Mo;Cho, Sung-Bae
    • Journal of KIISE:Software and Applications
    • /
    • v.41 no.7
    • /
    • pp.481-491
    • /
    • 2014
  • The power production using renewable energy is more important because of a limited amount of fossil fuel and the problem of global warming. A concentrative photovoltaic system comes into the spotlight with high energy production, since the rate of power production using solar energy is proliferated. These systems, however, need to sophisticated tracking methods to give the high power production. In this paper, we propose a hierarchical tracking system using modular Bayesian networks and a naive Bayes classifier. The Bayesian networks can respond flexibly in uncertain situations and can be designed by domain knowledge even when the data are not enough. Bayesian network modules infer the weather states which are classified into nine classes. Then, naive Bayes classifier selects the most effective method considering inferred weather states and the system makes a decision using the rules. We collected real weather data for the experiments and the average accuracy of the proposed method is 93.9%. In addition, comparing the photovoltaic efficiency with the pinhole camera system results in improved performance of about 16.58%.

Classification of Heart Disease Using K-Nearest Neighbor Imputation (K-최근접 이웃 알고리즘을 활용한 심장병 진단 및 예측)

  • Park, Pyoung-Woo;Lee, Seok-Won
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2017.11a
    • /
    • pp.742-745
    • /
    • 2017
  • 본 논문은 심장질환 도메인에 데이터 마이닝 기법을 적용한 연구로, 기존 환자의 정보에 대하여 K-최근접 이웃 알고리즘을 통해 결측 값을 대체하고, 대표적인 예측 분류기인 나이브 베이지안, 소포트 벡터 머신, 그리고 다층 퍼셉트론을 적용하여 각각 결과를 비교 및 분석한다. 본 연구의 실험은 K 최적화 과정을 포함하고 10-겹 교차 검증 방식으로 수행되었으며, 비교 및 분석은 정확도와 카파 통계치를 통해 판별한다.

Variational Bayesian multinomial probit model with Gaussian process classification on mice protein expression level data (가우시안 과정 분류에 대한 변분 베이지안 다항 프로빗 모형: 쥐 단백질 발현 데이터에의 적용)

  • Donghyun Son;Beom Seuk Hwang
    • The Korean Journal of Applied Statistics
    • /
    • v.36 no.2
    • /
    • pp.115-127
    • /
    • 2023
  • Multinomial probit model is a popular model for multiclass classification and choice model. Markov chain Monte Carlo (MCMC) method is widely used for estimating multinomial probit model, but its computational cost is high. However, it is well known that variational Bayesian approximation is more computationally efficient than MCMC, because it uses subsets of samples. In this study, we describe multinomial probit model with Gaussian process classification and how to employ variational Bayesian approximation on the model. This study also compares the results of variational Bayesian multinomial probit model to the results of naive Bayes, K-nearest neighbors and support vector machine for the UCI mice protein expression level data.

Naive Bayes Classifier based Anomalous Propagation Echo Identification using Class Imbalanced Data (클래스 불균형 데이터를 이용한 나이브 베이즈 분류기 기반의 이상전파에코 식별방법)

  • Lee, Hansoo;Kim, Sungshin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.6
    • /
    • pp.1063-1068
    • /
    • 2016
  • Anomalous propagation echo is a kind of abnormal radar signal occurred by irregularly refracted radar beam caused by temperature or humidity. The echo frequently appears in ground-based weather radar due to its observation principle and disturb weather forecasting process. In order to improve accuracy of weather forecasting, it is important to analyze radar data precisely. Therefore, there are several ongoing researches about identifying the anomalous propagation echo with data mining techniques. This paper conducts researches about implementation of classification method which can separate the anomalous propagation echo in the raw radar data using naive Bayes classifier with various kinds of observation results. Considering that collected data has a class imbalanced problem, this paper includes SMOTE method. It is confirmed that the fine classification results are derived by the suggested classifier with balanced dataset using actual appearance cases of the echo.

A Hyperlink-based Feature Weighting Technique for Web Document Classification (웹문서 자동 분류를 위한 하이퍼링크 기반 특징 가중치 부여 기법)

  • Lee, A-Ram;Kim, Han-Joon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.11a
    • /
    • pp.417-420
    • /
    • 2012
  • 기계학습을 이용하는 문서 자동분류 시스템은 분류모델의 구성을 위해서 단어를 특징으로 사용한다. 자동분류 시스템의 성능을 높이기 위해 보다 의미있는 특징을 선택하여 분류모델을 구성하기 위한 여러 연구가 진행되고 있다. 특히 인터넷상에서 사용되는 웹문서는 단어 외에도 태그정보, 링크정보를 가지고 있다. 본 논문에서는 이 두 가지 정보를 이용하여 웹문서 자동분류 시스템의 성능을 향상 시키는 방법 제안 한다. 태그 정보와 링크 정보를 이용하여 적절한 특징을 선택하고, 각 특징의 중요도를 계산하여 가중치를 구한다. 계산된 가중치를 각 특징에 부여하여 분류 모델을 구성하고 나이브 베이지안 분류기를 통하여 성능을 평가하였다

Generation and Selection of Nominal Virtual Examples for Improving the Classifier Performance (분류기 성능 향상을 위한 범주 속성 가상예제의 생성과 선별)

  • Lee, Yu-Jung;Kang, Byoung-Ho;Kang, Jae-Ho;Ryu, Kwang-Ryel
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.12
    • /
    • pp.1052-1061
    • /
    • 2006
  • This paper presents a method of using virtual examples to improve the classification accuracy for data with nominal attributes. Most of the previous researches on virtual examples focused on data with numeric attributes, and they used domain-specific knowledge to generate useful virtual examples for a particularly targeted learning algorithm. Instead of using domain-specific knowledge, our method samples virtual examples from a naive Bayesian network constructed from the given training set. A sampled example is considered useful if it contributes to the increment of the network's conditional likelihood when added to the training set. A set of useful virtual examples can be collected by repeating this process of sampling followed by evaluation. Experiments have shown that the virtual examples collected this way.can help various learning algorithms to derive classifiers of improved accuracy.

Personalized Activity Recognizer and Logger in Smart Phone Environment (스마트폰 환경에서 개인화된 행위 인식기 및 로거)

  • Cho, Geumhwan;Han, Manhyung;Lee, Ho Sung;Lee, Sungyoung
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2012.07a
    • /
    • pp.65-68
    • /
    • 2012
  • 본 논문에서는 최근 활발히 연구가 진행되고 있는 행위인식 연구 분야 중에서 스마트폰 환경에서의 개인화된 행위 인식기 및 로거를 제안한다. 최근 스마트폰의 보급이 활발해지면서 행위 인식 연구 분야에서 스마트폰을 이용하는 연구가 활발히 진행되고 있다. 그러나 스마트폰에서는 센서를 이용하여 행위정보를 수집하고, 서버에서 는 분류 및 처리하는 방식으로 실시간 인식과 개발자에 의한 트레이닝으로 인해 개인화된 트레이닝이 불가능하다는 단점이 있다. 이러한 단점을 극복하고자 Naive Bayes Classifier를 사용하여 스마트폰 환경에서 실시간으로 사용자 행위 수집이 가능하고 행위정보의 분류 및 처리가 가능한 경량화 및 개인화된 행위 인식기 및 로거의 구현을 목적으로 한다. 제안하는 방법은 행위 인식기를 통해 행위 인식이 가능할 뿐만 아니라 로거를 통해 사용자의 라이프로그, 라이프패턴 등의 연구 분야에 이용이 가능하다.

  • PDF

Documents Filtering and Topic Prediction for SNS using Naïve Bayesian Classifier and MapReduce (나이브 베이지안 분류기와 MapReduce 를 이용한 SNS 문서 필터링 및 토픽 예측)

  • Park, Hosik;Kang, Namyong;Park, Seulgi;Moon, Jungmin;Oh, Sangyoon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2014.04a
    • /
    • pp.109-111
    • /
    • 2014
  • SNS(Social Network Service)는 새로운 소통수단으로 인적 네트워크뿐만 아니라 사회, 문화 등에 많은 영향을 미치고 있다. 특히, 무선인터넷과 스마트폰의 보급으로 정보유통량이 기하급수적으로 증가하면서, 데이터를 처리 및 분석하는 것이 화두가 되고 있다. 본 논문에서는 급증하는 SNS 데이터를 처리 및 분석하여 의미 있는 데이터를 키워드 중심으로 추출하고자 하였다. 이를 위해 기존 데이터 처리방식이 아닌 빅데이터 처리에 적합한 MapReduce 환경에서 SNS 데이터를 필터링하고, 토픽을 예측하기 처리방법을 제시하였다. 또한, 웹 서비스를 기반으로 구현하여 분석된 데이터를 시각적으로 표현하고, 재생산하였으며, 실험을 통해 제안하는 처리방법의 성능을 검증하였다.

Game Recommendation System Based on User Ratings (사용자 평점 기반 게임 추천 시스템)

  • Kim, JongHyen;Jo, HyeonJeong;Kim, Byeong Man
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.23 no.6
    • /
    • pp.9-19
    • /
    • 2018
  • As the recent developments in the game industry and people's interest in game streaming become more popular, non-professional gamers are also interested in games and buying them. However, it is difficult to judge which game is the most enjoyable among the games released in dozens every day. Although the game sales platform is equipped with the game recommendation function, it is not accurate because it is used as a means of increasing their sales and recommending users with a focus on their discount products or new products. For this reason, in this paper, we propose a game recommendation system based on the users ratings, which raises the recommendation satisfaction level of users and appropriately reflect their experience. In the system, we implement the rate prediction function using collaborative filtering and the game recommendation function using Naive Bayesian classifier to provide users with quick and accurate recommendations. As the result, the rate prediction algorithm achieved a throughput of 2.4 seconds and an average of 72.1 percent accuracy. For the game recommendation algorithm, we obtained 75.187 percent accuracy and were able to provide users with fast and accurate recommendations.

Exploring the Feature Selection Method for Effective Opinion Mining: Emphasis on Particle Swarm Optimization Algorithms

  • Eo, Kyun Sun;Lee, Kun Chang
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.11
    • /
    • pp.41-50
    • /
    • 2020
  • Sentimental analysis begins with the search for words that determine the sentimentality inherent in data. Managers can understand market sentimentality by analyzing a number of relevant sentiment words which consumers usually tend to use. In this study, we propose exploring performance of feature selection methods embedded with Particle Swarm Optimization Multi Objectives Evolutionary Algorithms. The performance of the feature selection methods was benchmarked with machine learning classifiers such as Decision Tree, Naive Bayesian Network, Support Vector Machine, Random Forest, Bagging, Random Subspace, and Rotation Forest. Our empirical results of opinion mining revealed that the number of features was significantly reduced and the performance was not hurt. In specific, the Support Vector Machine showed the highest accuracy. Random subspace produced the best AUC results.