Inference for a large directed acyclic graph with unspecified interventions
Abstract
References
Index Terms
- Inference for a large directed acyclic graph with unspecified interventions
Recommendations
A Directed Acyclic Graph DAG Ensemble Classification Model: An Alternative Architecture for Hierarchical Classification
In this paper, a hierarchical ensemble classification approach that utilizes a Directed Acyclic Graph DAG structure is proposed as a solution to the multi-class classification problem. Two main DAG structures are considered: i rooted DAG, and ii non-...
Maximum directed cuts in acyclic digraphs
It is easily shown that every digraph with m edges has a directed cut of size at least m-4, and that 1-4 cannot be replaced by any larger constant. We investigate the size of the largest directed cut in acyclic digraphs, and prove a number of related ...
Acyclic Coloring Parameterized by Directed Clique-Width
Algorithms and Discrete Applied MathematicsAbstractAn acyclic r-coloring of a directed graph is a partition of the vertex set V into r acyclic sets. The dichromatic number of a directed graph G is the smallest r such that G allows an acyclic r-coloring. For symmetric digraphs the ...
Comments
Information & Contributors
Information
Published In
Publisher
JMLR.org
Publication History
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 68Total Downloads
- Downloads (Last 12 months)68
- Downloads (Last 6 weeks)10
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in