首页> 外文会议>IEEE Data Science Workshop >Clustered Gaussian Graphical Model Via Symmetric Convex Clustering
【24h】

Clustered Gaussian Graphical Model Via Symmetric Convex Clustering

机译:通过对称凸聚类聚类高斯图形模型

获取原文

摘要

Knowledge of functional groupings of neurons can shed light on structures of neural circuits and is valuable in many types of neuroimaging studies. However, accurately determining which neurons carry out similar neurological tasks via controlled experiments is both labor-intensive and prohibitively expensive on a large scale. Thus, it is of great interest to cluster neurons that have similar connectivity profiles into functionally coherent groups in a data-driven manner. In this work, we propose the clustered Gaussian graphical model (GGM) and a novel symmetric convex clustering penalty in an unified convex optimization framework for inferring functional clusters among neurons from neural activity data. A parallelizable multi-block Alternating Direction Method of Multipliers (ADMM) algorithm is used to solve the corresponding convex optimization problem. In addition, we establish convergence guarantees for the proposed ADMM algorithm. Experimental results on both synthetic data and real-world neuroscientific data demonstrate the effectiveness of our approach.
机译:对神经元功能分组的了解可以阐明神经回路的结构,并且在许多类型的神经影像学研究中具有重要价值。然而,通过受控实验准确地确定哪些神经元执行相似的神经系统任务既费力又大规模,这是昂贵的。因此,以数据驱动的方式将具有相似连接性轮廓的神经元聚类为功能一致的组非常有趣。在这项工作中,我们提出了一个统一的凸优化框架中的聚类高斯图形模型(GGM)和一种新颖的对称凸聚类惩罚算法,用于从神经活动数据中推断神经元之间的功能簇。为了解决相应的凸优化问题,采用了一种可并行的多块乘数交替方向乘数算法(ADMM)。此外,我们为提出的ADMM算法建立了收敛保证。综合数据和现实世界神经科学数据的实验结果证明了我们方法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号