Skip to Main Content
Machine Learning
book

Machine Learning

by Sergios Theodoridis
April 2015
Intermediate to advanced content levelIntermediate to advanced
1062 pages
40h 35m
English
Academic Press
Content preview from Machine Learning

15.7.3 The Sum-Product Algorithm

We will develop the algorithm in a “bottom-up” approach, via the use of an example. Once the rationale is understood, the generalization can readily be obtained. Let us consider the factor tree of Figure 15.26. The factor nodes are denoted by capital letters and squares, and each one is associated with a potential function. The rest are variable nodes, denoted by circles. Assume that we want to compute the marginal P(x1). Node x1, being a variable node, is connected to factor nodes only. We split the graph in as many (tree) subgraphs as the factor nodes connected to x1 (three in our case). In the figure, each one of these subgraphs is encircled, having as roots the nodes A, H, and G, respectively. Recall that ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Machine Learning

Machine Learning

Mohssen Mohammed, Muhammad Badruddin Khan, Eihab Mohammed Bashier
Machine Learning

Machine Learning

Subramanian Chandramouli, Saikat Dutt, Amit Kumar Das
Machine Learning Algorithms

Machine Learning Algorithms

Giuseppe Bonaccorso
Introducing Machine Learning

Introducing Machine Learning

Dino Esposito, Francesco Esposito

Publisher Resources

ISBN: 9780128015223