Kullback-Leibler Penalized Sparse Discriminant Analysis for Event-Related Potential Classification

TL;DR

This paper introduces Kullback-Leibler penalized sparse discriminant analysis (KLSDA), a novel method that enhances EEG-based BCI classification by improving feature selection and classification accuracy through KL divergence integration.

Contribution

The paper proposes KLSDA, a new penalized discriminant analysis method that incorporates KL divergence to improve EEG event-related potential classification performance.

Findings

KLSDA outperforms standard SDA in real EEG datasets.

The method automatically selects optimal regularization parameters.

KLSDA enhances discriminative feature selection and classification accuracy.

Abstract

A brain computer interface (BCI) is a system which provides direct communication between the mind of a person and the outside world by using only brain activity (EEG). The event-related potential (ERP)-based BCI problem consists of a binary pattern recognition. Linear discriminant analysis (LDA) is widely used to solve this type of classification problems, but it fails when the number of features is large relative to the number of observations. In this work we propose a penalized version of the sparse discriminant analysis (SDA), called Kullback-Leibler penalized sparse discriminant analysis (KLSDA). This method inherits both the discriminative feature selection and classification properties of SDA and it also improves SDA performance through the addition of Kullback-Leibler class discrepancy information. The KLSDA method is design to automatically select the optimal regularization parameters. Numerical experiments with two real ERP-EEG datasets show that this new method outperforms standard SDA.