Preprint
Article

What Should I Notice? Using Alogithmic Information Theory to Evaluate the Memorability of Events in Smart Homes

Altmetrics

Downloads

157

Views

223

Comments

0

A peer-reviewed article of this preprint also exists.

Submitted:

03 February 2022

Posted:

04 February 2022

You are already at the latest version

Alerts
Abstract
With the increasing number of connected devices, complex systems such as smart homes record a multitude of events of various types, magnitude and characteristics. Current systems struggle to identify which events can be considered more memorable than others. In contrast, human are able to quickly categorize some events as being more “memorable” than others. They do so without relying on knowledge of the system’s inner working or large previous datasets. Having this ability would allow the system to: i) identify and summarize a situation to the user by presenting only memorable events; ii) suggest the most memorable events as possible hypotheses in an abductive inference process. Our proposal is to use Algorithmic Information Theory to define a “memorability” score by retrieving events using predicative filters. We use smart-home examples to illustrate how our theoretical approach can be implemented in practice.
Keywords: 
Subject: Computer Science and Mathematics  -   Data Structures, Algorithms and Complexity
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated