{"type":"ScholarlyArticle","title":"A Simple-Transition Model for Relational Sequences","authors":[{"name":"Alan Fern","slug":"alan-fern","given":"Alan","family":"Fern","affiliation":""}],"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 statetransition 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 practical approach to SSM based on logical reasoning and bounded search. We present a learning method that discovers relational constraints using CLAUDIEN [De Raedt and Dehaspe, 1997] and then tunes their weights using perceptron updates. Experiments in relational video interpretation show that our learned models improve on a variety of competitors.","doi":null,"url":"https://ijcai.org/proceedings/2005/31","pdf":"https://ijcai.org/proceedings/2005/0031.pdf","markdown":"https://ijcai.org/proceedings/2005/31.md","bibtex":"https://ijcai.org/proceedings/2005/bibtex/31","volume":{"slug":"2005","title":"Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2005","url":"https://ijcai.org/proceedings/2005/","year":2005,"location":"Edinburgh, Scotland, UK","dates":"","editors":"","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":31,"pages":{"first":696,"last":700},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}