.png){kind=icon}
返回
Sparse network identifiability via Compressed Sensing
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2016.01.008.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The problem of identifying sparse solutions for the link structure and dynamics of an unknown linear, time-invariant network is posed as finding sparse solutions x to Ax = b. If the matrix A satisfies a rank condition, this problem has a unique, sparse solution. Here each row of A comprises one experiment consisting of input/output measurements and cannot be freely chosen. We show that if experiments are poorly designed, the rank condition may never be satisfied, resulting in multiple solutions. We discuss strategies for designing experiments such that A has the desired properties and the problem is therefore well posed. This formulation allows prior knowledge to be taken into account in the form of known nonzero entries of x, requiring fewer experiments to be performed. Simulated examples are given to illustrate the approach, which provides a useful strategy commensurate with the type of experiments and measurements available to biologists. We also confirm suggested limitations on the use of convex relaxations for the efficient solution of this problem. (C) 2016 Elsevier Ltd. All rights reserved.
Keyword:
Closed-loop identification
Identifiability
Directed graphs
Interconnection matrices
Linear equations
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
Advantages and limitations of current network inference methods.png)
NATURE REVIEWS MICROBIOLOGY
NATURE REVIEWS MICROBIOLOGYIF103.3
PREAI
分享收藏
Impact of Hydrogen Bonding in the Binding Site between Capsid Protein and MS2 Bacteriophage ssRNA
PREAI
分享收藏分享收藏
查看更多内容