X hits on this document

56 views

0 shares

0 downloads

0 comments

7 / 16

Compactness

A CPT for Boolean Xi with k Boolean parents has 2k rows for the combinations of parent values

Each row requires one number p for Xi = true (the number for  Xi = false is just 1-p)

If each variable has no more than k parents, the complete network requires O(n · 2k) numbers

I.e., grows linearly with n, vs. O(2n) for the full joint distribution

For burglary net, 1 + 1 + 4 + 2 + 2 = 10 numbers (vs. 25-1 = 31)

Document info
Document views56
Page views56
Page last viewedSun Jan 22 23:33:30 UTC 2017
Pages16
Paragraphs125
Words734

Comments