{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/semi-supervised-online-structure-learning-for","title":"Semi-Supervised Online Structure Learning for Composite Event Recognition","arxiv_id":"1803.00546","date":"2018-03-01","proceeding":null,"authors":["Evangelos Michelioudakis","Alexander Artikis","Georgios Paliouras"],"abstract":"Online structure learning approaches, such as those stemming from Statistical\nRelational Learning, enable the discovery of complex relations in noisy data\nstreams. However, these methods assume the existence of fully-labelled training\ndata, which is unrealistic for most real-world applications. We present a novel\napproach for completing the supervision of a semi-supervised structure learning\ntask. We incorporate graph-cut minimisation, a technique that derives labels\nfor unlabelled data, based on their distance to their labelled counterparts. In\norder to adapt graph-cut minimisation to first order logic, we employ a\nsuitable structural distance for measuring the distance between sets of logical\natoms. The labelling process is achieved online (single-pass) by means of a\ncaching mechanism and the Hoeffding bound, a statistical tool to approximate\nglobally-optimal decisions from locally-optimal ones. We evaluate our approach\non the task of composite event recognition by using a benchmark dataset for\nhuman activity recognition, as well as a real dataset for maritime monitoring.\nThe evaluation suggests that our approach can effectively complete the missing\nlabels and eventually, improve the accuracy of the underlying structure\nlearning system.","url_abs":"http://arxiv.org/abs/1803.00546v2","url_pdf":"http://arxiv.org/pdf/1803.00546v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"semi-supervised-online-structure-learning-for","repo_url":"https://github.com/nkatzz/OLED","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null},{"paper_slug":"semi-supervised-online-structure-learning-for","repo_url":"https://github.com/anskarl/LoMRF","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"activity-recognition","task_name":"Activity Recognition"},{"task_slug":"human-activity-recognition","task_name":"Human Activity Recognition"},{"task_slug":"missing-labels","task_name":"Missing Labels"},{"task_slug":"relational-reasoning","task_name":"Relational Reasoning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"nkatzz/OLED","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"anskarl/LoMRF","kind":"named_in_paper","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"c47fb3028775e229c7a239516761316daf61992162d7b56b29100e7525a17f61","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}