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

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 extr...

Full description

Bibliographic Details
Main Authors: Cong Ye, Konstantinos Slavakis, Johan Nakuci, Sarah F. Muldoon, John Medaglia
Format: Article
Language:English
Published: IEEE 2021-01-01
Series:IEEE Open Journal of Signal Processing
Subjects:
Online Access:https://ieeexplore.ieee.org/document/9321498/
id doaj-8f51f7bb7a254092b4f80807399cb5a5
record_format Article
spelling doaj-8f51f7bb7a254092b4f80807399cb5a52021-03-29T18:08:05ZengIEEEIEEE Open Journal of Signal Processing2644-13222021-01-012678410.1109/OJSP.2021.30514539321498Fast Sequential Clustering in Riemannian Manifolds for Dynamic and Time-Series-Annotated Multilayer NetworksCong Ye0https://orcid.org/0000-0002-9335-3256Konstantinos Slavakis1https://orcid.org/0000-0002-9335-3256Johan Nakuci2Sarah F. Muldoon3https://orcid.org/0000-0002-2830-9291John Medaglia4Department of Electrical Engineering, University at Buffalo (UB), The State University of New York (SUNY), Buffalo, NY, USADepartment of Electrical Engineering, University at Buffalo (UB), The State University of New York (SUNY), Buffalo, NY, USANeuroscience Program, Buffalo, NY, USADepartment of Mathematics and the Computational and Data-Enabled Science and Engineering Program, Buffalo, NY, USADepartment of Psychology, Drexel University, PA, USAThis 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.https://ieeexplore.ieee.org/document/9321498/ClusteringmultilayernetworkRiemannian manifoldsequentialtime-series
collection DOAJ
language English
format Article
sources DOAJ
author Cong Ye
Konstantinos Slavakis
Johan Nakuci
Sarah F. Muldoon
John Medaglia
spellingShingle Cong Ye
Konstantinos Slavakis
Johan Nakuci
Sarah F. Muldoon
John Medaglia
Fast Sequential Clustering in Riemannian Manifolds for Dynamic and Time-Series-Annotated Multilayer Networks
IEEE Open Journal of Signal Processing
Clustering
multilayer
network
Riemannian manifold
sequential
time-series
author_facet Cong Ye
Konstantinos Slavakis
Johan Nakuci
Sarah F. Muldoon
John Medaglia
author_sort Cong Ye
title Fast Sequential Clustering in Riemannian Manifolds for Dynamic and Time-Series-Annotated Multilayer Networks
title_short Fast Sequential Clustering in Riemannian Manifolds for Dynamic and Time-Series-Annotated Multilayer Networks
title_full Fast Sequential Clustering in Riemannian Manifolds for Dynamic and Time-Series-Annotated Multilayer Networks
title_fullStr Fast Sequential Clustering in Riemannian Manifolds for Dynamic and Time-Series-Annotated Multilayer Networks
title_full_unstemmed Fast Sequential Clustering in Riemannian Manifolds for Dynamic and Time-Series-Annotated Multilayer Networks
title_sort fast sequential clustering in riemannian manifolds for dynamic and time-series-annotated multilayer networks
publisher IEEE
series IEEE Open Journal of Signal Processing
issn 2644-1322
publishDate 2021-01-01
description 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.
topic Clustering
multilayer
network
Riemannian manifold
sequential
time-series
url https://ieeexplore.ieee.org/document/9321498/
work_keys_str_mv AT congye fastsequentialclusteringinriemannianmanifoldsfordynamicandtimeseriesannotatedmultilayernetworks
AT konstantinosslavakis fastsequentialclusteringinriemannianmanifoldsfordynamicandtimeseriesannotatedmultilayernetworks
AT johannakuci fastsequentialclusteringinriemannianmanifoldsfordynamicandtimeseriesannotatedmultilayernetworks
AT sarahfmuldoon fastsequentialclusteringinriemannianmanifoldsfordynamicandtimeseriesannotatedmultilayernetworks
AT johnmedaglia fastsequentialclusteringinriemannianmanifoldsfordynamicandtimeseriesannotatedmultilayernetworks
_version_ 1724196739985965056