Skip to main content

Discovering Cognitive Stages in M/EEG Data to Inform Cognitive Models

  • Chapter
  • First Online:
An Introduction to Model-Based Cognitive Neuroscience

Abstract

Computational cognitive models aim to simulate the cognitive processes humans go through when performing a particular task. In this chapter, we discuss a machine learning approach that can discover such cognitive processes in M/EEG data. The method uses a combination of multivariate pattern analysis (MVPA) and hidden semi-Markov models (HsMMs), to take both the spatial extent and the temporal duration of cognitive processes into account. In the first part of this chapter, we will introduce the HsMM-MVPA method and demonstrate its application to an associative recognition dataset. Next, we will use the results of the analysis to inform a high-level cognitive model developed in the ACT-R (adaptive control of thought – rational) architecture. Finally, we will discuss how the HsMM-MVPA method can be extended and how it can inform other modeling paradigms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 199.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The dataset and analysis scripts can be found on www.jelmerborst.nl/models.

  2. 2.

    In the original experiment, there were also new foils, foils consisting of entirely new words. Because such stimuli result in a different sequence of cognitive stages, we disregard them for this chapter.

  3. 3.

    The starting parameters influence the EM algorithm used to find the optimal model. An alternative method that we have regularly applied is to use 100 sets of random starting parameters and select the best result, but the method described here is more robust.

  4. 4.

    Available for download at www.jelmerborst.nl/models.

  5. 5.

    Note that our timing estimates are slightly different than in the original model due to our reanalysis of the data.

  6. 6.

    This retrieval constitutes a familiarity process; if this were a slow retrieval due to unfamiliar words in the experimental context, this would trigger a production that directly proceeds to a response stage indicating a completely new foil, as described in Borst and Anderson (2015b) and Anderson et al. (2016).

References

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jelmer P. Borst .

Editor information

Editors and Affiliations

Appendices

Exercises

  1. 1.

    While the high temporal resolution of EEG is typically given as an advantage as compared to, for example, fMRI, it does have its drawbacks.

    1. (a)

      Explain why the fourth peak in Fig. 1 disappears when doing a standard ERP analysis.

    2. (b)

      Would this also be a problem when measuring the same process with fMRI?

  2. 2.

    In the HsMM-MVPA analysis, bumps are supposed to be identical across different trials, while the stage lengths can vary. Explain the rationale behind this.

  3. 3.

    To determine the number of stages in the data, we use leave-one-out cross validation, combined with a sign test. This test evaluates whether the log-likelihood of a significant number of subjects improve when we add a stage. Alternatively, one could also simply take the highest log-likelihood, given that we already use an LOOCV procedure. What is the advantage of using the sign test, and what would be the advantage of using log-likelihood to determine the number of stages?

  4. 4.

    Imagine that participants solve a factorial like 4! = 4 × 3 × 2 × 1. What would the expected stage topology look like?

  5. 5.

    One limitation of using the HsMM-MVPA method with M/EEG is that we only measure the top levels of the cortex. What does this mean for the cognitive stages that we can discover?

  6. 6.

    The ACT-R model that we developed in Sect. 3 of this chapter follows the discovered stages very closely. One could almost say that this is “just a fit” of the discovered stages and does not explain the underlying process.

    1. (a)

      What speaks against such an interpretation?

    2. (b)

      How could one further evaluate this model?

  7. 7.

    Take your favorite modeling approach, and discuss how the results of an HsMM-MVPA analysis could inform or help to evaluate such models.

Answers

  • 1.

    1. (a)

      Because the fourth peak appears at a different moment in each trial, it will disappear when averaging across trials or result in a very broad peak with a very low amplitude.

    2. (b)

      No. This brief peak would add to the slow hemodynamic response on each trial, which is more or less the summation of all processes during the last several seconds. However, the exact timing of the peak would be lost.

  • 2. The bumps signify the cognitive processes that participants go through when performing a task, which are assumed to be the same on each trial (at least within a condition). However, the length of these processes can vary on a trial-by-trial basis, which is why the analysis allows the stage duration to differ between trials.

  • 3. Sign test: this focuses on generalization across subjects. When applying the sign test, we make sure that this is the best solution for the majority of the subjects. Log-likelihood: this focuses on the best account of all data points. If we would take the highest log-likelihood, we would choose the model that explains the EEG across all subjects best, which is not necessarily the best model for the majority of the subjects.

  • 4. For solving n!: Visual encoding – n times a retrieval process for the result followed by an update of working memory – entering the response.

  • 5. We can only discover cognitive processes that cause bumps in the top levels of the cortex. It is certainly possible that this does not hold for all cognitive processes, which would be missed by the current method.

  • 6.

    1. (a)

      The mechanism that explains the length of the associative retrieval stage was not developed to account for the results of the HsMM-MVPA analysis. In addition, it is a single mechanism that accounts for the duration in four different conditions, suggesting it might be general.

    2. (b)

      The next step would be to use this model to predict data in a different experiment, for example, with higher-fan conditions, and test this in an experiment.

  • 7. –

Further Reading

  • The current HsMM-MVPA method for EEG data was first introduced by Anderson and colleagues in 2016. This paper has the most detailed description of the method, including extensive appendices in which assumptions underneath the method are tested using synthetic data.

  • In 2018, we applied the same method to MEG data (Anderson et al., 2018) and intracranial EEG data (Zhang et al., 2018a), allowing for greater spatial precision and better interpretation of the underlying cognitive processes.

  • Chapter 1 of Anderson (2007) gives a very clear introduction to cognitive architectures and ACT-R. In case you do not have the book available, Anderson (2005) provides an introduction to ACT-R and its mapping on brain regions.

Rights and permissions

Reprints and permissions

Copyright information

© 2024 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Borst, J.P., Anderson, J.R. (2024). Discovering Cognitive Stages in M/EEG Data to Inform Cognitive Models. In: Forstmann, B.U., Turner, B.M. (eds) An Introduction to Model-Based Cognitive Neuroscience. Springer, Cham. https://doi.org/10.1007/978-3-031-45271-0_5

Download citation

Publish with us

Policies and ethics