Evidence map›Paper›PMID 37051459›Full record

ArticleINFORMS journal on optimization2021

Integer Programming for Learning Directed Acyclic Graphs from Continuous Data.

Hasan Manzour, Simge Küçükyavuz, Hao-Hsiang Wu, Ali Shojaie

Abstract read
PubMed Full text at PMC Publisher
In one paragraph

Article in INFORMS journal on optimization, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

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

3 citing papers in PubMed.

  1. Article
  2. Article
  3. Differential Network Analysis: A Statistical Perspective.Wiley interdisciplinary reviews. Computational statistics
    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

4 authors.

Hasan ManzourDepartment of Industrial and Systems Engineering, University of Washington, Seattle, Washington 98195.ORCID 0000-0003-0012-9771
Simge KüçükyavuzDepartment of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois 60208.ORCID 0000-0001-6548-9378
Hao-Hsiang WuDepartment of Management Science, National Chiao Tung University, Hsinchu, Taiwan.
Ali ShojaieDepartment of Biostatistics, University of Washington, Seattle, Washington 98195.

Funding

Machine Learning Tools for Discovery and Analysis of Active Metabolic PathwaysR01GM114029 · NIGMS · UNIVERSITY OF WASHINGTON · PI SHOJAIE, ALI · 2016 to 2020
$1.7M
Novel Statistical Inference for Biomedical Big DataR01GM133848 · NIGMS · UNIVERSITY OF WASHINGTON · PI SHOJAIE, ALI · 2020 to 2023
$1.7M
NIGMS NIH HHS R01 GM114029NIGMS NIH HHS R01 GM133848
6 · The paper itself

Abstract

Learning directed acyclic graphs (DAGs) from data is a challenging task both in theory and in practice, because the number of possible DAGs scales superexponentially with the number of nodes. In this paper, we study the problem of learning an optimal DAG from continuous observational data. We cast this problem in the form of a mathematical programming model that can naturally incorporate a superstructure to reduce the set of possible candidate DAGs. We use a negative log-likelihood score function with both

Indexed as

continuous datadirected acyclic graphinteger programmingstructural learning

Identifiers

PMID37051459
PMCPMC10088505

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.