Semi-supervised online structure learning for composite event recognition

DOI10.1007/S10994-019-05794-2zbMATH Open1493.68308arXiv1803.00546OpenAlexW2964303294MaRDI QIDQ2425248FDOQ2425248

Authors: Evangelos Michelioudakis, Alexander Artikis, Georgios Paliouras 

Publication date: 26 June 2019

Published in: Machine Learning (Search for Journal in Brave)

Abstract: Online structure learning approaches, such as those stemming from Statistical Relational Learning, enable the discovery of complex relations in noisy data streams. However, these methods assume the existence of fully-labelled training data, which is unrealistic for most real-world applications. We present a novel approach for completing the supervision of a semi-supervised structure learning task. We incorporate graph-cut minimisation, a technique that derives labels for unlabelled data, based on their distance to their labelled counterparts. In order to adapt graph-cut minimisation to first order logic, we employ a suitable structural distance for measuring the distance between sets of logical atoms. The labelling process is achieved online (single-pass) by means of a caching mechanism and the Hoeffding bound, a statistical tool to approximate globally-optimal decisions from locally-optimal ones. We evaluate our approach on the task of composite event recognition by using a benchmark dataset for human activity recognition, as well as a real dataset for maritime monitoring. The evaluation suggests that our approach can effectively complete the missing labels and eventually, improve the accuracy of the underlying structure learning system.

Full work available at URL: https://arxiv.org/abs/1803.00546

Recommendations

• Online reliable semi-supervised learning on evolving data streams
• Online learning of event definitions
• Incremental learning of event definitions with inductive logic programming
• scientific article; zbMATH DE number 5957307
• Semi-supervised classification via simultaneous label and discriminant embedding estimation

zbMATH Keywords

semi-supervised learningevent recognitionevent calculusfirst-order logic distancegraph-cut minimisationonline structure learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27)

Cites Work

• Adaptive subgradient methods for online learning and stochastic optimization
• Probability Inequalities for Sums of Bounded Random Variables
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A logic-based calculus of events
• Markov logic networks
• Handbook of knowledge representation.
• Logical and Relational Learning
• Top-down induction of first-order logical decision trees
• Integrating naïve Bayes and FOIL
• Clausal discovery
• Introduction to semi-supervised learning.
• Title not available (Why is that?)
• Probabilistic Event Calculus for Event Recognition
• Semi-supervised online structure learning for composite event recognition
• Online learning of event definitions
• Parallel online learning of event definitions
• Iterative cross-training: An algorithm for learning from unlabeled Web pages
• Title not available (Why is that?)

Cited In (5)

• Making sense of sensory input
• A probabilistic interval-based event calculus for activity recognition
• Semi-supervised online structure learning for composite event recognition
• Online event recognition over noisy data streams
• Deep Fusion of Multiple Semantic Cues for Complex Event Recognition

Uses Software

• Aleph
• AdaGrad
• kFOIL

This page was built for publication: Semi-supervised online structure learning for composite event recognition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425248)