A topological classifier to characterize brain states: When shape matters more than variance

Despite the remarkable accuracies attained by machine learning classifiers to separate complex datasets in a supervised fashion, most of their operation falls short to provide an informed intuition about the structure of data, and, what is more important, about the phenomena being characterized by t...

ver descrição completa

Detalhes bibliográficos
Autores: Cecchini, Gloria, Ferrà Marcús, Aina, Nobbe Fisas, Fritz Pere, Casacuberta, Carles, Cos Aguilera, Ignasi
Formato: artículo
Estado:Versión publicada
Fecha de publicación:2023
País:España
Recursos:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
Repositorio:Recercat. Dipósit de la Recerca de Catalunya
OAI Identifier:oai:recercat.cat:2445/218049
Acesso em linha:https://hdl.handle.net/2445/218049
Access Level:acceso abierto
Palavra-chave:Electroencefalografia
Xarxes neuronals (Informàtica)
Topologia
Aprenentatge automàtic
Electroencephalography
Neural networks (Computer science)
Topology
Machine learning
Descrição
Resumo:Despite the remarkable accuracies attained by machine learning classifiers to separate complex datasets in a supervised fashion, most of their operation falls short to provide an informed intuition about the structure of data, and, what is more important, about the phenomena being characterized by the given datasets. By contrast, topological data analysis (TDA) is devoted to study the shape of data clouds by means of persistence descriptors and provides a quantitative characterization of specific topological features of the dataset under scrutiny. Here we introduce a novel TDA-based classifier that works on the principle of assessing quantifiable changes on topological metrics caused by the addition of new input to a subset of data. We used this classifier with a high-dimensional electro-encephalographic (EEG) dataset recorded from eleven participants during a previous decision-making experiment in which three motivational states were induced through a manipulation of social pressure. We calculated silhouettes from persistence diagrams associated with each motivated state with a ready-made band-pass filtered version of these signals, and classified unlabeled signals according to their impact on each reference silhouette. Our results show that in addition to providing accuracies within the range of those of a nearest neighbour classifier, the TDA classifier provides formal intuition of the structure of the dataset as well as an estimate of its intrinsic dimension. Towards this end, we incorporated variance-based dimensionality reduction methods to our dataset and found that in most cases the accuracy of our TDA classifier remains essentially invariant beyond a certain dimension.