Give the machine a hand: A Boolean time‐based decision‐tree template for rapidly finding animal behaviours in multisensor data. Issue 11 (20th August 2018)

• Record Type: Journal Article
• Authors: Wilson, Rory P.; Holton, Mark D.; di Virgilio, Agustina; Williams, Hannah; Shepard, Emily L. C.; Lambertucci, Sergio; Quintana, Flavio; Sala, Juan E.; Balaji, Bharathan; Lee, Eun Sun; Srivastava, Mani; Scantlebury, D. Michael; Duarte, Carlos M.
• Editors: Codling, Edward
• Is Part Of: Methods in ecology and evolution. Volume 9:Issue 11(2018)
• Page Start: 2206
• Page End: 2215
• Publication Date: 2018-08-20
• Subjects: accelerometer -- behaviour -- behaviour identification -- bioinformatics -- software; Ecology -- Periodicals; Evolution -- Periodicals; 577
• DOI: 10.1111/2041-210X.13069
• Languages: English
• ISSNs: 2041-210X

Abstract

Abstract: The development of multisensor animal‐attached tags, recording data at high frequencies, has enormous potential in allowing us to define animal behaviour. The high volumes of data, are pushing us towards machine‐learning as a powerful option for distilling out behaviours. However, with increasing parallel lines of data, systems become more likely to become processor limited and thereby take appreciable amounts of time to resolve behaviours. We suggest a Boolean approach whereby critical changes in recorded parameters are used as sequential templates with defined flexibility (in both time and degree) to determine individual behavioural elements within a behavioural sequence that, together, makes up a single, defined behaviour. We tested this approach, and compared it to a suite of other behavioural identification methods, on a number of behaviours from tag‐equipped animals; sheep grazing, penguins walking, cheetah stalking prey and condors thermalling. Overall behaviour recognition using our new approach was better than most other methods due to; (1) its ability to deal with behavioural variation and (2) the speed with which the task was completed because extraneous data are avoided in the process. We suggest that this approach is a promising way forward in an increasingly data‐rich environment and that workers sharing algorithms can provide a powerful library for the benefit of all involved in such work.