This HTML5 document contains 85 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n12http://dbpedia.org/resource/File:
n11https://arxiv.org/ftp/arxiv/papers/1301/
n21https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
dbpedia-ruhttp://ru.dbpedia.org/resource/
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n24https://ai.stanford.edu/~paskin/gm-short-course/
n8http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbpedia-frhttp://fr.dbpedia.org/resource/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/
n23http://citeseer.ist.psu.edu/
n6https://web.archive.org/web/20150319085443/https:/ai.stanford.edu/~paskin/gm-short-course/

Statements

Subject Item
dbr:Belief_propagation
dbo:wikiPageWikiLink
dbr:Junction_tree_algorithm
Subject Item
dbr:Moral_graph
dbo:wikiPageWikiLink
dbr:Junction_tree_algorithm
Subject Item
dbr:Bayesian_network
dbo:wikiPageWikiLink
dbr:Junction_tree_algorithm
Subject Item
dbr:Decomposition_method_(constraint_satisfaction)
dbo:wikiPageWikiLink
dbr:Junction_tree_algorithm
Subject Item
dbr:JTA
dbo:wikiPageWikiLink
dbr:Junction_tree_algorithm
dbo:wikiPageDisambiguates
dbr:Junction_tree_algorithm
Subject Item
dbr:Glossary_of_artificial_intelligence
dbo:wikiPageWikiLink
dbr:Junction_tree_algorithm
Subject Item
dbr:Tree_decomposition
dbo:wikiPageWikiLink
dbr:Junction_tree_algorithm
Subject Item
dbr:Junction_tree_algorithm
rdfs:label
Algorithme de l'arbre de jonction Junction tree algorithm Алгоритм для дерева сочленений
rdfs:comment
Алгоритм для дерева сочленений — это метод, используемый в машинном обучении для извлечения маргинализации в графах общего вида. В сущности, алгоритм осуществляет распространение доверия на модифицированном графе, называемом деревом сочленений. Основная посылка алгоритма — исключить циклы путём кластеризации их в узлы. L'algorithme de l'arbre de jonction (aussi appelé algorithme somme-produit ; en anglais, Junction Tree Algorithm ou JTA) est un algorithme d'apprentissage automatique. Il est utilisé dans la théorie des modèles graphiques. The junction tree algorithm (also known as '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. The basic premise is to eliminate cycles by clustering them into single nodes. Multiple extensive classes of queries can be compiled at the same time into larger structures of data. There are different algorithms to meet specific needs and for what needs to be calculated. Inference algorithms gather new developments in the data and calculate it based on the new information provided.
foaf:depiction
n8:Hmm_temporal_bayesian_net.svg n8:Cutset-4.svg n8:Chordal-graph.svg n8:Junction-tree-example.gif
dct:subject
dbc:Bayesian_networks dbc:Graph_algorithms
dbo:wikiPageID
4855682
dbo:wikiPageRevisionID
1068870476
dbo:wikiPageWikiLink
dbr:Algorithm dbr:Joint_distributions dbc:Bayesian_networks n12:Junction-tree-example.gif n12:Chordal-graph.svg dbr:Junction_tree dbr:Exact_solutions dbr:Moral_graph dbr:Belief_propagation dbr:Supernode_(circuit) dbr:Triangulation_(geometry) dbr:Kruskal's_algorithm dbr:Undirected dbr:Variable_elimination dbr:Chordal_graph n12:Cutset-4.svg dbr:Loopy_belief_propagation dbr:Belief_functions dbr:Message_passing_in_computer_clusters dbr:Inference_network dbr:Clique_graph n12:Hmm_temporal_bayesian_net.svg dbr:Separatrix_(mathematics) dbr:Machine_learning dbr:Autoencoder dbr:Computation dbr:Vertex_(graph_theory) dbr:Sum-product_algorithm dbr:Graph_(discrete_mathematics) dbc:Graph_algorithms dbr:Approximate_inference dbr:Treewidth dbr:Random_variable dbr:Marginal_distribution dbr:Cutset dbr:Bayesian_networks dbr:Cycle_(graph_theory)
dbo:wikiPageExternalLink
n6:lec3.pdf n11:1301.7394.pdf n23:huang94inference.html n24:lec3.pdf
owl:sameAs
freebase:m.011q1lrj dbpedia-fr:Algorithme_de_l'arbre_de_jonction dbpedia-ru:Алгоритм_для_дерева_сочленений wikidata:Q2859761 n21:2fK1j yago-res:Junction_tree_algorithm
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Cite_journal
dbo:thumbnail
n8:Junction-tree-example.gif?width=300
dbo:abstract
Алгоритм для дерева сочленений — это метод, используемый в машинном обучении для извлечения маргинализации в графах общего вида. В сущности, алгоритм осуществляет распространение доверия на модифицированном графе, называемом деревом сочленений. Основная посылка алгоритма — исключить циклы путём кластеризации их в узлы. The junction tree algorithm (also known as '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. The basic premise is to eliminate cycles by clustering them into single nodes. Multiple extensive classes of queries can be compiled at the same time into larger structures of data. There are different algorithms to meet specific needs and for what needs to be calculated. Inference algorithms gather new developments in the data and calculate it based on the new information provided. L'algorithme de l'arbre de jonction (aussi appelé algorithme somme-produit ; en anglais, Junction Tree Algorithm ou JTA) est un algorithme d'apprentissage automatique. Il est utilisé dans la théorie des modèles graphiques.
prov:wasDerivedFrom
wikipedia-en:Junction_tree_algorithm?oldid=1068870476&ns=0
dbo:wikiPageLength
10669
foaf:isPrimaryTopicOf
wikipedia-en:Junction_tree_algorithm
Subject Item
dbr:Graphical_model
dbo:wikiPageWikiLink
dbr:Junction_tree_algorithm
Subject Item
dbr:Chordal_graph
dbo:wikiPageWikiLink
dbr:Junction_tree_algorithm
Subject Item
dbr:List_of_statistics_articles
dbo:wikiPageWikiLink
dbr:Junction_tree_algorithm
Subject Item
dbr:Outline_of_machine_learning
dbo:wikiPageWikiLink
dbr:Junction_tree_algorithm
Subject Item
dbr:Junction-tree_algorithm
dbo:wikiPageWikiLink
dbr:Junction_tree_algorithm
dbo:wikiPageRedirects
dbr:Junction_tree_algorithm
Subject Item
wikipedia-en:Junction_tree_algorithm
foaf:primaryTopic
dbr:Junction_tree_algorithm