arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.01063cs.AIcs.LG
收藏

置换不变子图发现

Permutation-Invariant Subgraph Discovery

Qatar Computing Research Institute, Hamad Bin Khalifa University(卡塔尔计算研究所,哈马德·本·哈利法大学);INRIA(法国国家信息与自动化研究所)

Raghvendra Mall, Shameem A. Parambath, Han Yufei, Ting Yu, Sanjay Chawla

摘要:

我们介绍排列和结构化扰动推理(PSPI),一个新的问题制定,抽象出许多图形匹配任务,出现在系统生物学。PSPI可以被视为置换推理或图匹配的鲁棒公式,其中目标是在假设一组边缘可能由于潜在原因而经历扰动的情况下找到两个图之间的置换。例如,假设有两个基因调控网络X和Y分别来自患病和正常组织。然后,PSPI问题可以用来检测两个网络之间是否存在结构变化,这可以作为疾病的特征。除了新的问题制定,我们提出了一个ADMM算法(STEPD)来解决一个放松版本的PSPI问题。比较基因调控网络(GRNs)的一个广泛的案例研究被用来证明,STEPD是能够准确地推断结构化的扰动,从而为计算生物学家提供了一个工具,以确定新的预后签名。谱分析证实,STEPD可以恢复小的类candle扰动,使其成为一个有用的工具,用于检测置换不变的变化图。

英文摘要:

We introduce Permutation and Structured Perturbation Inference (PSPI), a new problem formulation that abstracts many graph matching tasks that arise in systems biology. PSPI can be viewed as a robust formulation of the permutation inference or graph matching, where the objective is to find a permutation between two graphs under the assumption that a set of edges may have undergone a perturbation due to an underlying cause. For example, suppose there are two gene regulatory networks X and Y from a diseased and normal tissue respectively. Then, the PSPI problem can be used to detect if there has been a structural change between the two networks which can serve as a signature of the disease. Besides the new problem formulation, we propose an ADMM algorithm (STEPD) to solve a relaxed version of the PSPI problem. An extensive case study on comparative gene regulatory networks (GRNs) is used to demonstrate that STEPD is able to accurately infer structured perturbations and thus provides a tool for computational biologists to identify novel prognostic signatures. A spectral analysis confirms that STEPD can recover small clique-like perturbations making it a useful tool for detecting permutation-invariant changes in graphs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑