Learning nonrecursive definitions of relations with LINUS
EWSL-91 Proceedings of the European working session on learning on Machine learning
Inverting entailment and Progol
Machine intelligence 14
Machine Learning - special issue on inductive logic programming
Using temporal logics to express search control knowledge for planning
Artificial Intelligence
Maintaining knowledge about temporal intervals
Communications of the ACM
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Discovery of Frequent Episodes in Event Sequences
Data Mining and Knowledge Discovery
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
DLAB: A Declarative Language Bias Formalism
ISMIS '96 Proceedings of the 9th International Symposium on Foundations of Intelligent Systems
Fluent Learning: Elucidating the Structure of Episodes
IDA '01 Proceedings of the 4th International Conference on Advances in Intelligent Data Analysis
Learning temporal, relational, force-dynamic event definitions from video
Eighteenth national conference on Artificial intelligence
Grounding the lexical semantics of verbs in visual perception using force dynamics and event logic
Journal of Artificial Intelligence Research
Relational learning via propositional algorithms: an information extraction case study
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Learning temporal, relational, force-dynamic event definitions from video
Eighteenth national conference on Artificial intelligence
A comprehensive study of visual event computing
Multimedia Tools and Applications
Hi-index | 0.00 |
We study the problem of supervised learning of event classes in a simple temporal event-description language. We give lower and upper bounds and algorithms for the subsumption and generalization problems for two expressively powerful subsets of this logic, and present a positive-examples-only specific-to-general learning method based on the resulting algorithms. We also present a polynomial-time computable "syntactic" subsumption test that implies semantic subsumption without being equivalent to it. A generalization algorithm based on syntactic subsumption can be used in place of semantic generalization to improve the asymptotic complexity of the resulting learning algorithm. A companion paper shows that our methods can be applied to duplicate the performance of human-coded concepts in the substantial application domain of video event recognition.