Probabilistic Learning Vector Quantization on Manifold of Symmetric Positive Definite Matrices
원문 초록
In this paper, we develop a new classification method for manifold-valued data in the framework of probabilistic learning vector quantization. In many classification scenarios, the data can be naturally represented by symmetric positive definite matrices, which are inherently points that live on a curved Riemannian manifold. Due to the non-Euclidean geometry of Riemannian manifolds, traditional Euclidean machine learning algorithms yield poor results on such data. In this paper, we generalize the probabilistic learning vector quantization algorithm for data points living on the manifold of symmetric positive definite matrices equipped with Riemannian natural metric (affine-invariant metric). By exploiting the induced Riemannian distance, we derive the probabilistic learning Riemannian space quantization algorithm, obtaining the learning rule through Riemannian gradient descent. Empirical investigations on synthetic data, image data , and motor imagery EEG data demonstrate the superior performance of the proposed method.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Dataset combining EEG, eye-tracking, and high-speed video for ocular activity analysis across BCI paradigms
AFPM: Alignment-based Frame Patch Modeling for Cross-Dataset EEG Decoding
Physics-inform attention temporal convolutional network for EEG-based motor imagery classification
Classification of Hand-Grasp Movements of Stroke Patients using EEG Data
Feature Weighting and Regularization of Common Spatial Patterns in EEG-Based Motor Imagery BCI
DBConformer: Dual-Branch Convolutional Transformer for EEG Decoding
토론
이 논문과 연결된 포럼 글이 아직 없습니다.