Sciweavers

UAI
2003
13 years 6 months ago
Practically Perfect
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...
Christopher Meek, David Maxwell Chickering
UAI
2003
13 years 6 months ago
Marginalizing Out Future Passengers in Group Elevator Control
Group elevator scheduling is an NP-hard sequential decision-making problem with unbounded state spaces and substantial uncertainty. Decision-theoretic reasoning plays a surprising...
Daniel Nikovski, Matthew Brand
UAI
2003
13 years 6 months ago
On Local Optima in Learning Bayesian Networks
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...
Jens D. Nielsen, Tomás Kocka, José M...
UAI
2003
13 years 6 months ago
Systematic vs. Non-systematic Algorithms for Solving the MPE Task
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...
Radu Marinescu 0002, Kalev Kask, Rina Dechter
UAI
2003
13 years 6 months ago
A Linear Belief Function Approach to Portfolio Evaluation
We show how to use linear belief functions to represent market information and financial knowledge, including complete ignorance, statistical observations, subjective speculations...
Liping Liu, Catherine Shenoy, Prakash P. Shenoy
UAI
2003
13 years 6 months ago
Learning Riemannian Metrics
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...
Guy Lebanon
UAI
2003
13 years 6 months ago
Preference-based Graphic Models for Collaborative Filtering
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...
Rong Jin, Luo Si, ChengXiang Zhai
UAI
2003
13 years 6 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
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...
David Larkin
UAI
2003
13 years 6 months ago
Layerwidth: Analysis of a New Metric for Directed Acyclic Graphs
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 ...
Mark Hopkins