BAYESIAN NETWORK AND ITS APPLICATION IN MAIZE DISEASES DIAGNOSIS

Similar documents
Bayesian belief networks

Bayesian Classification. CS690L Data Mining: Classification(2) Bayesian Theorem: Basics. Bayesian Theorem. Training dataset. Naïve Bayes Classifier

CHAPTER VI Statistical Analysis of Experimental Data

Bayesian belief networks

Summary of the lecture in Biostatistics

Introduction to local (nonparametric) density estimation. methods

Functions of Random Variables

Chapter 5 Properties of a Random Sample

Naïve Bayes MIT Course Notes Cynthia Rudin

An Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc. Research on scheme evaluation method of automation mechatronic systems

Chapter 14 Logistic Regression Models

A Sequential Optimization and Mixed Uncertainty Analysis Method Based on Taylor Series Approximation

A New Family of Transformations for Lifetime Data

Estimation of Stress- Strength Reliability model using finite mixture of exponential distributions

Bayes (Naïve or not) Classifiers: Generative Approach

Bayes Estimator for Exponential Distribution with Extension of Jeffery Prior Information

L5 Polynomial / Spline Curves

CHAPTER 3 POSTERIOR DISTRIBUTIONS

NP!= P. By Liu Ran. Table of Contents. The P vs. NP problem is a major unsolved problem in computer

Block-Based Compact Thermal Modeling of Semiconductor Integrated Circuits

On Fuzzy Arithmetic, Possibility Theory and Theory of Evidence

Lecture 9: Tolerant Testing

Point Estimation: definition of estimators

Study on a Fire Detection System Based on Support Vector Machine

This lecture and the next. Why Sorting? Sorting Algorithms so far. Why Sorting? (2) Selection Sort. Heap Sort. Heapsort

PTAS for Bin-Packing

Analyzing Fuzzy System Reliability Using Vague Set Theory

Simple Linear Regression

Solving Constrained Flow-Shop Scheduling. Problems with Three Machines

NP!= P. By Liu Ran. Table of Contents. The P versus NP problem is a major unsolved problem in computer

Comparing Different Estimators of three Parameters for Transmuted Weibull Distribution

Generating Multivariate Nonnormal Distribution Random Numbers Based on Copula Function

Lecture 3. Sampling, sampling distributions, and parameter estimation

Investigating Cellular Automata

Analysis of System Performance IN2072 Chapter 5 Analysis of Non Markov Systems

ENGI 3423 Simple Linear Regression Page 12-01

Analysis of Lagrange Interpolation Formula

ECON 482 / WH Hong The Simple Regression Model 1. Definition of the Simple Regression Model

2.28 The Wall Street Journal is probably referring to the average number of cubes used per glass measured for some population that they have chosen.

Lecture 07: Poles and Zeros

MULTIDIMENSIONAL HETEROGENEOUS VARIABLE PREDICTION BASED ON EXPERTS STATEMENTS. Gennadiy Lbov, Maxim Gerasimov

Chapter 3 Sampling For Proportions and Percentages

On generalized fuzzy mean code word lengths. Department of Mathematics, Jaypee University of Engineering and Technology, Guna, Madhya Pradesh, India

(b) By independence, the probability that the string 1011 is received correctly is

ρ < 1 be five real numbers. The

ENGI 4421 Joint Probability Distributions Page Joint Probability Distributions [Navidi sections 2.5 and 2.6; Devore sections

STATISTICAL PROPERTIES OF LEAST SQUARES ESTIMATORS. x, where. = y - ˆ " 1

TWO NEW WEIGHTED MEASURES OF FUZZY ENTROPY AND THEIR PROPERTIES

( ) = ( ) ( ) Chapter 13 Asymptotic Theory and Stochastic Regressors. Stochastic regressors model

Class 13,14 June 17, 19, 2015

The equation is sometimes presented in form Y = a + b x. This is reasonable, but it s not the notation we use.

A tighter lower bound on the circuit size of the hardest Boolean functions

Statistical modelling and latent variables (2)

X X X E[ ] E X E X. is the ()m n where the ( i,)th. j element is the mean of the ( i,)th., then

Chapter 9 Jordan Block Matrices

Simple Linear Regression

Application of Calibration Approach for Regression Coefficient Estimation under Two-stage Sampling Design

Ordinary Least Squares Regression. Simple Regression. Algebra and Assumptions.

Dependence In Network Reliability

C-1: Aerodynamics of Airfoils 1 C-2: Aerodynamics of Airfoils 2 C-3: Panel Methods C-4: Thin Airfoil Theory

Research on SVM Prediction Model Based on Chaos Theory

DATE: 21 September, 1999 TO: Jim Russell FROM: Peter Tkacik RE: Analysis of wide ply tube winding as compared to Konva Kore CC: Larry McMillan

Study of Correlation using Bayes Approach under bivariate Distributions

Correlation and Simple Linear Regression

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand DIS 10b

Estimation of the Loss and Risk Functions of Parameter of Maxwell Distribution

ABOUT ONE APPROACH TO APPROXIMATION OF CONTINUOUS FUNCTION BY THREE-LAYERED NEURAL NETWORK

Descriptive Statistics

X ε ) = 0, or equivalently, lim

Lecture 8: Linear Regression

Point Estimation: definition of estimators

Unsupervised Learning and Other Neural Networks

best estimate (mean) for X uncertainty or error in the measurement (systematic, random or statistical) best

Eulerian numbers revisited : Slices of hypercube

A Combination of Adaptive and Line Intercept Sampling Applicable in Agricultural and Environmental Studies

Median as a Weighted Arithmetic Mean of All Sample Observations

Simulation Output Analysis

arxiv: v1 [math.st] 24 Oct 2016

9.1 Introduction to the probit and logit models

Pseudo-random Functions

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS

Dimensionality reduction Feature selection

Chapter Two. An Introduction to Regression ( )

Outline. Point Pattern Analysis Part I. Revisit IRP/CSR

Chapter 13, Part A Analysis of Variance and Experimental Design. Introduction to Analysis of Variance. Introduction to Analysis of Variance

Multiple Regression. More than 2 variables! Grade on Final. Multiple Regression 11/21/2012. Exam 2 Grades. Exam 2 Re-grades

Comparison of Parameters of Lognormal Distribution Based On the Classical and Posterior Estimates

An Introduction to. Support Vector Machine

MEASURES OF DISPERSION

CS286.2 Lecture 4: Dinur s Proof of the PCP Theorem

ENGI 4421 Propagation of Error Page 8-01

CHAPTER 4 RADICAL EXPRESSIONS

Chapter 4 Multiple Random Variables

ESS Line Fitting

ECONOMETRIC THEORY. MODULE VIII Lecture - 26 Heteroskedasticity

Collocation Extraction Using Square Mutual Information Approaches. Received December 2010; revised January 2011

Bayes Interval Estimation for binomial proportion and difference of two binomial proportions with Simulation Study

Machine Learning. knowledge acquisition skill refinement. Relation between machine learning and data mining. P. Berka, /18

f f... f 1 n n (ii) Median : It is the value of the middle-most observation(s).

GOALS The Samples Why Sample the Population? What is a Probability Sample? Four Most Commonly Used Probability Sampling Methods

Transcription:

BAYESIAN NETWORK AND ITS APPLICATION IN MAIZE DISEASES DIAGNOSIS Gufe Che, 2, Helog Yu,2,* Computer Scece ad Techology Isttute, Jl Uversty, Chagchu 3002, Cha 2 Iformato Techology Isttute, Jl Agrcultural Uversty, ChagChu 308, Cha * Correspodg author, Address: Iformato Techology Isttute, Jl Agrcultural Uversty, 2888 Cheg Street, ChagChu, 308, P. R. Cha, Tel:+86-43- 84532775, Fax:+86-43-84542775, Emal: yuhelog@yahoo.com.c Abstract: Key words: Bayesa etwork s a powerful tool to represet ad deal wth ucerta kowledge. Ths paper maly troduces some techologes ad methods of modelg Bayesa etwork, whch are used the buldg Maze Dseases Dagoss system. I the costructo of Bayesa etwork, osy-or model ad trasformato from certaty factor to probablty are used. The maze dsease dagoss system based o BN s bult by Netca (a BN software package). The practce proves that BN s a effectve tool for maze dsease dagoss. Bayesa Network; maze; dsease; dagoss. INTRODUCTION There exsts a lot of ucertaty pheomeo ad problem. Ucertaty agrculture s more extesve ad complex. So, order to create a effectve tellget system, ucerta kowledge must be dealt wth. From represetato of ucertaty kowledge, there are two methods of dealg wth ucertaty. Oe s rule-based method, ad the other s modelbased method. The advatage of rule-based method s that ts computato s coveet, ad ts dsadvatage s that ts sytax s ot systemc. The advatage ad dsadvatage of model-based method are cotrary to the rulebased method.

Bayesa Network ad Its Applcato Maze Dseases Dagoss 927 From measuremet of ucertaty, the methods of dealg wth ucertaty are fuzzy theory ad probablty theory. Fuzzy theory maly deals wth vagueess, ad probablty theory maly deals wth radomess. Therefore, Bayesa etwork the artcle s a model-based probablty method. For the ucertaty agrculture, there are some good model ad applcato, but maly rule-based. Ths method s adapted to kowledge represeted by rule. However, ucertaty agrculture s varous. It s ot adequate for rule to represet ths ucertaty. I order to solve t, Bayesa etwork s troduced. It wdes kowledge represetato that creases the relablty of expert system. Bayesa etwork s a combato of probablty theory ad graph theory. Study of Bayesa etwork orgates from the 980 s. Sce 990 s, ts study ad applcato have strred great cocer. Compared wth rule based method, the sytax of Bayesa etwork s clearer, whch ca reaso dual drecto ad ca be costructed ad debugged rapdly. The dsadvatage of Bayesa etwork s that the computato complexty s hgh. Ths paper maly troduces the applcato of Bayesa etwork maze dsease dagoss system. As far as the computg complexty s cocered, the Bayesa etwork costructo, osy or techology are adapted to smplfy etwork structure ad codto probablty table. O rug the system, we fd that the result s coformed to doma expert. It proves that t s effectve to use Bayesa etwork to represet ad deal wth ucerta kowledge agrculture. 2. BAYESIAN NETWORK 2. Bayesa Network Sytax BN= (Structure, CPT) () Structure cota odes ad arcs Nodes: radom varable.! Nodes ca be cotuous or dscrete.! Nodes ca have two states or more.! Nodes ca be determstc or odetermstc. Arcs: relatoshps betwee odes.! Arcs represet causal relatoshps of odes.! Arc betwee x ad y represets that x has drect causal fluece oly. (2) CPT: Codto Probablty Table! Each ode has codto probablty whch s stored a table(cpt).

928 Gufe Che, Helog Yu! Value table s parets( )), parets( ) s the set of paret odes of.! Root ode s partcular, as t has o paret ode ad has oly pror probablty: parets ( ) = Φ, so parets( ))= ). 2.2 BN Sematcs! Local sematc: represet codtoal depedece the et! Global sematc: represet global probablty dstrbuto... ) = Parets( )) = We ca coclude that Bayesa Network s combato of etwork structure ad CPT, or global probablty dstrbuto s combato of codtoal depedece ad local probablty. 3. BN BUILDING Before beg deduced, Bayesa etwork must be costructed. As we kow, Bayesa etwork has two parts: structure ad CPT, so the process of costructg Bayesa etwork s to costruct structure ad CPT(Davd J.Spegelhalter,993). There are three methods to costruct Bayesa etwork: maual costructo, mache learg ad combato of them. Ths artcle maly troduces maual method, whch costructs Bayesa etwork by doma expert elctato(e.charles, J.Kah, etc,997). 3. Elcato of BN Structure I ths process, varables ad relatoshps betwee them should be determed. Frst, select varable set. It s mportat to lmt the umber of varables. So, t s ecessary to choose mportat varables whch are! Query varables: or object varables, they are outputs of et ad what we wat to kow.! Evdece varables: or observato varables, they are puts of et ad used to reaso states of query varables.! Cotext varables: or mddle varables, they are used to coect query varables ad evdece varables.! Cotrollable varables: or adjustable varables, they are used to cotrol ad adjust et. If objects are mutex, they ca be states of a varable, else beg varous

Bayesa Network ad Its Applcato Maze Dseases Dagoss 929 varables. Arc cause ->effect represet cause s oe of cause for effect. There are two cases:! Mult-causes, oe effect.! Oe cause, mult-effects. Accordg to the formula P (... ) =,..., ) 2,..., )... 2 ) ), we ca fd that the = ( Parets( ) ) = rght sequece of addg odes s:! Add root odes.! Add odes that be flueced drectly by root odes.! Repeat the above two steps utl leaf odes are added. 3.2 Elctato of Codto Probablty Table There are three kds of probablty, amely objectve probablty, frequet probablty ad subjectve probablty, whch orgate from data, doma experts ad lterature. I ths process, the state of each varable ad qualtatve probablty should be determed. Ths ca be obtaed by doma expert ad lterature. I order to decrease the sze of etwork, state umber should be lmted. I the meawhle, states should be mutex. Geerally, probablty gve by doma expert s qualtatve, so the trasformato from qualtatve probablty to quattatve probablty s ecessary (Table ). Table. The trasformato from qualtatve probablty to quattatve probablty Qualtatve Probablty Quattatve Probablty always 0.99 geerally 0.85 ofe 0.78 usually 0.73 Not ofe 0.50 sometme 0.20 occasoally 0.5 Usually ot 0.0 seldom 0.30

930 Gufe Che, Helog Yu 3.3 Two methods used buldg maze dsease dagoss system 3.3. Nosy-or Techology Ths model has three assumptos:! Parets ad chld are Boolea varables.! Ihbto of oe paret s depedet of the hbtos of ay other parets.! All possble causes are lsted. I practce ths costrat s ot a ssue because a leak ode ca be added (a leak ode s a addtoal paret of a Nosy-or ode). Now, we ca have a defto of osy-or:! A chld ode s false oly f ts true parets are hbted.! The probablty of such hbto s the product of the hbto probabltes for each paret.! So the probablty that the chld ode s true s mus the product of the hbto probabltes for the true parets. For Fg., we ca get ths formula: F H, H 2,... H ) = ( p ) = Geerally, for ode havg k paret odes, f use Nosy-or, t eeds k (k) parameters, f ot, t eeds ( 2 ) parameters. Obvously, BN s smplfed. 3.3.2 Trasformato from Certaty Factor to Probablty of BN H =reaso F=result I the maze dsease dagoss, the kowledge gve by doma expert s rule-based, ad measuremet for the belef s certaty factor, that s:

Bayesa Network ad Its Applcato Maze Dseases Dagoss 93 IF A THEN B CF(B A) Defto of certaty factor (CF): f > CF ( = 0f = f < p( However, the Bayesa etwork, ucertaty s measured by probablty. So, order to costruct Bayesa etwork, t eeds to trasform CF to probablty(f.tra. 996; Kev B.Korb, A E.Ncholso, 2006;Nev Lawe Zhag, 996). From above formula, we ca obta: CF( B A)( ) + fcf( B A) 0 P ( B A) =. ( CF( B A) + ) fcf( B A) < 0 So, order to get probablty, t eeds to kow, whch s pror probablty of ode B. ca be obtaed from doma expert, lterature, or assume =0.5. 4. IMPLEMENTATION OF MAIZE DISEASE DIGNOSIS SYSTEM BASED ON BAYESIAN NETWORK Costruco of a Bayesa etwork for a doma problem eeds commucato ad cooperato of Bayesa etwork expert, doma expert ad BN software tool(p.j.f Lucas, 2005). There are two types of odes the Maze Dsease Dagoss System whch are dsease odes ad symptom odes. The dsease odes are Boolea varables, whch cota states: happe ad uhappe [P.J.F Lucas,200; Radm Jrousck,997], whle Symptom odes may cota multple states. Ths BN s a two-layer etwork, whch the upper layer s composed of dsease odes ad the lower layer s composed of symptom odes. Obvously the arc drecto s from dsease odes to symptom odes. Fg.2 s a part of BN structure for maze dsease dagoss. I ths structure there are four dsease odes ad four symptom odes, whch correspods to four dseases ad four symptoms. The four dseases are maze dwarf mosac, maze sheath blght, maze orther blght ad bpolarsmayds.

932 Gufe Che, Helog Yu Fg.2: A part of BN structure Wth the Nosy-or techology ad probablty trasformg from CF to probablty, ode s CPT s acheved. We ca fd the ferece results from Fg.3, whch are the posteror probablty of dsease whe plat shape s ormal, speckle posto s lama ad speckle shape s others. Fg.3: ferece results of the BN 5. CONCLUSIONS BN s a strog tool for represetg ad dealg wth ucerta kowledge. There exsts a lot of ucertaty kowledge maze dsease dagoss. So t s atural to use BN to buld maze dsease dagoss system. Whle buldg BN, Nosy-or model ad trasformato from CF to probablty are used to decreasg etwork scale ad smplfy the etwork structure. I rug the maze dsease dagoss system, we fd that the reasog result s coformed wth the soluto gve by doma expert, as proves that t s effectve to use Bayesa etwork to represet ad deal wth ucerta kowledge dsease dagoss. Obvously, BN ca be used the dagoss of maze pestcde, whch wll be doe the ear future.

Bayesa Network ad Its Applcato Maze Dseases Dagoss 933 ACKNOWLEDGEMENTS Ths artcle s supported ad fuded by Cha Natoal 863 Plas Projects (Cotract Number: 2006AA0A309). REFERENCES Davd J.Spegelhalter.993.Bayesa Aalyss Expert Systems, Statstcal Scece, Volume 8, Issue 3: 29-247. E.Charles,J.Kah, etc.997.costructo of a Bayesa etwork for mammographc dagoss of breast cacer, Comut.Bol.Med: 9-29. F.tra. 996.A bayesa etwork for predctg yeld respose of wter wheat to fugcde programs, Computers ad electrocs agrculture: -2. Kev B.Korb, A E.Ncholso. 2006.Bayesa Artfcal Itellgece, CRC Press:.225-260 Nev Lawe Zhag, 996.Explotg causal depedece Bayesa etwork ferece, Joural of artfcal tellgece: 30-328. P.J.F Lucas, 2005.Bayesa etwork modelg through qualtatve patters. Artfcal Itellgece: 233-263. P.J.F Lucas.200.Certaty-Factor-Lke structures Bayesa belef etworks, Kowledgebased systems: 327-335. Radm Jrousck.997.costructg probablstc models, Iteratoal joural of medcal formatcs 45: 9-8.