Consider a Gaussian stationary stochastic vector process with the property that designated pairs of components are conditionally independent given the rest of the components. Such processes can be represented on a graph where the components are nodes and the lack of a connecting link between two nodes signifies conditional independence. This leads to a sparsity pattern in the inverse of the matrix-valued spectral density. Such graphical models find applications in speech, bioinformatics, image processing, econometrics and many other fields, where the problem to fit an autoregressive (AR) model to such a process has been considered. In this paper we take this problem one step further, namely to fit an autoregressive moving-average (ARMA) model to the same data. We develop a theoretical framework and an optimization procedure which also spreads further light on previous approaches and results. This procedure is then applied to the identification problem of estimating the ARMA parameters as well as the topology of the graph from statistical data. / <p>Updated from "Preprint" to "Article" QC 20130627</p>
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:kth-39065 |
| Date | January 2013 |
| Creators | Avventi, Enrico, Lindquist, Anders, Wahlberg, Bo |
| Publisher | KTH, Optimeringslära och systemteori, KTH, Optimeringslära och systemteori, KTH, Optimeringslära och systemteori |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Article in journal, info:eu-repo/semantics/article, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | IEEE Transactions on Automatic Control, 0018-9286, 2013, 58:5, s. 1167-1178 |
Page generated in 0.0018 seconds