scholarly journals Penerapan Metode Bayesian Network Model Untuk Menghitung Probabilitas Penyakit Sesak Nafas Bayi

2018 ◽  
Vol 2 (1) ◽  
pp. 62
Author(s):  
Hasniati Hasniati ◽  
Arianti Arianti ◽  
William Philip

Bayesian Network dapat digunakan untuk menghitung probabilitas dari kehadiran berbagai gejala penyakit. Dalam tulisan ini, penulis menerapkan bayesian network model untuk menghitung probabilitas penyakit sesak nafas pada bayi. Bayesian network diterapkan berdasar pada data yang diperoleh melalui wawancara kepada dokter spesialis anak yaitu data nama penyakit, penyebab, dan gejala penyakit sesak nafas pada bayi. Struktur Bayesian Network penyakit sesak nafas bayi dibuat berdasarkan ada tidaknya keterkaitan antara gejala terhadap penyakit sesak nafas. Untuk setiap gejala yang direpresentasikan pada struktur bayesian network mempunyai estimasi parameter yang didapat dari data yang telah ada atau pengetahuan dari dokter spesialis. Data estimasi ini disebut nilai prior probaility atau nilai kepercayaan dari gejala penyakit sesak nafas bayi. Setelah diketahui prior probability, langkah berikutnya adalah menentukan Conditional probability (peluang bersyarat) antara jenis penyakit sesak nafas dengan masing-masing gejalanya. Pada langkah akhir, nilai posterior probability dihitung dengan mengambil nilai hasil joint probability distribution (JPD) yang telah diperoleh, kemudian nilai inilah yang digunakan untuk menghitung probabilitas kemunculan suatu gejala. Dengan mengambil satu contoh kasus bahwa bayi memiliki gejala sesak, lemah, gelisah dan demam, disimpulkan bahwa bayi menderita penyakit sesak nafas Pneumoni Neonatal sebesar 0,1688812743.

2015 ◽  
Vol 15 (4) ◽  
pp. 802-809
Author(s):  
Yong Zhao ◽  
Jinping Zhang ◽  
Weihua Xiao

Using the copula method, the joint probability distribution of irrigation water volume and efficiency is constructed, and their joint return period is also described to reveal the encounter probability of irrigation water volume and efficiency. Furthermore, the conditional probability of irrigation water efficiency with different water volumes is built to show the quantitative effects of flow on irrigation water efficiency. The results show that the copula-based function can present the encounter risk and conditional probability of irrigation water volume and efficiency at their different magnitudes.


Author(s):  
Yang Xiang

Graphical models such as Bayesian networks (BNs) (Pearl, 1988) and decomposable Markov networks (DMNs) (Xiang, Wong & Cercone, 1997) have been applied widely to probabilistic reasoning in intelligent systems. Figure1 illustrates a BN and a DMN on a trivial uncertain domain: A virus can damage computer files, and so can a power glitch. A power glitch also causes a VCR to reset. The BN in (a) has four nodes, corresponding to four binary variables taking values from {true, false}. The graph structure encodes a set of dependence and independence assumptions (e.g., that f is directly dependent on v, and p but is independent of r, once the value of p is known). Each node is associated with a conditional probability distribution conditioned on its parent nodes (e.g., P(f | v, p)). The joint probability distribution is the product P(v, p, f, r) = P(f | v, p) P(r | p) P(v) P(p). The DMN in (b) has two groups of nodes that are maximally pair-wise connected, called cliques. Each clique is associated with a probability distribution (e.g., clique {v, p, f} is assigned P(v, p, f)). The joint probability distribution is P(v, p, f, r) = P(v, p, f) P(r, p) / P(p), where P(p) can be derived from one of the clique distributions. The networks, for instance, can be used to reason about whether there are viruses in the computer system, after observations on f and r are made.


Author(s):  
Marco F. Ramoni ◽  
Paola Sebastiani

Born at the intersection of artificial intelligence, statistics, and probability, Bayesian networks (Pearl, 1988) are a representation formalism at the cutting edge of knowledge discovery and data mining (Heckerman, 1997). Bayesian networks belong to a more general class of models called probabilistic graphical models (Whittaker, 1990; Lauritzen, 1996) that arise from the combination of graph theory and probability theory, and their success rests on their ability to handle complex probabilistic models by decomposing them into smaller, amenable components. A probabilistic graphical model is defined by a graph, where nodes represent stochastic variables and arcs represent dependencies among such variables. These arcs are annotated by probability distribution shaping the interaction between the linked variables. A probabilistic graphical model is called a Bayesian network, when the graph connecting its variables is a directed acyclic graph (DAG). This graph represents conditional independence assumptions that are used to factorize the joint probability distribution of the network variables, thus making the process of learning from a large database amenable to computations. A Bayesian network induced from data can be used to investigate distant relationships between variables, as well as making prediction and explanation, by computing the conditional probability distribution of one variable, given the values of some others.


2013 ◽  
Vol 846-847 ◽  
pp. 1180-1184
Author(s):  
Jia Ju Wu ◽  
Ze You Pan ◽  
Yong Kang Xu ◽  
Rong Yu

IETM has been an important role in equipment integrated support. IETM works mainly through the guidance of the equipment maintenance support information retrieval. So, IETM information retrieval technology is one of the key technologies in the application of integrated equipment support. This paper proposes a new method of IETM information query based on Bayesian network model. The model supports for the IETM information of structured query. IETM information query is based features, the use the IETM dataset words, the elements and structure of unit stats information on the topology of the model structure and the conditional probability learning. Combination of the probability functions of the method and using the model of the probabilistic inference process, the relevance structured IETM information query conditions were estimated. Finally, the information retrieval process is analyzed.


Author(s):  
Marco F. Ramoni ◽  
Paola Sebastiani

Born at the intersection of artificial intelligence, statistics, and probability, Bayesian networks (Pearl, 1988) are a representation formalism at the cutting edge of knowledge discovery and data mining (Heckerman, 1997). Bayesian networks belong to a more general class of models called probabilistic graphical models (Whittaker, 1990; Lauritzen, 1996) that arise from the combination of graph theory and probability theory, and their success rests on their ability to handle complex probabilistic models by decomposing them into smaller, amenable components. A probabilistic graphical model is defined by a graph, where nodes represent stochastic variables and arcs represent dependencies among such variables. These arcs are annotated by probability distribution shaping the interaction between the linked variables. A probabilistic graphical model is called a Bayesian network, when the graph connecting its variables is a directed acyclic graph (DAG). This graph represents conditional independence assumptions that are used to factorize the joint probability distribution of the network variables, thus making the process of learning from a large database amenable to computations. A Bayesian network induced from data can be used to investigate distant relationships between variables, as well as making prediction and explanation, by computing the conditional probability distribution of one variable, given the values of some others.


Author(s):  
Shanshan Tao ◽  
Jialing Song ◽  
Zhifeng Wang ◽  
Yong Liu ◽  
Sheng Dong

Abstract Hong Kong is impacted by tropical cyclones from April to December each year. The duration of tropical cyclones is one key factor to impact the normal operation of port or coastal engineering, and longer time interval between two tropical cyclones can provide longer operation or construction time. Therefore, it is quite important to study on the long-term laws of the duration and time intervals of tropical cyclones which attacked Hong Kong. The Hong Kong Observatory issues the warning signals to warn the public of the threat of winds associated with a tropical cyclone. Choose the tropical cyclones with warning signal No. 3 or above as the research object. A statistical study was conducted on the duration of each tropical cyclone, the time interval between every two continuous tropical cyclones during the year, and the time interval between the last cyclone of each year and the first cyclone of the following year. Poisson compound extreme value distributions are constructed to calculate the return values, which can make people know how long a tropical cyclone with a fixed duration or time interval occurs once in statistical average sense. Based on bivariate copulas, the joint probability distribution of duration and time intervals of tropical cyclones are presented. Then when the duration of a tropical cyclone is known, the conditional probability that the time interval before the next tropical cyclone occurs is greater than a certain value can be calculated. The results provide corresponding conditional probability distributions. Similarly, for the sum of the duration of tropical cyclones each year, and the time interval between the last cyclone of each year and the first cyclone of the following year, their joint probability distribution and conditional probability distributions are also presented. The conditional probability can provide the probabilistic prediction of the length of the stationary period (with no impact of tropical cyclones).


Author(s):  
Marco F. Ramoni ◽  
Paola Sebastiani

Born at the intersection of artificial intelligence, statistics, and probability, Bayesian networks (Pearl, 1988) are a representation formalism at the cutting edge of knowledge discovery and data mining (Heckerman, 1997). Bayesian networks belong to a more general class of models called probabilistic graphical models (Whittaker, 1990; Lauritzen, 1996) that arise from the combination of graph theory and probability theory, and their success rests on their ability to handle complex probabilistic models by decomposing them into smaller, amenable components. A probabilistic graphical model is defined by a graph, where nodes represent stochastic variables and arcs represent dependencies among such variables. These arcs are annotated by probability distribution shaping the interaction between the linked variables. A probabilistic graphical model is called a Bayesian network, when the graph connecting its variables is a directed acyclic graph (DAG). This graph represents conditional independence assumptions that are used to factorize the joint probability distribution of the network variables, thus making the process of learning from a large database amenable to computations. A Bayesian network induced from data can be used to investigate distant relationships between variables, as well as making prediction and explanation, by computing the conditional probability distribution of one variable, given the values of some others.


Sign in / Sign up

Export Citation Format

Share Document