Name
Abstract | ||
|---|---|---|
AbstractRlatecursive probability trees RPTs offer a flexible framework for representing the probabilistic information in probabilistic graphical models. This structure is able to provide a compact representation of the distribution it encodes by specifying most of the types of independencies that can be found in a probability distribution. The real benefit of this representation heavily depends on the ability of learning such independencies from data. In this paper, we expand our approach at learning RPTs from data by extending an existing greedy methodology for retrieving small RPTs from probabilistic potentials. We test the performance of the algorithm by learning from different databases, both real and handcrafted, and we compare the performance for different databases sizes. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1002/int.21703 | Periodicals |
DocType | Volume | Issue |
Journal | 30 | 3 |
ISSN | Citations | PageRank |
0884-8173 | 0 | 0.34 |
References | Authors | |
7 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrés Cano | 1 | 193 | 20.06 |
| Manuel Gómez-Olmedo | 2 | 61 | 11.98 |
| Cora B. Pérez-Ariza | 3 | 19 | 2.96 |