A simple-transition model for relational sequences

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 696-701

  Fern, Alan ^a  

^a Oregon State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED SEARCH; LEARNING METHODS; LOGICAL CONSTRAINTS; LOGICAL REASONING; RELATIONAL CONSTRAINT; STATE SEQUENCES; VIDEO INTERPRETATION; WEIGHTED CONSTRAINTS;

ARTIFICIAL INTELLIGENCE;

EID: 79851511810     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. D. Amit, K. Wong, and C. Campbell. Perceptron learning with sign-constrained weights. Journal of Physics A: Mathematical and General, 22:2039-2045, 1989.
2. M. Collins. Discriminative training methods for hidden Markov models: Theory and experiments with the perceptron algorithm. In Conf. on Empirical Methods in NLP, 2002.
3. L. De Raedt and L. Dehaspe. Clausal discovery. Machine Learning, 26:99-146, 1997. (Pubitemid 127507163)
4. L. De Raedt and K. Kersting. Probabilistic logic learning. ACM-SIGKDD Explor., 5, 2004.
5. R. Dechter. Bucket elimination: A unifying framework for reasoning. AIJ, 113(1-2), 1999.
6. A. Fern and R. Givan. Relational sequential inference with reliable observations. In ICML, 2004.
7. Alan Fern. Learning Models and Formulas of a Temporal Event Logic. PhD thesis, Purdue University, August 2004.
8. G. Forney. The Viterbi algorithm. Proceedings of the IEEE, 61(3):268-278, 1973.
9. B. Jaumard and B. Simeone. On the complexity of the maximum satisfiability problem for Horn formulas. Information Processing Letters, 26:1-4, 1987.
10. Y. Jiang, H. Kautz, and B. Selman. Solving problems with hard and soft constraints using a stochastic algorithm for MAX-SAT. In Joint Workshop on AI and OR, 1995.
11. J. Lafferty, A. McCallum, and F. Pereira. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In ICML, pages 282-289, 2001.
12. Kevin Murphy. Dynamic Bayesian Networks: Representation, Inference and Learning. PhD thesis, UC Berkeley, Computer Science, July 2002.
13. M. Ostendorf, V. Digalakis, and O. Kimball. From HMMs to segment models: a unified view of stochastic modeling for speech recognition. IEEE Trans. on Speech and Audio Proc., 1996.
14. Christos H. Papadimitriou. Computational Complexity. Addison-Wesley Publishing, 1995.
15. F. Rosenblatt. The Perceptron: A probabilistic model for information storage and organization in the brain. Psychological Review, 65:386-408, 1958.
16. S. Sanghai, P. Domingos, and D. Weld. Dynamic probabilistic relational models. In IJCAI, 2003.
17. J. Siskind. Grounding lexical semantics of verbs in visual perception using force dynamics and event logic. JAIR, 15:31-90, 2001.
18. J. Siskind. Reconstructing force-dynamic models from video sequences. AIJ, 151(1-2):91-154, 2003.
19. B. Taskar, P. Abbeel, and D. Koller. Discriminative probabilistic models for relational data. In UAI, 2002.
20. O. Veksler. Efficient Graph-based Energy Minimization Methods in Computer Vision. PhD thesis, Cornell University, Computer Science, July 1999.
21. M. Wellman, J. Breese, and R. Goldman. From knowledge bases to decision models. Knowledge Engineering Review, 5, 1992.