Evidence map›Paper›PMID 41123717›Full record

ArticleNeuroinformatics2025

A Study of Deep Clustering in Spike Sorting.

Eugen-Richard Ardelean, Raluca Laura Portase

Abstract read
In one paragraph

Article in Neuroinformatics, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Eugen-Richard ArdeleanDepartment of Computer Science, Technical University of Cluj-Napoca, Cluj- Napoca, Romania. ardeleaneugenrichard@gmail.com.ORCID http://orcid.org/0000-0002-0098-4228
Raluca Laura PortaseDepartment of Computer Science, Technical University of Cluj-Napoca, Cluj- Napoca, Romania.ORCID http://orcid.org/0000-0002-8985-4728

Funding

Romanian Hub for Artificial Intelligence-HRIA MySMIS no. 334906
6 · The paper itself

Abstract

Spike sorting is the process of identifying the source neurons for neuronal activity recorded from extracellular electrodes. Traditional spike sorting pipelines separate the process into distinct feature extraction and clustering steps, which may not optimally capture the complex structure of spike data. This study provides a large-scale benchmark of 12 deep clustering algorithms against traditional feature extraction methods combined with K-means clustering for spike sorting. We analyze performance across 95 synthetic datasets with varying cluster counts (2-20) and complexity from the perspective of six performance metrics. Our results demonstrate that a subset of deep clustering algorithms—particularly ACeDeC, DDC, DEC, IDEC and VaDE—significantly outperform traditional methods, especially as dataset complexity increases. These deep clustering approaches effectively learn non-linear representations that better capture the structure of spike data while simultaneously optimizing clustering objectives. This dual optimization produces feature spaces tailored for clustering, combining the two traditionally separate steps of spike sorting. Our findings indicate that deep clustering approaches are most suitable for accurately identifying individual neuronal activity in extracellular recordings, providing guidance for method selection for the increasingly complex modern multi-electrode recordings.

Indexed as

Action PotentialsNeuronsSignal Processing, Computer-AssistedAlgorithmsAnimalsCluster AnalysisClustering AlgorithmsClusteringDeep clusteringNeuroscienceSpike sorting

Identifiers

PMID41123717
PMCPMC12546415

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.