| http://dbpedia.org/ontology/abstract
|
Алгоритм для дерева сочленений — это метод … Алгоритм для дерева сочленений — это метод, используемый в машинном обучении для извлечения маргинализации в графах общего вида. В сущности, алгоритм осуществляет распространение доверия на модифицированном графе, называемом деревом сочленений. Основная посылка алгоритма — исключить циклы путём кластеризации их в узлы.ючить циклы путём кластеризации их в узлы.
, 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 … 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. it based on the new information provided.
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/Junction-tree-example.gif?width=300 +
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
https://arxiv.org/ftp/arxiv/papers/1301/1301.7394.pdf +
, https://ai.stanford.edu/~paskin/gm-short-course/lec3.pdf +
, http://citeseer.ist.psu.edu/huang94inference.html +
, https://web.archive.org/web/20150319085443/https:/ai.stanford.edu/~paskin/gm-short-course/lec3.pdf +
|
| http://dbpedia.org/ontology/wikiPageID
|
4855682
|
| http://dbpedia.org/ontology/wikiPageLength
|
10669
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1068870476
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Algorithm +
, http://dbpedia.org/resource/Computation +
, http://dbpedia.org/resource/Kruskal%27s_algorithm +
, http://dbpedia.org/resource/Category:Bayesian_networks +
, http://dbpedia.org/resource/Message_passing_in_computer_clusters +
, http://dbpedia.org/resource/Supernode_%28circuit%29 +
, http://dbpedia.org/resource/Cycle_%28graph_theory%29 +
, http://dbpedia.org/resource/Approximate_inference +
, http://dbpedia.org/resource/Moral_graph +
, http://dbpedia.org/resource/Loopy_belief_propagation +
, http://dbpedia.org/resource/File:Hmm_temporal_bayesian_net.svg +
, http://dbpedia.org/resource/Undirected +
, http://dbpedia.org/resource/Clique_graph +
, http://dbpedia.org/resource/File:Cutset-4.svg +
, http://dbpedia.org/resource/Inference_network +
, http://dbpedia.org/resource/Sum-product_algorithm +
, http://dbpedia.org/resource/Junction_tree +
, http://dbpedia.org/resource/Random_variable +
, http://dbpedia.org/resource/Exact_solutions +
, http://dbpedia.org/resource/Belief_propagation +
, http://dbpedia.org/resource/Belief_functions +
, http://dbpedia.org/resource/File:Chordal-graph.svg +
, http://dbpedia.org/resource/Joint_distributions +
, http://dbpedia.org/resource/Machine_learning +
, http://dbpedia.org/resource/Cutset +
, http://dbpedia.org/resource/File:Junction-tree-example.gif +
, http://dbpedia.org/resource/Triangulation_%28geometry%29 +
, http://dbpedia.org/resource/Bayesian_networks +
, http://dbpedia.org/resource/Variable_elimination +
, http://dbpedia.org/resource/Treewidth +
, http://dbpedia.org/resource/Graph_%28discrete_mathematics%29 +
, http://dbpedia.org/resource/Vertex_%28graph_theory%29 +
, http://dbpedia.org/resource/Chordal_graph +
, http://dbpedia.org/resource/Autoencoder +
, http://dbpedia.org/resource/Separatrix_%28mathematics%29 +
, http://dbpedia.org/resource/Marginal_distribution +
, http://dbpedia.org/resource/Category:Graph_algorithms +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Cite_journal +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Graph_algorithms +
, http://dbpedia.org/resource/Category:Bayesian_networks +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Junction_tree_algorithm?oldid=1068870476&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/Chordal-graph.svg +
, http://commons.wikimedia.org/wiki/Special:FilePath/Junction-tree-example.gif +
, http://commons.wikimedia.org/wiki/Special:FilePath/Hmm_temporal_bayesian_net.svg +
, http://commons.wikimedia.org/wiki/Special:FilePath/Cutset-4.svg +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Junction_tree_algorithm +
|
| owl:sameAs |
http://rdf.freebase.com/ns/m.011q1lrj +
, https://global.dbpedia.org/id/2fK1j +
, http://ru.dbpedia.org/resource/%D0%90%D0%BB%D0%B3%D0%BE%D1%80%D0%B8%D1%82%D0%BC_%D0%B4%D0%BB%D1%8F_%D0%B4%D0%B5%D1%80%D0%B5%D0%B2%D0%B0_%D1%81%D0%BE%D1%87%D0%BB%D0%B5%D0%BD%D0%B5%D0%BD%D0%B8%D0%B9 +
, http://yago-knowledge.org/resource/Junction_tree_algorithm +
, http://fr.dbpedia.org/resource/Algorithme_de_l%27arbre_de_jonction +
, http://www.wikidata.org/entity/Q2859761 +
, http://dbpedia.org/resource/Junction_tree_algorithm +
|
| rdfs:comment |
The junction tree algorithm (also known as … 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. 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.
|
| rdfs:label |
Algorithme de l'arbre de jonction
, Junction tree algorithm
, Алгоритм для дерева сочленений
|
