Hierarchical subspace identification of directed acyclic graphs
From MaRDI portal
Publication:5265893
Recommendations
- PO-MOESP subspace identification of directed acyclic graphs with unknown topology
- Directed acyclic graph modeling for structural vector autoregressions
- Subspace model identification Part 1. The output-error state-space model identification class of algorithms
- A recursive method for structural learning of directed acyclic graphs
- Exact estimation of multiple directed acyclic graphs
Cites work
- 4SID: Subspace algorithms for the identification of combined deterministic-stochastic systems
- A Bayesian approach to sparse dynamic network identification
- Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks
- Digraphs
- Modeling the topology of a dynamical network via Wiener filtering approach
- Overview of total least-squares methods
- Rank-Sparsity Incoherence for Matrix Decomposition
- Subspace model identification Part 1. The output-error state-space model identification class of algorithms
- The role of vector autoregressive modeling in predictor-based subspace identification
- Tikhonov Regularization and Total Least Squares
- Topological Identification in Networks of Dynamical Systems
Cited in
(6)- Subclass graph embedding and a marginal Fisher analysis paradigm
- PO-MOESP subspace identification of directed acyclic graphs with unknown topology
- A frequency domain approach for local module identification in dynamic networks
- scientific article; zbMATH DE number 147966 (Why is no real title available?)
- The geometric convexity on SE(3) and its application to the formation tracking in multi-vehicle systems
- Learning linear modules in a dynamic network using regularized kernel-based methods
This page was built for publication: Hierarchical subspace identification of directed acyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265893)
