Inferring Directed Network Topologies Via Tensor Factorization

2016 50TH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS(2016)

引用 30|浏览16
暂无评分
摘要
Directed networks are pervasive both in nature and engineered systems, often underlying the complex behavior observed in biological systems, microblogs and social interactions over the web, as well as global financial markets. Since their explicit structures are often unobservable, in order to facilitate network analytics, one generally resorts to approaches capitalizing on measurable nodal processes to infer the unknown topology. Prominent among these are structural equation models (SEMs), capable of incorporating exogenous inputs to resolve inherent directional ambiguities. However, this assumes full knowledge of exogenous inputs, which may not be readily available in some practical settings. The present paper advocates a novel SEM-based topology inference approach that entails a PARAFAC decomposition of a three-way tensor, constructed from the observed nodal data. It turns out that second-order statistics of exogenous variables suffice to identify the hidden topology. Leveraging the uniqueness properties inherent to high-order tensor factorizations, it is shown that topology identification is possible under reasonably mild conditions. Tests on simulated data corroborate the effectiveness of the novel tensor-based approach.
更多
查看译文
关键词
Structural equation models, CANDE-COMP/PARAFAC (CP) decomposition, network topology inference
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要