Results 31 to 40 of about 1,258,420 (289)

Qualitative Approximations to Causality: Non-Randomizable Factors in Clinical Psychology

open access: yesClinical Psychology in Europe, 2021
[Background] Causal quests in non-randomized studies are unavoidable just because research questions are beyond doubt causal (e.g., aetiology). Large progress during the last decades has enriched the methodical toolbox. [Aims] Summary papers mainly focus
Michael Höfler   +2 more
doaj   +1 more source

Generalized Layerings for Arbitrary and Fixed Drawing Areas

open access: yesJournal of Graph Algorithms and Applications, 2017
The Directed Layering Problem (DLP) solves a step of the widely used layer-based approach to automatically draw directed acyclic graphs. To cater for cyclic graphs, usually a preprocessing step is used that solves the Feedback Arc Set Problem (FASP) to ...
Ulf Rüegg   +3 more
doaj   +1 more source

Decision-theoretic foundations for statistical causality: Response to Pearl

open access: yesJournal of Causal Inference, 2022
I thank Judea Pearl for his discussion of my paper and respond to the points he raises. In particular, his attachment to unaugmented directed acyclic graphs has led to a misapprehension of my own proposals. I also discuss the possibilities for developing
Dawid Philip
doaj   +1 more source

On compact directed acyclic word graphs [PDF]

open access: yes, 1997
The Directed Acyclic Word Graph (DAWG) is a space-efficient data structure to treat and analyze repetitions in a text, especially in DNA genomic sequences. Here, we consider the Compact Directed Acyclic Word Graph of a word. We give the first direct algorithm to construct it. It runs in time linear in the length of the string on a fixed alphabet.
Crochemore, Maxime, Vérin, Renaud
openaire   +3 more sources

Directed acyclic graphs: A tool to identify confounders in orthodontic research, Part II [PDF]

open access: yes, 2017
In the previous article, we discussed the problem of confounding and presented 3 fundamental methods for assessing and adjusting for confounders: the traditional approach, the noncollapsibility approach, and the directed acyclic graphs (DAGs) or causal ...
Thikriat S. Al-Jewair   +5 more
core   +2 more sources

MRC Directed Acyclic Graphs for Mendelian Randomisation

open access: yes, 2022
MRC Directed Acyclic Graphs for Mendelian ...
Nay Aung (11874419)
core   +1 more source

DIGRUNDY NUMBER OF DIRECTED STAR, BANANA TREE, FIREWORKS, AND COCONUT TREE GRAPHS

open access: yesBarekeng
A digrundy coloring of a graph is a vertex coloring in which every vertex assigned a higher color is adjacent to vertices assigned all smaller colors. The maximum number of colors that can be realized in such a coloring of an acyclic directed graph is ...
Raventino Raventino, Fransiskus Fran
doaj   +1 more source

Ternary directed acyclic word graphs

open access: yesTheoretical Computer Science, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Satoru Miyamoto   +3 more
openaire   +4 more sources

Causal Inference Analysis for Poorly Soluble Low Toxicity Particles, Lung Function, and Malignancy

open access: yesFrontiers in Public Health, 2022
Poorly soluble low toxicity particles such as carbon black and titanium dioxide have raised concern about possible nonmalignant and malignant pulmonary effects. This paper illustrates application of causal inference analysis to assessing these effects. A
Philip Harber
doaj   +1 more source

Transformers over Directed Acyclic Graphs

open access: yesAdvances in Neural Information Processing Systems 36, 2023
Transformer models have recently gained popularity in graph representation learning as they have the potential to learn complex relationships beyond the ones captured by regular graph neural networks. The main research question is how to inject the structural bias of graphs into the transformer architecture, and several proposals have been made for ...
Yuankai Luo   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy