Maximum Likelihood Identification of an Information Matrix Under Constraints in a Corresponding Graphical Model
We address the problem of identifying the neighborhood structure of an undirected graph, whose nodes are labeled with the elements of a multivariate normal (MVN) random vector. A semi-definite program is given for estimating the information matrix under arbitrary constraints on its elements. More i...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
Digital WPI
2017
|
| Subjects: | |
| Online Access: | https://digitalcommons.wpi.edu/etd-theses/128 https://digitalcommons.wpi.edu/cgi/viewcontent.cgi?article=1127&context=etd-theses |