383-Fall11-Lec14-page16

383-Fall11-Lec14-page16 - k parents, the complete network...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
16 Benefts: Compactness A CPT for Boolean X i with k Boolean parents has 2 k rows for the combinations of parent values Each row requires one number p for X i = true (the number for X i = false is just 1-p ) If each variable has no more than
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: k parents, the complete network requires O(n 2 k ) numbers i.e., grows linearly with n , vs. O(2 n ) for the full joint distribution For burglary net, 1 + 1 + 4 + 2 + 2 = 10 numbers (vs. 2 5-1 = 31)...
View Full Document

Ask a homework question - tutors are online