Coherent Knowledge Processing at Maximum Entropy by SPIRIT
暂无分享,去创建一个
[1] Uue Kjjrull. Triangulation of Graphs { Algorithms Giving Small Total State Space Triangulation of Graphs { Algorithms Giving Small Total State Space , 1990 .
[2] Robert E. Tarjan,et al. Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..
[3] I. Csiszár. $I$-Divergence Geometry of Probability Distributions and Minimization Problems , 1975 .
[4] Bo Thiesson,et al. Diagnostic systems by model selection: a case study , 1994 .
[5] Petr Hájek,et al. Uncertain information processing in expert systems , 1992 .
[6] Judea Pearl,et al. Probabilistic reasoning in intelligent systems , 1988 .
[7] Nils J. Nilsson,et al. Probabilistic Logic * , 2022 .
[8] Jeff B. Paris,et al. A note on the inevitability of maximum entropy , 1990, Int. J. Approx. Reason..
[9] J. N. R. Jeffers,et al. Graphical Models in Applied Multivariate Statistics. , 1990 .
[10] Richard E. Neapolitan,et al. Probabilistic reasoning in expert systems - theory and algorithms , 2012 .
[11] David J. Spiegelhalter,et al. Local computations with probabilities on graphical structures and their application to expert systems , 1990 .
[12] Peter C. Cheeseman,et al. A Method of Computing Generalized Bayesian Probability Values for Expert Systems , 1983, IJCAI.
[13] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.
[14] Frank Jensen,et al. Optimal junction Trees , 1994, UAI.
[15] Rodney W. Johnson,et al. Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy , 1980, IEEE Trans. Inf. Theory.