Sciweavers

UAI
2004
13 years 6 months ago
A Hierarchical Graphical Model for Record Linkage
The task of matching co-referent records is known among other names as record linkage. For large record-linkage problems, often there is little or no labeled data available, but u...
Pradeep D. Ravikumar, William W. Cohen
UAI
2004
13 years 6 months ago
Active Model Selection
Classical learning assumes the learner is given a labeled data sample, from which it learns a model. The field of Active Learning deals with the situation where the learner begins...
Omid Madani, Daniel J. Lizotte, Russell Greiner
UAI
2004
13 years 6 months ago
Case-Factor Diagrams for Structured Probabilistic Modeling
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Bo...
David A. McAllester, Michael Collins, Fernando Per...
UAI
2004
13 years 6 months ago
Factored Latent Analysis for far-field Tracking Data
This paper uses Factored Latent Analysis (FLA) to learn a factorized, segmental representation for observations of tracked objects over time. Factored Latent Analysis is latent cl...
Chris Stauffer
UAI
2004
13 years 6 months ago
On-line Prediction with Kernels and the Complexity Approximation Principle
The paper describes an application of Aggregating Algorithm to the problem of regression. It generalizes earlier results concerned with plain linear regression to kernel technique...
Alexander Gammerman, Yuri Kalnishkan, Vladimir Vov...
UAI
2004
13 years 6 months ago
Computing Best-Response Strategies in Infinite Games of Incomplete Information
We describe an algorithm for computing bestresponse strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents...
Daniel M. Reeves, Michael P. Wellman
UAI
2004
13 years 6 months ago
Discretized Approximations for POMDP with Average Cost
In this paper, we propose a new lower approximation scheme for POMDP with discounted and average cost criterion. The approximating functions are determined by their values at a fi...
Huizhen Yu, Dimitri P. Bertsekas
UAI
2004
13 years 6 months ago
Evidence-invariant Sensitivity Bounds
The sensitivities revealed by a sensitivity analysis of a probabilistic network typically depend on the entered evidence. For a real-life network therefore, the analysis is perfor...
Silja Renooij, Linda C. van der Gaag
UAI
2001
13 years 6 months ago
Using Temporal Data for Making Recommendations
Andrew Zimdars, David Maxwell Chickering, Christop...