• Title/Summary/Keyword: Bayesian Learning

Search Result 280, Processing Time 0.035 seconds

Project Duration Estimation and Risk Analysis Using Intra-and Inter-Project Learning for Partially Repetitive Projects (부분적으로 반복되는 프로젝트를 위한 프로젝트 내$\cdot$외 학습을 이용한 프로젝트기간예측과 위험분석)

  • Cho, Sung-Bin
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.30 no.3
    • /
    • pp.137-149
    • /
    • 2005
  • This study proposes a framework enhancing the accuracy of estimation for project duration by combining linear Bayesian updating scheme with the learning curve effect. Activities in a particular project might share resources in various forms and might be affected by risk factors such as weather Statistical dependence stemming from such resource or risk sharing might help us learn about the duration of upcoming activities in the Bayesian model. We illustrate, using a Monte Carlo simulation, that for partially repetitive projects a higher degree of statistical dependence among activity duration results in more variation in estimating the project duration in total, although more accurate forecasting Is achievable for the duration of an individual activity.

A study on the localization of incipient propeller cavitation applying sparse Bayesian learning (희소 베이지안 학습 기법을 적용한 초생 프로펠러 캐비테이션 위치추정 연구)

  • Ha-Min Choi;Haesang Yang;Sock-Kyu Lee;Woojae Seong
    • The Journal of the Acoustical Society of Korea
    • /
    • v.42 no.6
    • /
    • pp.529-535
    • /
    • 2023
  • Noise originating from incipient propeller cavitation is assumed to come from a limited number of sources emitting a broadband signal. Conventional methods for cavitation localization have limitations because they cannot distinguish adjacent sound sources effectively due to low accuracy and resolution. On the other hand, sparse Bayesian learning technique demonstrates high-resolution restoration performance for sparse signals and offers greater resolution compared to conventional cavitation localization methods. In this paper, an incipient propeller cavitation localization method using sparse Bayesian learning is proposed and shown to be superior to the conventional method in terms of accuracy and resolution through experimental data from a model ship.

Learning Behavior Analysis of Bayesian Algorithm Under Class Imbalance Problems (클래스 불균형 문제에서 베이지안 알고리즘의 학습 행위 분석)

  • Hwang, Doo-Sung
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.6
    • /
    • pp.179-186
    • /
    • 2008
  • In this paper we analyse the effects of Bayesian algorithm in teaming class imbalance problems and compare the performance evaluation methods. The teaming performance of the Bayesian algorithm is evaluated over the class imbalance problems generated by priori data distribution, imbalance data rate and discrimination complexity. The experimental results are calculated by the AUC(Area Under the Curve) values of both ROC(Receiver Operator Characteristic) and PR(Precision-Recall) evaluation measures and compared according to imbalance data rate and discrimination complexity. In comparison and analysis, the Bayesian algorithm suffers from the imbalance rate, as the same result in the reported researches, and the data overlapping caused by discrimination complexity is the another factor that hampers the learning performance. As the discrimination complexity and class imbalance rate of the problems increase, the learning performance of the AUC of a PR measure is much more variant than that of the AUC of a ROC measure. But the performances of both measures are similar with the low discrimination complexity and class imbalance rate of the problems. The experimental results show 4hat the AUC of a PR measure is more proper in evaluating the learning of class imbalance problem and furthermore gets the benefit in designing the optimal learning model considering a misclassification cost.

A Meta-learning Approach that Learns the Bias of a Classifier

  • 김영준;홍철의;김윤호
    • Journal of Intelligence and Information Systems
    • /
    • v.3 no.2
    • /
    • pp.83-91
    • /
    • 1997
  • DELVAUX is an inductive learning environment that learns Bayesian classification rules from a set o examples. In DELVAUX, a genetic a, pp.oach is employed to learn the best rule-set, in which a population consists of rule-sets and rule-sets generate offspring by exchanging some of their rules. We have explored a meta-learning a, pp.oach in the DELVAUX learning environment to improve the classification performance of the DELVAUX system. The meta-learning a, pp.oach learns the bias of a classifier so that it can evaluate the prediction made by the classifier for a given example and thereby improve the overall performance of a classifier system. The paper discusses the meta-learning a, pp.oach in details and presents some empirical results that show the improvement we can achieve with the meta-learning a, pp.oach.

  • PDF

Fast Conditional Independence-based Bayesian Classifier

  • Junior, Estevam R. Hruschka;Galvao, Sebastian D. C. de O.
    • Journal of Computing Science and Engineering
    • /
    • v.1 no.2
    • /
    • pp.162-176
    • /
    • 2007
  • Machine Learning (ML) has become very popular within Data Mining (KDD) and Artificial Intelligence (AI) research and their applications. In the ML and KDD contexts, two main approaches can be used for inducing a Bayesian Network (BN) from data, namely, Conditional Independence (CI) and the Heuristic Search (HS). When a BN is induced for classification purposes (Bayesian Classifier - BC), it is possible to impose some specific constraints aiming at increasing the computational efficiency. In this paper a new CI based approach to induce BCs from data is proposed and two algorithms are presented. Such approach is based on the Markov Blanket concept in order to impose some constraints and optimize the traditional PC learning algorithm. Experiments performed with the ALARM, as well as other six UCI and three artificial domains revealed that the proposed approach tends to execute fewer comparison tests than the traditional PC. The experiments also show that the proposed algorithms produce competitive classification rates when compared with both, PC and Naive Bayes.

Recognition of Korean Vowels using Bayesian Classification with Mouth Shape (베이지안 분류 기반의 입 모양을 이용한 한글 모음 인식 시스템)

  • Kim, Seong-Woo;Cha, Kyung-Ae;Park, Se-Hyun
    • Journal of Korea Multimedia Society
    • /
    • v.22 no.8
    • /
    • pp.852-859
    • /
    • 2019
  • With the development of IT technology and smart devices, various applications utilizing image information are being developed. In order to provide an intuitive interface for pronunciation recognition, there is a growing need for research on pronunciation recognition using mouth feature values. In this paper, we propose a system to distinguish Korean vowel pronunciations by detecting feature points of lips region in images and applying Bayesian based learning model. The proposed system implements the recognition system based on Bayes' theorem, so that it is possible to improve the accuracy of speech recognition by accumulating input data regardless of whether it is speaker independent or dependent on small amount of learning data. Experimental results show that it is possible to effectively distinguish Korean vowels as a result of applying probability based Bayesian classification using only visual information such as mouth shape features.

On-line Diagnosis System with Learning Bayesian Networks for fsEBPR

  • Cheon, Seong-Pyo;Kim, Sung-Shin
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.7 no.4
    • /
    • pp.279-284
    • /
    • 2007
  • Nowadays, due to development of automatic control devices and various sensors, one operator can freely handle several remote plants and processes. Automatic diagnosis and warning systems have been adopted in various fields, in order to prepare an operator's absence for patrolling plants. In this paper, a Bayesian networks based on-line diagnosis system is proposed for a wastewater treatment process. Especially, the suggested system is included learning structure, which can continuosly update conditional probabilities in the networks. To evaluate performance of proposed model, we made a lab-scale five-stage step-feed enhanced biological phosphorous removal process plant and applied on-line diagnosis system to this plant in the summer.

Parameter Learning of Dynamic Bayesian Networks using Constrained Least Square Estimation and Steepest Descent Algorithm (제약조건을 갖는 최소자승 추정기법과 최급강하 알고리즘을 이용한 동적 베이시안 네트워크의 파라미터 학습기법)

  • Cho, Hyun-Cheol;Lee, Kwon-Soon;Koo, Kyung-Wan
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.58 no.2
    • /
    • pp.164-171
    • /
    • 2009
  • This paper presents new learning algorithm of dynamic Bayesian networks (DBN) by means of constrained least square (LS) estimation algorithm and gradient descent method. First, we propose constrained LS based parameter estimation for a Markov chain (MC) model given observation data sets. Next, a gradient descent optimization is utilized for online estimation of a hidden Markov model (HMM), which is bi-linearly constructed by adding an observation variable to a MC model. We achieve numerical simulations to prove its reliability and superiority in which a series of non stationary random signal is applied for the DBN models respectively.

Structure Learning in Bayesian Networks Using Asexual Reproduction Optimization

  • Khanteymoori, Ali Reza;Menhaj, Mohammad Bagher;Homayounpour, Mohammad Mehdi
    • ETRI Journal
    • /
    • v.33 no.1
    • /
    • pp.39-49
    • /
    • 2011
  • A new structure learning approach for Bayesian networks based on asexual reproduction optimization (ARO) is proposed in this paper. ARO can be considered an evolutionary-based algorithm that mathematically models the budding mechanism of asexual reproduction. In ARO, a parent produces a bud through a reproduction operator; thereafter, the parent and its bud compete to survive according to a performance index obtained from the underlying objective function of the optimization problem: This leads to the fitter individual. The convergence measure of ARO is analyzed. The proposed method is applied to real-world and benchmark applications, while its effectiveness is demonstrated through computer simulations. Results of simulations show that ARO outperforms genetic algorithm (GA) because ARO results in a good structure and fast convergence rate in comparison with GA.

Collaborative CRM using Statistical Learning Theory and Bayesian Fuzzy Clustering

  • Jun, Sung-Hae
    • Communications for Statistical Applications and Methods
    • /
    • v.11 no.1
    • /
    • pp.197-211
    • /
    • 2004
  • According to the increase of internet application, the marketing process as well as the research and survey, the education process, and administration of government are very depended on web bases. All kinds of goods and sales which are traded on the internet shopping malls are extremely increased. So, the necessity of automatically intelligent information system is shown, this system manages web site connected users for effective marketing. For the recommendation system which can offer a fit information from numerous web contents to user, we propose an automatic recommendation system which furnish necessary information to connected web user using statistical learning theory and bayesian fuzzy clustering. This system is called collaborative CRM in this paper. The performance of proposed system is compared with the other methods using real data of the existent shopping mall site. This paper shows that the predictive accuracy of the proposed system is improved by comparison with others.