2012 IEEE 51st IEEE Conference on Decision and Control (CDC) 2012
DOI: 10.1109/cdc.2012.6425980
|View full text |Cite
|
Sign up to set email alerts
|

Topology identification of a sparse dynamic network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
9
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 20 publications
(9 citation statements)
references
References 38 publications
0
9
0
Order By: Relevance
“…Obtain estimates G jk (q,θ N ), k ∈ D j and F jk (q,θ N ), k ∈ P j by minimizing the sum of squared prediction errors (6).…”
Section: Obtain Estimatesŵmentioning
confidence: 99%
See 1 more Smart Citation
“…Obtain estimates G jk (q,θ N ), k ∈ D j and F jk (q,θ N ), k ∈ P j by minimizing the sum of squared prediction errors (6).…”
Section: Obtain Estimatesŵmentioning
confidence: 99%
“…Several methods have appeared that automate Granger's method for detection of causal relations by using regularization terms to set certain links in the network to zero. For instance, [6], [7] directly implement an 0 norm, whereas [8] uses the LASSO ( [9]), and [10] uses a compressed sensing approach. In [11] a Bayesian approach for topology detection is presented.…”
Section: Introductionmentioning
confidence: 99%
“…The Least Absolute Shrinkage and Selection Operator (LASSO) have also been used in [21,22] with an 1 penalty to ensure a sparse solution (the 1 norm is the sum of the absolute value of the entries of the vector and serves as a surrogate to minimize the number of non-zeros elements and get a sparse solution).…”
Section: Introductionmentioning
confidence: 99%
“…In Caines & Chan (1975) Anderson (1981) it is shown that it is possible to distinguish between open and closed-loop data generating systems. The reasoning is extended to more complex interconnection structures using a non-parametric approach (Materassi & Innocenti, 2010;Materassi & Salapaka, 2012); using a Bayesian approach (Chuiso & Pillonetto, 2012); and using a parametric approach supplemented by ℓ 0 regularization (Seneviratne & Solo, 2012;Yuan et al, 2011), ℓ 1 regularization (Friedman et al, 2010), and compressed sensing (Sanandaji et al, 2012). In these papers it is assumed that each node in the network is driven by an unknown, independent stochastic process, each variable is measured without sensor noise, and every variable in the network is measured.…”
Section: Introductionmentioning
confidence: 99%