Incremental learning of event definitions with inductive logic programming
From MaRDI portal
Abstract: Event recognition systems rely on properly engineered knowledge bases of event definitions to infer occurrences of events in time. The manual development of such knowledge is a tedious and error-prone task, thus event-based applications may benefit from automated knowledge construction techniques, such as Inductive Logic Programming (ILP), which combines machine learning with the declarative and formal semantics of First-Order Logic. However, learning temporal logical formalisms, which are typically utilized by logic-based Event Recognition systems is a challenging task, which most ILP systems cannot fully undertake. In addition, event-based data is usually massive and collected at different times and under various circumstances. Ideally, systems that learn from temporal data should be able to operate in an incremental mode, that is, revise prior constructed knowledge in the face of new evidence. Most ILP systems are batch learners, in the sense that in order to account for new evidence they have no alternative but to forget past knowledge and learn from scratch. Given the increased inherent complexity of ILP and the volumes of real-life temporal data, this results to algorithms that scale poorly. In this work we present an incremental method for learning and revising event-based knowledge, in the form of Event Calculus programs. The proposed algorithm relies on abductive-inductive learning and comprises a scalable clause refinement methodology, based on a compressive summarization of clause coverage in a stream of examples. We present an empirical evaluation of our approach on real and synthetic data from activity recognition and city transport applications.
Recommendations
Cites work
- A logic-based calculus of events
- A restarted strategy for efficient subsumption testing
- Abductive Logic Programming
- AI*IA 2005: Advances in Artificial Intelligence
- An inductive approach for modal transition system refinement
- Deriving non-Zeno behaviour models from goal models using ILP
- Fast theta-subsumption with constraint satisfaction algorithms
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 1950778 (Why is no real title available?)
- scientific article; zbMATH DE number 1759249 (Why is no real title available?)
- scientific article; zbMATH DE number 1759254 (Why is no real title available?)
- scientific article; zbMATH DE number 1926614 (Why is no real title available?)
- scientific article; zbMATH DE number 1877042 (Why is no real title available?)
- scientific article; zbMATH DE number 1877044 (Why is no real title available?)
- scientific article; zbMATH DE number 1890617 (Why is no real title available?)
- ILP turns 20. Biography and future challenges
- Induction from answer sets in nonmonotonic logic programs
- Induction of the effects of actions by monotonic methods.
- Induction on Failure: Learning Connected Horn Theories
- Inductive Logic Programming
- Inductive Logic Programming
- Inductive logic programming as abductive search
- Inductive Logic Programming: Theory and methods
- Iterated belief revision, revised
- Learning through hypothesis refinement using answer set programming
- Meta-interpretive learning: application to grammatical inference
- Multistrategy theory revision: Induction and abduction in INTHELEX
- Nonmonotonic abductive inductive learning
- Structured machine learning: the next ten years
- Subsumer: a Prolog -subsumption engine
- Using the bottom clause and mode declarations in FOL theory revision from examples
Cited in
(29)- Best-effort inductive logic programming via fine-grained cost-based hypothesis generation. The Inspire system at the inductive logic programming competition
- The complexity and generality of learning answer set programs
- A probabilistic interval-based event calculus for activity recognition
- Revising event calculus theories to recover from unexpected observations
- Inductive learning of answer set programs for autonomous surgical task planning. Application to a training task for surgeons
- Learning explanations for biological feedback with delays using an event calculus
- Learning any memory-less discrete semantics for dynamical systems represented by logic programs
- Inductive logic programming at 30
- Parallel online learning of event definitions
- Making sense of sensory input
- Semi-supervised online structure learning for composite event recognition
- Learning through hypothesis refinement using answer set programming
- Probabilistic event calculus for event recognition
- scientific article; zbMATH DE number 1946859 (Why is no real title available?)
- Incremental and iterative learning of answer set programs from mutually distinct examples
- A probabilistic logic programming event calculus
- Online learning of event definitions
- Iterative learning of answer set programs from context dependent examples
- scientific article; zbMATH DE number 7453129 (Why is no real title available?)
- scientific article; zbMATH DE number 7455700 (Why is no real title available?)
- Incremental Event Calculus for Run-Time Reasoning
- Learning effect axioms via probabilistic logic programming
- Learning relational event models from video
- Data-Driven Revision of Conditional Norms in Multi-Agent Systems
- Rule Induction and Reasoning over Knowledge Graphs
- Logic-based learning of answer set programs
- Explainable and interpretable machine learning and data mining
- Conflict-driven inductive logic programming
- Online learning probabilistic event calculus theories in answer set programming
This page was built for publication: Incremental learning of event definitions with inductive logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q747281)
