Evidence map›Paper›PMID 32609725›Full record

ArticlePloS one2020

Robust Conditional Independence maps of single-voxel Magnetic Resonance Spectra to elucidate associations between brain tumours and metabolites.

Raúl Vicente Casaña-Eslava, Sandra Ortega-Martorell, Paulo J Lisboa, Ana Paula Candiota, Margarida Julià-Sapé, José David Martín-Guerrero, Ian H Jarman

Open access · goldAbstract read
In one paragraph

Article in PloS one, 2020. 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
0.3field-weighted citation impact, top 36% of its field
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, 2 citations in OpenAlex.

  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

7 authors at 3 institutions in 2 countries.

Raúl Vicente Casaña-EslavaDepartment of Applied Mathematics, Liverpool John Moores University (LJMU), Liverpool, United Kingdom.ORCID 0000-0003-3660-5362
Sandra Ortega-MartorellDepartment of Applied Mathematics, Liverpool John Moores University (LJMU), Liverpool, United Kingdom.
Paulo J LisboaDepartment of Applied Mathematics, Liverpool John Moores University (LJMU), Liverpool, United Kingdom.
Ana Paula CandiotaCentro de Investigación Biomédica en Red en Bioingeniería, Biomateriales y Nanomedicina (CIBER-BBN), Cerdanyola del Vallès, Spain.
Margarida Julià-SapéCentro de Investigación Biomédica en Red en Bioingeniería, Biomateriales y Nanomedicina (CIBER-BBN), Cerdanyola del Vallès, Spain.
José David Martín-GuerreroDepartament d'Enginyeria Electrònica - ETSE, Universitat de València (UV), Valencia, Spain.ORCID 0000-0001-9378-0285
Ian H JarmanDepartment of Applied Mathematics, Liverpool John Moores University (LJMU), Liverpool, United Kingdom.
Liverpool John Moores University · GBBiomedical Research Networking Center in Bioengineering, Biomaterials and Nanomedicine · ESUniversitat de València · ES

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The aim of the paper is two-fold. First, we show that structure finding with the PC algorithm can be inherently unstable and requires further operational constraints in order to consistently obtain models that are faithful to the data. We propose a methodology to stabilise the structure finding process, minimising both false positive and false negative error rates. This is demonstrated with synthetic data. Second, to apply the proposed structure finding methodology to a data set comprising single-voxel Magnetic Resonance Spectra of normal brain and three classes of brain tumours, to elucidate the associations between brain tumour types and a range of observed metabolites that are known to be relevant for their characterisation. The data set is bootstrapped in order to maximise the robustness of feature selection for nominated target variables. Specifically, Conditional Independence maps (CI-maps) built from the data and their derived Bayesian networks have been used. A Directed Acyclic Graph (DAG) is built from CI-maps, being a major challenge the minimization of errors in the graph structure. This work presents empirical evidence on how to reduce false positive errors via the False Discovery Rate, and how to identify appropriate parameter settings to improve the False Negative Reduction. In addition, several node ordering policies are investigated that transform the graph into a DAG. The obtained results show that ordering nodes by strength of mutual information can recover a representative DAG in a reasonable time, although a more accurate graph can be recovered using a random order of samples at the expense of increasing the computation time.

Indexed as

AlgorithmsBayes TheoremBrainBrain NeoplasmsHumansMagnetic Resonance SpectroscopyMetabolomics

Identifiers

PMID32609725
PMCPMC7329095
OpenAlexW3039325750

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.