Fast Sequential Clustering in Riemannian Manifolds for Dynamic and Time-Series-Annotated Multilayer Networks

You are here

Top Reasons to Join SPS Today!

1. IEEE Signal Processing Magazine
2. Signal Processing Digital Library*
3. Inside Signal Processing Newsletter
4. SPS Resource Center
5. Career advancement & recognition
6. Discounts on conferences and publications
7. Professional networking
8. Communities for students, young professionals, and women
9. Volunteer opportunities
10. Coming soon! PDH/CEU credits
Click here to learn more.

Fast Sequential Clustering in Riemannian Manifolds for Dynamic and Time-Series-Annotated Multilayer Networks

By: 
Cong Ye; Konstantinos Slavakis; Johan Nakuci; Sarah F. Muldoon; John Medaglia

This work exploits Riemannian manifolds to build a sequential-clustering framework able to address a wide variety of clustering tasks in dynamic multilayer (brain) networks via the information extracted from their nodal time-series. The discussion follows a bottom-up path, starting from feature extraction from time-series and reaching up to Riemannian manifolds (feature spaces) to address clustering tasks such as state clustering, community detection (a.k.a. network-topology identification), and subnetwork-sequence tracking. Kernel autoregressive-moving-average modeling and kernel (partial) correlations serve as case studies of generating features in the Riemannian manifolds of Grassmann and positive-(semi)definite matrices, respectively. Feature point-clouds form clusters which are viewed as submanifolds through the Riemannian multi-manifold modeling. A novel sequential-clustering scheme of Riemannian features is also established: landmark points are first identified in a non-random way to reveal the underlying geometric information of the feature point-cloud, and, then, a fast sequential-clustering scheme is brought forth that takes advantage of Riemannian distances and the angular information on tangent spaces. By virtue of the landmark points and the sequential processing of the Riemannian features, the computational complexity of the framework is rendered free from the length of the available time-series data. The effectiveness and computational efficiency of the proposed framework is validated by extensive numerical tests against several state-of-the-art manifold-learning and (brain-)network-clustering schemes on synthetic as well as real functional-magnetic-resonance-imaging (fMRI) and electro-encephalogram (EEG) data.

SPS on Twitter

  • The SPACE Webinar series continues Tuesday, 18 May at 10:00 AM EST when Dr. Rebecca Willet presents "Machine Learni… https://t.co/jdUjHQpoaf
  • Join us on Friday, 21 May at 1:00 PM EST when Dr. Amir Asif (York University) shares his journey and the importance… https://t.co/SLJGLI3K8u
  • There's still time to apply for PROGRESS! Visit https://t.co/0h4GgRY1Jr to connect with signal processing leaders a… https://t.co/dQNnkxpv8f
  • This Saturday, 8 May, join the SPS JSS Academy of Technical Education Noida Student Branch Chapter in collaboration… https://t.co/lFVmmVucvG
  • The SPACE Webinar Series continues this Tuesday, 4 May at 10:00 AM Eastern when Dr. Lei Tian presents "Modeling and… https://t.co/9emEVjOInK

SPS Videos


Signal Processing in Home Assistants

 


Multimedia Forensics


Careers in Signal Processing             

 


Under the Radar