Relational Sequences (draft) Alan Fern Electrical and Computer Engineering,...  Home/Search
Context
Related
| purdue.edu/~afern/webst...stmdraft.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: purdue.edu/~afern/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We use "nearly sound" logical constraints to infer hidden states of relational processes. We introduce a simple-transition cost model, which is parameterized by weighted constraints and a state-transition cost. Inference for this model, i.e. finding a minimum-cost state sequence, reduces to a single-state minimization (SSM) problem. For relational Horn constraints, we give a practically efficient approach to SSM based on logical reasoning and bounded search. We present a learning method... (Update)
Similar documents based on text: More All
0.1: Learning Domain-Specific Control Knowledge from Random Walks.. - Alan Fern And (2004) (Correct)
0.1: Dynamic Feature Selection for Hardware Prediction - Fern, Givan, Falsafi.. (2000) (Correct)
0.1: Approximate Policy Iteration with a Policy Language Bias - Fern, Yoon, Givan (2003) (Correct)
BibTeX entry: (Update)
@misc{ draft-simpletransition,
author = "Relational Sequences Draft",
title = "A Simple-Transition Model for",
url = "citeseer.ist.psu.edu/699301.html" }
Citations (may not include all citations):313 The Viterbi algorithm (context) - Forney - 1973
150 Computational Complexity (context) - Papadimitriou - 1995
148 The Perceptron: A probabilistic model for information storag.. (context) - Rosenblatt - 1958
95 Bucket elimination: A unifying framework for reasoning - Dechter - 1999
58 Dynamic Bayesian Networks: Representation (context) - Murphy - 2002
55 Conditional random fields: Probabilistic models for segmenti.. - Lafferty, McCallum et al. - 2001
38 Clausal discovery - De Raedt, Dehaspe - 1997
30 Discriminative training methods for hidden Markov models: Th.. - Collins - 2002
24 Discriminative probabilistic models for relational data (context) - Taskar, Abbeel et al.
23 From HMMs to segment models: a unified view of stochastic mo.. - Ostendorf, Digalakis et al. - 1996
15 Solving problems with hard and soft constraints using a stoc.. - Jiang, Kautz et al. - 1995
9 Grounding lexical semantics of verbs in visual perception us.. (context) - Siskind - 2001
8 Dynamic probabilistic relational models - Sanghai, Domingos et al.
7 Efficient Graph-based Energy Minimization Methods in Compute.. - Veksler - 1999
5 the complexity of the maximum satisfiability problem for Hor.. (context) - Jaumard, Simeone - 1987
2 Reconstructing force-dynamic models from video sequences (context) - Siskind
2 Probabilistic logic learning - De Raedt, Kersting - 2004
1 Perceptron learning with sign-constrained weights (context) - Amit, Wong et al. - 2039
1 Relational sequential inference with reliable observations - Fern, Givan
Documents on the same site (http://min.ecn.purdue.edu/~afern/): More
Approximate Policy Iteration with a Policy Language Bias - Fern, Yoon, Givan (2003) (Correct)
Relational Sequential Inference with Reliable Observations - Fern, Givan (Correct)
Dynamic Feature Selection for Hardware Prediction - Alan Fern Robert (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC