{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T12:41:25Z","timestamp":1771504885691,"version":"3.50.1"},"reference-count":29,"publisher":"Cambridge University Press (CUP)","issue":"5-6","license":[{"start":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T00:00:00Z","timestamp":1476403200000},"content-version":"unspecified","delay-in-days":43,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2016,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Systems for symbolic event recognition infer occurrences of events in time using a set of event definitions in the form of first-order rules. The Event Calculus is a temporal logic that has been used as a basis in event recognition applications, providing among others, direct connections to machine learning, via Inductive Logic Programming (ILP). We present an ILP system for online learning of Event Calculus theories. To allow for a single-pass learning strategy, we use the Hoeffding bound for evaluating clauses on a subset of the input stream. We employ a decoupling scheme of the Event Calculus axioms during the learning process, that allows to learn each clause in isolation. Moreover, we use abductive-inductive logic programming techniques to handle unobserved target predicates. We evaluate our approach on an activity recognition application and compare it to a number of batch learning techniques. We obtain results of comparable predicative accuracy with significant speed-ups in training time. We also outperform hand-crafted rules and match the performance of a sound incremental learner that can only operate on noise-free datasets.<\/jats:p>","DOI":"10.1017\/s1471068416000260","type":"journal-article","created":{"date-parts":[[2016,10,15]],"date-time":"2016-10-15T21:28:20Z","timestamp":1476566900000},"page":"817-833","source":"Crossref","is-referenced-by-count":13,"title":["Online learning of event definitions"],"prefix":"10.1017","volume":"16","author":[{"given":"NIKOS","family":"KATZOURIS","sequence":"first","affiliation":[]},{"given":"ALEXANDER","family":"ARTIKIS","sequence":"additional","affiliation":[]},{"given":"GEORGIOS","family":"PALIOURAS","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2016,10,14]]},"reference":[{"key":"S1471068416000260_ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037227"},{"key":"S1471068416000260_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45628-7_16"},{"key":"S1471068416000260_ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.jal.2008.10.007"},{"key":"S1471068416000260_ref17","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"S1471068416000260_ref9","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347107"},{"key":"S1471068416000260_ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23544-3_36"},{"key":"S1471068416000260_ref3","first-page":"31","volume-title":"Inductive Logic Programming","author":"Athakravi","year":"2013"},{"key":"S1471068416000260_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(98)00034-4"},{"key":"S1471068416000260_ref21","first-page":"101","volume-title":"Inductive Logic Programming","author":"Jensen","year":"2002"},{"key":"S1471068416000260_ref5","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009867806624"},{"key":"S1471068416000260_ref18","unstructured":"Hulten G. , Domingos P. and Abe Y. 2003. Mining massive relational databases. In Proceedings of the IJCAI-2003 Workshop on Learning Statistical Models from Relational Data. 53\u201360."},{"key":"S1471068416000260_ref15","unstructured":"Gama J. , Kosina P. , et al. 2011. Learning decision rules from data streams. In IJCAI Proceedings-International Joint Conference on Artificial Intelligence, Vol. 22. Citeseer, 1255."},{"key":"S1471068416000260_ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2699916"},{"key":"S1471068416000260_ref11","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007638124237"},{"key":"S1471068416000260_ref2","doi-asserted-by":"publisher","DOI":"10.1142\/S021821301000011X"},{"key":"S1471068416000260_ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037383"},{"key":"S1471068416000260_ref12","volume-title":"Event Processing in Action","author":"Etzion","year":"2010"},{"key":"S1471068416000260_ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1529282.1529610"},{"key":"S1471068416000260_ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-015-5512-1"},{"key":"S1471068416000260_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68856-3"},{"key":"S1471068416000260_ref10","unstructured":"Domingos P. and Hulten G. 2001. A general method for scaling up machine learning algorithms and its application to clustering. In ICML, Vol. 1. 106\u2013113."},{"key":"S1471068416000260_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-73679-4"},{"key":"S1471068416000260_ref13","doi-asserted-by":"publisher","DOI":"10.1201\/EBK1439826119"},{"key":"S1471068416000260_ref16","doi-asserted-by":"publisher","DOI":"10.2200\/S00457ED1V01Y201211AIM019"},{"key":"S1471068416000260_ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2356476"},{"key":"S1471068416000260_ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF01007461"},{"key":"S1471068416000260_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04180-8_54"},{"key":"S1471068416000260_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-011-0406-4"},{"key":"S1471068416000260_ref20","unstructured":"Jensen D. 1999. Statistical challenges to inductive inference in linked data. In AISTATS."}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068416000260","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T00:40:51Z","timestamp":1555634451000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068416000260\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9]]},"references-count":29,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["S1471068416000260"],"URL":"https:\/\/doi.org\/10.1017\/s1471068416000260","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9]]}}}