Evidence map›Paper›PMID 37520305›Full record

ArticleLinear algebra and its applications2023

Spectral Bayesian network theory.

Luke Duttweiler, Sally W Thurston, Anthony Almudevar

Abstract read
In one paragraph

Article in Linear algebra and its applications, 2023. 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. Inference on the Eigenvalues of the Normalized Precision Matrix.Linear algebra and its applications · 2024
    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.

Luke Duttweiler
Sally W Thurston
Anthony Almudevar

Funding

TRAINING IN ENVIRONMENTAL HEALTH SCIENCES BIOSTATISTICST32ES007271 · NIEHS · UNIVERSITY OF ROCHESTER · PI Sally W Thurston · 1992 to 2026
$3.9M
NIEHS NIH HHS T32 ES007271
6 · The paper itself

Abstract

A Bayesian Network (BN) is a probabilistic model that represents a set of variables using a directed acyclic graph (DAG). Current algorithms for learning BN structures from data focus on estimating the edges of a specific DAG, and often lead to many 'likely' network structures. In this paper, we lay the groundwork for an approach that focuses on learning global properties of the DAG rather than exact edges. This is done by defining the

Indexed as

05C5062H22Bayesian NetworkDirected acyclic graphEigenvalue boundHypergraph LaplacianLinear structural equation modelWeighted hypergraph

Identifiers

PMID37520305
PMCPMC10373448

What OpenQuestion holds

Textmetadata
LicenceTDM
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.