Access the full text.
Sign up today, get DeepDyve free for 14 days.
L. Rabiner (1984)
Combinatorial optimization:Algorithms and complexityIEEE Transactions on Acoustics, Speech, and Signal Processing, 32
Thomas Verma, J. Pearl (1990)
Equivalence and Synthesis of Causal ModelsProbabilistic and Causal Inference
J.-M. Bernard (2005)
An introduction to the imprecise Dirichlet model for multinomial dataInternational Journal of Approximate, 39
Francesca Molinari (2004)
Partial Identi…cation of Probability Distributions with Misclassi…ed Data
S. Kullback, R. Leibler (1951)
On Information and SufficiencyAnnals of Mathematical Statistics, 22
H. Yaman, O. Karasan, M. Pınar (2001)
The robust spanning tree problem with interval dataOper. Res. Lett., 29
David Wolf, D. Wolpert (1994)
Estimating functions of probability distributions from a finite set of samples.Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics, 52 6
(2001)
Robust learning with missing data
G. Kleiter (1999)
The posterior probability of Bayes nets with strong dependencesSoft Computing, 3
Marcus Hutter (2003)
Robust Estimators under the Imprecise Dirichlet Model
F. Jensen, Thomas Nielsen (2007)
Bayesian Networks as Classifiers
C. Craig, S. Kullback (1960)
Information Theory and StatisticsMathematics of Computation, 14
R. Fisher (1943)
The Advanced Theory of StatisticsNature, 152
David Wolf, D. Wolpert (1994)
Estimating Functions of Distributions from A Finite Set of Samples, Part 2: Bayes Estimators for Mutual Information, Chi-Squared, Covariance and other StatisticsarXiv: Cellular Automata and Lattice Gases
Jean-Marc Bernard (2005)
An introduction to the imprecise Dirichlet model for multinomial dataInt. J. Approx. Reason., 39
D.H. Wolpert, D.R. Wolf (1995)
Estimating functions of distributions from a finite set of samplesPhysical Review E, 52
C. Chow, Chao-Ming Liu (1968)
Approximating discrete probability distributions with dependence treesIEEE Trans. Inf. Theory, 14
Marcus Hutter, Marco Zaffalon (2004)
Distribution of mutual information from complete and incomplete dataComput. Stat. Data Anal., 48
P. Walley (1990)
Statistical Reasoning with Imprecise Probabilities
Marcus Hutter (2001)
Distribution of Mutual Information
Marco Zaffalon (2002)
Exact credal treatment of missing dataJournal of Statistical Planning and Inference, 105
Stegun (eds.): 1974, Handbook of Mathematical Functions
W. Perks (1947)
Some observations on inverse probabilityJ. Inst. Actuar, 73
H. Jeffreys (1946)
An invariant form for the prior probability in estimation problemsProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 186
Ionut Aron, Pascal Hentenryck (2004)
On the complexity of the robust spanning tree problem with interval dataOper. Res. Lett., 32
R. Montemanni (2006)
A Benders decomposition approach for the robust spanning tree problem with interval dataEur. J. Oper. Res., 174
W. Perks (1947)
Some observations on inverse probability including a new indifference ruleJournal of the Institute of Actuaries, 73
N. Friedman, D. Geiger, M. Goldszmidt (1997)
Bayesian Network ClassifiersMachine Learning, 29
J. Pearl (1991)
Probabilistic reasoning in intelligent systems - networks of plausible inference
(1988)
Perks . Some observations on inverse probability
Jean-Marc Bernard (2001)
Non-parametric Inference about an Unknown Mean using the Imprecise Dirichlet Model
M. Abramowitz, I. Stegun, David Miller (1965)
Handbook of Mathematical Functions With Formulas, Graphs and Mathematical Tables (National Bureau of Standards Applied Mathematics Series No. 55)Journal of Applied Mechanics, 32
J. Haldane (1948)
THE PRECISION OF OBSERVED VALUES OF SMALL FREQUENCIESBiometrika, 35
J. Kruskal (1956)
On the shortest spanning subtree of a graph and the traveling salesman problem, 7
P. Walley (1996)
Inferences from Multinomial Data: Learning About a Bag of MarblesJournal of the royal statistical society series b-methodological, 58
C. Manski (2003)
Partial Identification of Probability Distributions
This paper is concerned with the reliable inference of optimal tree-approximations to the dependency structure of an unknown distribution generating data. The traditional approach to the problem measures the dependency strength between random variables by the index called mutual information. In this paper reliability is achieved by Walley's imprecise Dirichlet model, which generalizes Bayesian learning with Dirichlet priors. Adopting the imprecise Dirichlet model results in posterior interval expectation for mutual information, and in a set of plausible trees consistent with the data. Reliable inference about the actual tree is achieved by focusing on the substructure common to all the plausible trees. We develop an exact algorithm that infers the substructure in time O(m 4), m being the number of random variables. The new algorithm is applied to a set of data sampled from a known distribution. The method is shown to reliably infer edges of the actual tree even when the data are very scarce, unlike the traditional approach. Finally, we provide lower and upper credibility limits for mutual information under the imprecise Dirichlet model. These enable the previous developments to be extended to a full inferential method for trees.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Jan 12, 2006
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.