Name
Abstract | ||
|---|---|---|
This paper proposes a new data structure for representing potentials. Recursive probability trees are a generalization of probability trees. Both structures are able to represent context-specific independencies, but the new one is also able to hold a potential in a factorized way. This new structure can represent some kinds of potentials in a more efficient way than probability trees, and it can be the case that only recursive trees are able to represent certain factorizations. Basic operations for inference in Bayesian networks can be directly performed upon recursive probability trees. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-14264-2_25 | CAEPIA |
Keywords | Field | DocType |
basic operation,probability tree,context-specific independency,bayesian network,recursive tree,new data structure,recursive probability tree,certain factorization,new structure,data structure | Data structure,Inference,Recursive Bayesian estimation,Theoretical computer science,Bayesian network,Weight-balanced tree,Artificial intelligence,Bayesian statistics,Recursion,Mathematics,Machine learning | Conference |
Volume | ISSN | ISBN |
5988 | 0302-9743 | 3-642-14263-X |
Citations | PageRank | References |
7 | 0.55 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrés Cano | 1 | 193 | 20.06 |
| Manuel Gómez-Olmedo | 2 | 61 | 11.98 |
| Serafín Moral | 3 | 1218 | 145.79 |
| Cora B. Pérez-Ariza | 4 | 19 | 2.96 |