• Login
    View Item 
    •   Home
    • Research
    • Articles
    • View Item
    •   Home
    • Research
    • Articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguidePlumX LibguideSubmit an Item

    Statistics

    Display statistics

    Give the machine a hand: A Boolean time-based decision-tree template for rapidly finding animal behaviours in multisensor data

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    LoCoD_manuscript ver 6.pdf
    Size:
    748.2Kb
    Format:
    PDF
    Description:
    Accepted Manuscript
    Download
    Type
    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.
    KAUST Department
    Red Sea Research Center (RSRC)
    Date
    2018-08-20
    Online Publication Date
    2018-08-20
    Print Publication Date
    2018-11
    Permanent link to this record
    http://hdl.handle.net/10754/628840
    
    Metadata
    Show full item record
    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.
    Citation
    Wilson RP, Holton MD, di Virgilio A, Williams H, Shepard ELC, et al. (2018) Give the machine a hand: A Boolean time-based decision-tree template for rapidly finding animal behaviours in multisensor data. Methods in Ecology and Evolution. Available: http://dx.doi.org/10.1111/2041-210X.13069.
    Publisher
    Wiley
    Journal
    Methods in Ecology and Evolution
    DOI
    10.1111/2041-210X.13069
    Additional Links
    https://besjournals.onlinelibrary.wiley.com/doi/full/10.1111/2041-210X.13069
    Relations
    Is Supplemented By:
    • [Dataset]
      . DOI: 10.5061/dryad.56mh682 HANDLE: 10754/664193
    ae974a485f413a2113503eed53cd6c53
    10.1111/2041-210X.13069
    Scopus Count
    Collections
    Articles

    entitlement

     
    DSpace software copyright © 2002-2021  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.