Results 81 to 90 of about 92,871 (231)
Causal Discovery with Continuous Additive Noise Models [PDF]
We consider the problem of learning causal directed acyclic graphs from an observational joint distribution. One can use these graphs to predict the outcome of interventional experiments, from which data are often not available.
Janzing, Dominik +3 more
core +3 more sources
Distributed Ledger Technology for Smart Cities, the Sharing Economy, and Social Compliance
This paper describes how distributed ledger technologies (DLTs) can be used to enforce social contracts and to orchestrate the behavior of agents trying to access a shared resource.
Pietro Ferraro, C. King, Robert Shorten
doaj +1 more source
On the causal interpretation of acyclic mixed graphs under multivariate normality [PDF]
In multivariate statistics, acyclic mixed graphs with directed and bidirected edges are widely used for compact representation of dependence structures that can arise in the presence of hidden (i.e., latent or unobserved) variables.
Drton, Mathias +2 more
core
Structural Intervention Distance (SID) for Evaluating Causal Graphs
Causal inference relies on the structure of a graph, often a directed acyclic graph (DAG). Different graphs may result in different causal inference statements and different intervention distributions.
Bühlmann, Peter, Peters, Jonas
core +1 more source
Causal Directed Acyclic Graphs [PDF]
Ari M, Lipsky, Sander, Greenland
openaire +2 more sources
An Improved Directed Acyclic Graph Support Vector Machine
In this paper,we propose an improved Directed Acyclic Graph Support Vector Machine(DAGSVM)for multi-class classification.Compared with the traditional DAGSVM,the improved version has advantages that the structure of the directed acyclic graph is not ...
Miao YU, Adel RHUMA, Syed Mohsen NAQVI
doaj
A complex computing problem can be solved efficiently on a system with multiple computing nodes by dividing its implementation code into several parallel processing modules or tasks that can be formulated as directed acyclic graph (DAG) problems. The DAG
Yuyi Jiang, Zhiqing Shao, Yi Guo
doaj +1 more source
Community detection in directed acyclic graphs [PDF]
Some temporal networks, most notably citation networks, are naturally represented as directed acyclic graphs (DAGs). To detect communities in DAGs, we propose a modularity for DAGs by defining an appropriate null model (i.e., randomized network) respecting the order of nodes.
Leo Speidel +2 more
openaire +2 more sources
Background In various fields, searching for the Longest Common Subsequences (LCS) of Multiple (i.e., three or more) sequences (MLCS) is a classic but difficult problem to solve.
Changyong Yu +4 more
doaj +1 more source
Persistent Homology Over Directed Acyclic Graphs
We define persistent homology groups over any set of spaces which have inclusions defined so that the corresponding directed graph between the spaces is acyclic, as well as along any subgraph of this directed graph. This method simultaneously generalizes
A Chistov +20 more
core +1 more source

