Subspace metrics for multivariate dictionaries and application to EEG
Overcomplete representations and dictionary learning algorithms are attracting a growing interest in the machine learning community. This paper addresses the emerging problem of comparing multivari-ate overcomplete dictionaries. Despite a recurrent need to rely on a distance for learning or assessing multivariate overcomplete dictionaries , no metrics in their underlying spaces have yet been proposed. Henceforth we propose to study overcomplete representations from the perspective of matrix manifolds. We consider distances between multivariate dictionaries as distances between their spans which reveal to be elements of a Grassmannian manifold. We introduce set-metrics defined on Grassmannian spaces and study their properties both theoretically and numerically. Thanks to the introduced met-rics, experimental convergences of dictionary learning algorithms are assessed on synthetic datasets. Set-metrics are embedded in a clustering algorithm for a qualitative analysis of real EEG signals for Brain-Computer Interfaces (BCI). The obtained clusters of subjects are associated with subject performances. This is a major method-ological advance to understand the BCI-inefficiency phenomenon and to predict the ability of a user to interact with a BCI.
Code (1)
Tasks
ClusteringDictionary LearningEEGElectroencephalogram (EEG)Similar Papers 제목 키워드 기반
Metrics for Multivariate Dictionaries
Overcomplete representations and dictionary learning algorithms kept attracting a growing interest in the machine learning community. This paper addresses the emerging problem of comparing multivariate overcomplete repre…
Clusteringcompressed sensingDictionary LearningEEG+1Learning Stable Multilevel Dictionaries for Sparse Representations
Sparse representations using learned dictionaries are being increasingly used with success in several data processing and machine learning applications. The availability of abundant training data necessitates the develop…
ClusteringDictionary LearningA Riemannian gossip approach to subspace learning on Grassmann manifold
In this paper, we focus on subspace learning problems on the Grassmann manifold. Interesting applications in this setting include low-rank matrix completion and low-dimensional multivariate regression, among others. Moti…
Low-Rank Matrix CompletionMatrix CompletionregressionAttention-Guided Deep Adversarial Temporal Subspace Clustering (A-DATSC) Model for multivariate spatiotemporal data
Deep subspace clustering models are vital for applications such as snowmelt detection, sea ice tracking, crop health monitoring, infectious disease modeling, network load prediction, and land-use planning, where multivar…
CASC: Causal Adversarial Subspace Clustering for Multivariate Spatiotemporal Data
Deep subspace clustering plays a critical role in applications involving multivariate spatiotemporal data, such as sea ice monitoring, disease spread analysis, and tracking neuro-degeneration over time. Despite recent ad…