Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Network Clustering Via Kernel-ARMA Modeling and the Grassmannian The Brain-Network Case (2002.09943v1)

Published 18 Feb 2020 in cs.LG, cs.SI, and stat.ML

Abstract: This paper introduces a clustering framework for networks with nodes annotated with time-series data. The framework addresses all types of network-clustering problems: State clustering, node clustering within states (a.k.a. topology identification or community detection), and even subnetwork-state-sequence identification/tracking. Via a bottom-up approach, features are first extracted from the raw nodal time-series data by kernel autoregressive-moving-average modeling to reveal non-linear dependencies and low-rank representations, and then mapped onto the Grassmann manifold (Grassmannian). All clustering tasks are performed by leveraging the underlying Riemannian geometry of the Grassmannian in a novel way. To validate the proposed framework, brain-network clustering is considered, where extensive numerical tests on synthetic and real functional magnetic resonance imaging (fMRI) data demonstrate that the advocated learning framework compares favorably versus several state-of-the-art clustering schemes.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Cong Ye (3 papers)
  2. Konstantinos Slavakis (28 papers)
  3. Pratik V. Patil (2 papers)
  4. Johan Nakuci (7 papers)
  5. Sarah F. Muldoon (10 papers)
  6. John Medaglia (2 papers)
Citations (3)

Summary

We haven't generated a summary for this paper yet.