Darwinian network
A Darwinian network (DN),[1] proposed in 2015 by,[2] is a probabilistic graphical model to simplify working with Bayesian networks.[3]
Rather than modelling the variables in a problem domain, DNs represent the probability tables in the model. The graphical manipulation of the tables then takes on a biological feel, where a CPT is viewed as the novel representation of a population using both combative traits (coloured clear) and docile traits (coloured dark).
DNs can unify modeling and reasoning tasks into a single platform. DNs can represent exact inference using either variable elimination[4] or arc-reversal,[5] lazy propagation,[6] as well as how DNs can represent testing independencies. Adaptation and evolution are used to represent the testing of independencies and inference, respectively.
References
- ↑ http://www.darwiniannetworks.com/
- ↑ Butz, C. J.; Oliveira, J. S.; and dos Santos, A. E. 2015. Darwinian networks. In Proceedings of the Twenty-Eighth Canadian Artificial Intelligence Conference.
- ↑ Pearl, J. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann.
- ↑ Zhang, N.L., Poole, D.: A simple approach to Bayesian network computations. In: Tenth Canadian Artificial Intelligence Conference. pp. 171–178 (1994)
- ↑ Olmsted, S.: On Representing and Solving Decision Problems. Ph.D. thesis, Stanford University (1983)
- ↑ Madsen, A. L., and Jensen, F. V. 1999. Lazy propagation: A junction tree inference algorithm based on lazy evaluation. Artificial Intelligence 113(1-2):203–245.
This article "Darwinian network" is from Wikipedia. The list of its authors can be seen in its historical. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.
