figshare
Browse
Figure-02.pdf (49.88 kB)

Betasort Algorithm (version 1, schematic description)

Download (0 kB)
Version 2 2015-04-03, 16:33
Version 1 2015-04-02, 17:29
figure
posted on 2015-04-03, 16:33 authored by Greg JensenGreg Jensen, Fabián Muñoz, Yelda Alkan, Vincent Ferrera, Herbert Terrace

A schematic overview of the betasort algorithm over the course of one trial. Rectangles refer to operations and diamonds to logical branches. Four phase are depicted: the choice policy (red), the relaxation of the contents of memory (green), the processing of explicit feedback (blue), and implicit inference (yellow). An updated version of this figure appears in Jensen et al. (2015) "Implicit value updating explains transitive inference performance: The betasort model," PLOS Computational Biology11, e1004523.

History

Usage metrics

    Licence

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC