复杂高斯图形模型选择的边缘排除检验

Jitendra Tugnait
{"title":"复杂高斯图形模型选择的边缘排除检验","authors":"Jitendra Tugnait","doi":"10.1109/SSP.2018.8450845","DOIUrl":null,"url":null,"abstract":"We consider the problem of inferring the conditional independence graph (CIG) of complex-valued multivariate Gaussian vectors. A p-variate complex Gaussian graphical model (CGGM) associated with an undirected graph with p vertices is defined as the family of complex Gaussian distributions that obey the conditional independence restrictions implied by the edge set of the graph. For real random vectors, considerable body of work exists where one first tests for exclusion of each edge from the saturated model, and then infers the CIG. Much less attention has been paid to CGGMs. In this paper, we propose and analyze a generalized likelihood ratio test based edge exclusion test statistic for CGGMs. The test statistic is expressed in an alternative form compared to an existing result, where the alternative expression is in a form usually given and exploited for real GGMs. The computational complexity of the proposed statistic is $\\mathcal {O}(p^{3})$ compared to $\\mathcal {O}(p^{5})$ for the existing result.","PeriodicalId":330528,"journal":{"name":"2018 IEEE Statistical Signal Processing Workshop (SSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An Edge Exclusion Test for Complex Gaussian Graphical Model Selection\",\"authors\":\"Jitendra Tugnait\",\"doi\":\"10.1109/SSP.2018.8450845\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the problem of inferring the conditional independence graph (CIG) of complex-valued multivariate Gaussian vectors. A p-variate complex Gaussian graphical model (CGGM) associated with an undirected graph with p vertices is defined as the family of complex Gaussian distributions that obey the conditional independence restrictions implied by the edge set of the graph. For real random vectors, considerable body of work exists where one first tests for exclusion of each edge from the saturated model, and then infers the CIG. Much less attention has been paid to CGGMs. In this paper, we propose and analyze a generalized likelihood ratio test based edge exclusion test statistic for CGGMs. The test statistic is expressed in an alternative form compared to an existing result, where the alternative expression is in a form usually given and exploited for real GGMs. The computational complexity of the proposed statistic is $\\\\mathcal {O}(p^{3})$ compared to $\\\\mathcal {O}(p^{5})$ for the existing result.\",\"PeriodicalId\":330528,\"journal\":{\"name\":\"2018 IEEE Statistical Signal Processing Workshop (SSP)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Statistical Signal Processing Workshop (SSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SSP.2018.8450845\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Statistical Signal Processing Workshop (SSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSP.2018.8450845","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

研究复值多元高斯向量的条件独立图(CIG)的推断问题。将具有p个顶点的无向图的p变量复高斯图模型(CGGM)定义为服从图的边集所隐含的条件独立性限制的复高斯分布族。对于真正的随机向量,存在大量的工作,其中首先测试从饱和模型中排除每个边,然后推断CIG。对cggm的关注要少得多。本文提出并分析了基于广义似然比检验的cggm边缘排除检验统计量。与现有结果相比,测试统计量以另一种形式表示,在现有结果中,另一种形式的表达通常是给出并用于实际ggm的形式。与现有结果的$\mathcal {O}(p^{3})$相比,所建议统计量的计算复杂度为$\mathcal {O}(p^{3})$。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Edge Exclusion Test for Complex Gaussian Graphical Model Selection
We consider the problem of inferring the conditional independence graph (CIG) of complex-valued multivariate Gaussian vectors. A p-variate complex Gaussian graphical model (CGGM) associated with an undirected graph with p vertices is defined as the family of complex Gaussian distributions that obey the conditional independence restrictions implied by the edge set of the graph. For real random vectors, considerable body of work exists where one first tests for exclusion of each edge from the saturated model, and then infers the CIG. Much less attention has been paid to CGGMs. In this paper, we propose and analyze a generalized likelihood ratio test based edge exclusion test statistic for CGGMs. The test statistic is expressed in an alternative form compared to an existing result, where the alternative expression is in a form usually given and exploited for real GGMs. The computational complexity of the proposed statistic is $\mathcal {O}(p^{3})$ compared to $\mathcal {O}(p^{5})$ for the existing result.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信