Results 1  10
of
981,121
On the robustness of Most Probable Explanations
 In Proceedings of the Twenty Second Conference on Uncertainty in Artificial Intelligence
"... In Bayesian networks, a Most Probable Explanation (MPE) is a complete variable instantiation with the highest probability given the current evidence. In this paper, we discuss the problem of finding robustness conditions of the MPE under single parameter changes. Specifically, we ask the question: H ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
In Bayesian networks, a Most Probable Explanation (MPE) is a complete variable instantiation with the highest probability given the current evidence. In this paper, we discuss the problem of finding robustness conditions of the MPE under single parameter changes. Specifically, we ask the question
Study of the Most Probable Explanation in Hybrid Bayesian Networks
"... In addition to computing the posterior distributions for hidden variables in Bayesian networks, one other important inference task is to find the most probable explanation (MPE). MPE provides the most likely configurations to explain away the evidence and helps to manage hypotheses for decision mak ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In addition to computing the posterior distributions for hidden variables in Bayesian networks, one other important inference task is to find the most probable explanation (MPE). MPE provides the most likely configurations to explain away the evidence and helps to manage hypotheses for decision
Eliciting selfexplanations improves understanding
 Cognitive Science
, 1994
"... Learning involves the integration of new information into existing knowledge. Generoting explanations to oneself (selfexplaining) facilitates that integration process. Previously, selfexplanation has been shown to improve the acquisition of problemsolving skills when studying workedout examples. ..."
Abstract

Cited by 556 (22 self)
 Add to MetaCart
Learning involves the integration of new information into existing knowledge. Generoting explanations to oneself (selfexplaining) facilitates that integration process. Previously, selfexplanation has been shown to improve the acquisition of problemsolving skills when studying workedout examples
Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations
, 2005
"... How do real graphs evolve over time? What are “normal” growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large network, or in a very small number of snapshots; these include hea ..."
Abstract

Cited by 534 (48 self)
 Add to MetaCart
How do real graphs evolve over time? What are “normal” growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large network, or in a very small number of snapshots; these include heavy tails for in and outdegree distributions, communities, smallworld phenomena, and others. However, given the lack of information about network evolution over long periods, it has been hard to convert these findings into statements about trends over time. Here we study a wide range of real graphs, and we observe some surprising phenomena. First, most of these graphs densify over time, with the number of edges growing superlinearly in the number of nodes. Second, the average distance between nodes often shrinks over time, in contrast to the conventional wisdom that such distance parameters should increase slowly as a function of the number of nodes (like O(log n) orO(log(log n)). Existing graph generation models do not exhibit these types of behavior, even at a qualitative level. We provide a new graph generator, based on a “forest fire” spreading process, that has a simple, intuitive justification, requires very few parameters (like the “flammability” of nodes), and produces graphs exhibiting the full range of properties observed both in prior work and in the present study.
By Force of Habit: A ConsumptionBased Explanation of Aggregate Stock Market Behavior
, 1999
"... We present a consumptionbased model that explains a wide variety of dynamic asset pricing phenomena, including the procyclical variation of stock prices, the longhorizon predictability of excess stock returns, and the countercyclical variation of stock market volatility. The model captures much of ..."
Abstract

Cited by 1427 (68 self)
 Add to MetaCart
We present a consumptionbased model that explains a wide variety of dynamic asset pricing phenomena, including the procyclical variation of stock prices, the longhorizon predictability of excess stock returns, and the countercyclical variation of stock market volatility. The model captures much of the history of stock prices from consumption data. It explains the short and longrun equity premium puzzles despite a low and constant riskfree rate. The results are essentially the same whether we model stocks as a claim to the consumption stream or as a claim to volatile dividends poorly correlated with consumption. The model is driven by an independently and identically distributed consumption growth process and adds a slowmoving external habit to the standard power utility function. These features generate slow countercyclical variation in risk premia. The model posits a fundamentally novel description of risk premia: Investors fear stocks primarily because they do poorly in recessions unrelated to the risks of longrun average consumption growth.
Relative Income, Happiness and Utility: An Explanation for the Easterlin Paradox and Other Puzzles
, 2007
"... ..."
BestFirst AND/OR Search for Most Probable Explanations
 UAI
, 2007
"... The paper evaluates the power of bestfirst search over AND/OR search spaces for solving the Most Probable Explanation (MPE) task in Bayesian networks. The main virtue of the AND/OR representation of the search space is its sensitivity to the structure of the problem, which can translate into signif ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
The paper evaluates the power of bestfirst search over AND/OR search spaces for solving the Most Probable Explanation (MPE) task in Bayesian networks. The main virtue of the AND/OR representation of the search space is its sensitivity to the structure of the problem, which can translate
Results 1  10
of
981,121