English

Clustered Gaussian Graphical Model via Symmetric Convex Clustering

Machine Learning 2019-06-03 v1 Machine Learning Methodology

Abstract

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.

Keywords

Cite

@article{arxiv.1905.13251,
  title  = {Clustered Gaussian Graphical Model via Symmetric Convex Clustering},
  author = {Tianyi Yao and Genevera I. Allen},
  journal= {arXiv preprint arXiv:1905.13251},
  year   = {2019}
}

Comments

To appear in IEEE DSW 2019

R2 v1 2026-06-23T09:33:53.186Z