Evidence map›Paper›PMID 40309182›Full record

ArticleRoyal Society open science2025

Leveraging advances in machine learning for the robust classification and interpretation of networks.

Raima Carol Appaw, Nicholas M Fountain-Jones, Michael A Charleston

Abstract read
In one paragraph

Article in Royal Society open science, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing 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

1 citing paper in PubMed.

  1. Article
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

3 authors.

Raima Carol AppawDepartment of Mathematics, University of Tasmania College of Sciences and Engineering, Sandy Bay, Tasmania, Australia.ORCID https://orcid.org/0000-0002-7023-0800
Nicholas M Fountain-JonesSchool of Natural Sciences, University of Tasmania, Hobart, Tasmania, Australia.ORCID https://orcid.org/0000-0001-9248-8493
Michael A CharlestonDepartment of Mathematics, University of Tasmania College of Sciences and Engineering, Sandy Bay, Tasmania, Australia.ORCID https://orcid.org/0000-0001-8385-341X

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The ability to simulate realistic networks based on empirical data is an important task across scientific disciplines, from epidemiology to computer science. Often, simulation approaches involve selecting a suitable network generative model such as Erdös-Rényi or small-world. However, few tools are available to quantify if a particular generative model is suitable for capturing a given network structure or organization. We utilize advances in interpretable machine learning to classify simulated networks by our generative models based on various network attributes, using both primary features and their interactions. Our study underscores the significance of specific network features and their interactions in distinguishing generative models, comprehending complex network structures and the formation of real-world networks.

Indexed as

classificationgenerative graph modelsmachine learningnetwork science

Identifiers

PMID40309182
PMCPMC12040445

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.