UAI
2003
14 years 1 months ago
2003
We prove that perfect distributions exist when using a finite number of bits to represent the parameters of a Bayesian network. In addition, we provide an upper bound on the prob...
UAI
2003
14 years 1 months ago
2003
Group elevator scheduling is an NP-hard sequential decision-making problem with unbounded state spaces and substantial uncertainty. Decision-theoretic reasoning plays a surprising...
UAI
2003
14 years 1 months ago
2003
This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that i...
UAI
2003
14 years 1 months ago
2003
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
UAI
2003
14 years 1 months ago
2003
We show how to use linear belief functions to represent market information and financial knowledge, including complete ignorance, statistical observations, subjective speculations...
UAI
2003
14 years 1 months ago
2003
We consider the problem of learning a Riemannian metric associated with a given differentiable manifold and a set of points. Our approach to the problem involves choosing a metric...
UAI
2003
14 years 1 months ago
2003
Collaborative filtering is a very useful general technique for exploiting the preference patterns of a group of users to predict the utility of items to a particular user. Previou...
UAI
2003
14 years 1 months ago
2003
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
UAI
2003
14 years 1 months ago
2003
UAI
2003
14 years 1 months ago
2003
We analyze a new property of directed acyclic graphs (DAGs), called layerwidth, arising from a class of DAGs proposed by Eiter and Lukasiewicz. This class of DAGs permits certain ...