Abstract | ||
---|---|---|
We show how to build an associative memory from a finite list of examples. By means of a fully-blown example, we demostrate how a probabilistic Bayesian factor graph can integrate naturally the discrete information contained in the list with smooth inference. |
Year | DOI | Venue |
---|---|---|
2011 | 10.3233/978-1-60750-972-1-97 | Frontiers in Artificial Intelligence and Applications |
Keywords | Field | DocType |
Bayesian Networks,Artificial Intelligence,Propagation of Belief | Factor graph,Frequentist inference,Content-addressable memory,Bayesian inference,Pattern recognition,Inference,Computer science,Artificial intelligence,Probabilistic logic,Machine learning,Bayesian probability | Conference |
Volume | ISSN | Citations |
234 | 0922-6389 | 0 |
PageRank | References | Authors |
0.34 | 5 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Francesco Palmieri | 1 | 0 | 0.34 |
Domenico Ciuonzo | 2 | 599 | 42.44 |
Davide Mattera | 3 | 199 | 35.08 |
Gianmarco Romano | 4 | 205 | 16.19 |
Pierluigi Salvo Rossi | 5 | 328 | 27.27 |