Cargando…

Characterizing Network Search Algorithms Developed for Dynamic Causal Modeling

Dynamic causal modeling (DCM) is a widely used tool to estimate the effective connectivity of specified models of a brain network. Finding the model explaining measured data is one of the most important outstanding problems in Bayesian modeling. Using heuristic model search algorithms enables us to...

Descripción completa

Detalles Bibliográficos
Autores principales: Aranyi, Sándor Csaba, Nagy, Marianna, Opposits, Gábor, Berényi, Ervin, Emri, Miklós
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Frontiers Media S.A. 2021
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8222613/
https://www.ncbi.nlm.nih.gov/pubmed/34177506
http://dx.doi.org/10.3389/fninf.2021.656486
_version_ 1783711521043382272
author Aranyi, Sándor Csaba
Nagy, Marianna
Opposits, Gábor
Berényi, Ervin
Emri, Miklós
author_facet Aranyi, Sándor Csaba
Nagy, Marianna
Opposits, Gábor
Berényi, Ervin
Emri, Miklós
author_sort Aranyi, Sándor Csaba
collection PubMed
description Dynamic causal modeling (DCM) is a widely used tool to estimate the effective connectivity of specified models of a brain network. Finding the model explaining measured data is one of the most important outstanding problems in Bayesian modeling. Using heuristic model search algorithms enables us to find an optimal model without having to define a model set a priori. However, the development of such methods is cumbersome in the case of large model-spaces. We aimed to utilize commonly used graph theoretical search algorithms for DCM to create a framework for characterizing them, and to investigate relevance of such methods for single-subject and group-level studies. Because of the enormous computational demand of DCM calculations, we separated the model estimation procedure from the search algorithm by providing a database containing the parameters of all models in a full model-space. For test data a publicly available fMRI dataset of 60 subjects was used. First, we reimplemented the deterministic bilinear DCM algorithm in the ReDCM R package, increasing computational speed during model estimation. Then, three network search algorithms have been adapted for DCM, and we demonstrated how modifications to these methods, based on DCM posterior parameter estimates, can enhance search performance. Comparison of the results are based on model evidence, structural similarities and the number of model estimations needed during search. An analytical approach using Bayesian model reduction (BMR) for efficient network discovery is already available for DCM. Comparing model search methods we found that topological algorithms often outperform analytical methods for single-subject analysis and achieve similar results for recovering common network properties of the winning model family, or set of models, obtained by multi-subject family-wise analysis. However, network search methods show their limitations in higher level statistical analysis of parametric empirical Bayes. Optimizing such linear modeling schemes the BMR methods are still considered the recommended approach. We envision the freely available database of estimated model-spaces to help further studies of the DCM model-space, and the ReDCM package to be a useful contribution for Bayesian inference within and beyond the field of neuroscience.
format Online
Article
Text
id pubmed-8222613
institution National Center for Biotechnology Information
language English
publishDate 2021
publisher Frontiers Media S.A.
record_format MEDLINE/PubMed
spelling pubmed-82226132021-06-25 Characterizing Network Search Algorithms Developed for Dynamic Causal Modeling Aranyi, Sándor Csaba Nagy, Marianna Opposits, Gábor Berényi, Ervin Emri, Miklós Front Neuroinform Neuroscience Dynamic causal modeling (DCM) is a widely used tool to estimate the effective connectivity of specified models of a brain network. Finding the model explaining measured data is one of the most important outstanding problems in Bayesian modeling. Using heuristic model search algorithms enables us to find an optimal model without having to define a model set a priori. However, the development of such methods is cumbersome in the case of large model-spaces. We aimed to utilize commonly used graph theoretical search algorithms for DCM to create a framework for characterizing them, and to investigate relevance of such methods for single-subject and group-level studies. Because of the enormous computational demand of DCM calculations, we separated the model estimation procedure from the search algorithm by providing a database containing the parameters of all models in a full model-space. For test data a publicly available fMRI dataset of 60 subjects was used. First, we reimplemented the deterministic bilinear DCM algorithm in the ReDCM R package, increasing computational speed during model estimation. Then, three network search algorithms have been adapted for DCM, and we demonstrated how modifications to these methods, based on DCM posterior parameter estimates, can enhance search performance. Comparison of the results are based on model evidence, structural similarities and the number of model estimations needed during search. An analytical approach using Bayesian model reduction (BMR) for efficient network discovery is already available for DCM. Comparing model search methods we found that topological algorithms often outperform analytical methods for single-subject analysis and achieve similar results for recovering common network properties of the winning model family, or set of models, obtained by multi-subject family-wise analysis. However, network search methods show their limitations in higher level statistical analysis of parametric empirical Bayes. Optimizing such linear modeling schemes the BMR methods are still considered the recommended approach. We envision the freely available database of estimated model-spaces to help further studies of the DCM model-space, and the ReDCM package to be a useful contribution for Bayesian inference within and beyond the field of neuroscience. Frontiers Media S.A. 2021-06-10 /pmc/articles/PMC8222613/ /pubmed/34177506 http://dx.doi.org/10.3389/fninf.2021.656486 Text en Copyright © 2021 Aranyi, Nagy, Opposits, Berényi and Emri. https://creativecommons.org/licenses/by/4.0/This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.
spellingShingle Neuroscience
Aranyi, Sándor Csaba
Nagy, Marianna
Opposits, Gábor
Berényi, Ervin
Emri, Miklós
Characterizing Network Search Algorithms Developed for Dynamic Causal Modeling
title Characterizing Network Search Algorithms Developed for Dynamic Causal Modeling
title_full Characterizing Network Search Algorithms Developed for Dynamic Causal Modeling
title_fullStr Characterizing Network Search Algorithms Developed for Dynamic Causal Modeling
title_full_unstemmed Characterizing Network Search Algorithms Developed for Dynamic Causal Modeling
title_short Characterizing Network Search Algorithms Developed for Dynamic Causal Modeling
title_sort characterizing network search algorithms developed for dynamic causal modeling
topic Neuroscience
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8222613/
https://www.ncbi.nlm.nih.gov/pubmed/34177506
http://dx.doi.org/10.3389/fninf.2021.656486
work_keys_str_mv AT aranyisandorcsaba characterizingnetworksearchalgorithmsdevelopedfordynamiccausalmodeling
AT nagymarianna characterizingnetworksearchalgorithmsdevelopedfordynamiccausalmodeling
AT oppositsgabor characterizingnetworksearchalgorithmsdevelopedfordynamiccausalmodeling
AT berenyiervin characterizingnetworksearchalgorithmsdevelopedfordynamiccausalmodeling
AT emrimiklos characterizingnetworksearchalgorithmsdevelopedfordynamiccausalmodeling