« Junction tree algorithm » : différence entre les versions
(Page créée avec « == en construction == Catégorie:Vocabulary Catégorie:Intelligence artificielle Catégorie:Wikipedia-IA == Définition == ... == Français ==... ») Balise : Éditeur de wikicode 2017 |
m (Remplacement de texte : « ↵<small> » par « ==Sources== ») |
||
| (Une version intermédiaire par le même utilisateur non affichée) | |||
| Ligne 1 : | Ligne 1 : | ||
#REDIRECTION[[Algorithme d'arbre de jonction]] | |||
[[Catégorie:ENGLISH]] | |||
== Anglais == | == Anglais == | ||
| Ligne 18 : | Ligne 11 : | ||
is a method used in machine learning to extract marginalization in general graphs. In essence, it entails performing belief propagation on a modified graph called a junction tree. The graph is called a tree because it branches into different sections of data; nodes of variables are the branches.[198] | is a method used in machine learning to extract marginalization in general graphs. In essence, it entails performing belief propagation on a modified graph called a junction tree. The graph is called a tree because it branches into different sections of data; nodes of variables are the branches.[198] | ||
==Sources== | |||
[https://en.wikipedia.org/wiki/Glossary_of_artificial_intelligence Source : Wikipedia] | [https://en.wikipedia.org/wiki/Glossary_of_artificial_intelligence Source : Wikipedia] | ||
Dernière version du 28 janvier 2024 à 10:58
Rediriger vers :
Anglais
Junction tree algorithm
Clique Tree
is a method used in machine learning to extract marginalization in general graphs. In essence, it entails performing belief propagation on a modified graph called a junction tree. The graph is called a tree because it branches into different sections of data; nodes of variables are the branches.[198]
Sources
Contributeurs: wiki
