逻辑推理 _人工智能教学课件.pptVIP

Suppose we choose the ordering M, J, A, B, E P(J | M) = P(J)? No P(A | J, M) = P(A | J)? P(A | J, M) = P(A)? No P(B | A, J, M) = P(B | A)? Yes P(B | A, J, M) = P(B)? No P(E | B, A, J, M) = P(E | B)? No P(E | B, A, J, M) = P(E | B, A)? Yes (P(E | B, A) P(E | A)) P(E | B, A ,J, M) = P(E | A)? No Example Example contd. Network is less compact: 1 + 2 + 4 + 2 + 4 = 13 numbers needed Deciding conditional independence is hard in noncausal directions (Causal models and conditional independence seem hardwired for humans!) 条件独立关系 贝叶斯网络中节点相互独立(下面两个定义等价)： (1)给定父节点，一个节点与它的非后代节点是条件独立的 ； (2)给定一