Evidence map›Paper›PMID 37397879›Full record

ArticleNetwork neuroscience (Cambridge, Mass.)2023

Significant subgraph mining for neural network inference with multiple comparisons correction.

Aaron J Gutknecht, Michael Wibral

Abstract read
In one paragraph

Article in Network neuroscience (Cambridge, Mass.), 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Aaron J GutknechtDepartment of Data-driven Analysis of Biological Networks, Göttingen Campus Institute for Dynamics of Biological Networks, Georg August Universtiy, Göttingen, Germany.ORCID https://orcid.org/0000-0002-2704-6944
Michael WibralDepartment of Data-driven Analysis of Biological Networks, Göttingen Campus Institute for Dynamics of Biological Networks, Georg August Universtiy, Göttingen, Germany.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

We describe how the recently introduced method of significant subgraph mining can be employed as a useful tool in neural network comparison. It is applicable whenever the goal is to compare two sets of unweighted graphs and to determine differences in the processes that generate them. We provide an extension of the method to dependent graph generating processes as they occur, for example, in within-subject experimental designs. Furthermore, we present an extensive investigation of the error-statistical properties of the method in simulation using Erdős-Rényi models and in empirical data in order to derive practical recommendations for the application of subgraph mining in neuroscience. In particular, we perform an empirical power analysis for transfer entropy networks inferred from resting-state MEG data comparing autism spectrum patients with neurotypical controls. Finally, we provide a Python implementation as part of the openly available IDTxl toolbox.

Indexed as

AutismGraph theoryMultiple comparisonsNetwork inferenceStatisticsTransfer entropy

Identifiers

PMID37397879
PMCPMC10312259

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.