Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Discovering the Arrow of Time in Machine Learning

Version 1 : Received: 26 August 2021 / Approved: 27 August 2021 / Online: 27 August 2021 (11:23:50 CEST)

A peer-reviewed article of this Preprint also exists.

Kasmire, J.; Zhao, A. Discovering the Arrow of Time in Machine Learning. Information 2021, 12, 439. Kasmire, J.; Zhao, A. Discovering the Arrow of Time in Machine Learning. Information 2021, 12, 439.

Abstract

Machine learning (ML) is increasingly useful as data grows in volume and accessibility as it can perform tasks (e.g. categorisation, decision making, anomaly detection, etc.) through experience and without explicit instruction, even when the data are too vast, complex, highly variable, full of errors to be analysed in other ways , . Thus, ML is great for natural language, images, or other complex and messy data available in large and growing volumes. Selecting a ML algorithm depends on many factors as algorithms vary in supervision needed, tolerable error levels, and ability to account for order or temporal context, among many other things. Importantly, ML methods for explicitly ordered or time-dependent data struggle with errors or data asymmetry. Most data are at least implicitly ordered, potentially allowing a hidden `arrow of time’ to affect non-temporal ML performance. This research explores the interaction of ML and implicit order by training two ML algorithms on Twitter data before performing automatic classification tasks under conditions that balance volume and complexity of data. Results show that performance was affected, suggesting that researchers should carefully consider time when selecting appropriate ML algorithms, even when time is only implicitly included.

Keywords

machine learning; time; naive bayes classification; recurrent neural networks, Twitter; social media data; automatic classification

Subject

Computer Science and Mathematics, Artificial Intelligence and Machine Learning

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.