Search arXivSearch

arXiv · 1912.10749

SpikeDeep-Classifier: A deep-learning based fully automatic offline spike sorting algorithm

Abstract

Objective. Recent advancements in electrode designs and micro-fabrication technology has allowed existence of microelectrode arrays with hundreds of channels for single-cell recordings. In such electrophysiological recordings, each implanted micro-electrode can record the activities of more than one neuron in its vicinity. Recording the activities of multiple neurons may also be referred to as multiple unit activity. However, for any further analysis, the main goal is to isolate the activity of each recorded neuron and thus called single-unit activity. This process may also be referred to as spike sorting or spike classification. Recent approaches to extract SUA are time consuming, mainly due to the requirement of human intervention at various stages of spike sorting pipeline. Lack of standardization is another drawback of the current available approaches. Therefore, in this study we proposed a standard spike sorter: SpikeDeep-Classifier, a fully automatic spike sorting algorithm. Approach. We proposed a novel spike sorting pipeline, based on a set of supervised and unsupervised learning algorithms. We used supervised, deep learning-based algorithms for extracting meaningful channels and removing background activities (noise) from the extracted channels. We also showed that the process of clustering becomes straight-forward, once the noise/artifact is completely removed from the data. Therefore, in the next stage, we applied a simple clustering algorithm (K-mean) with predefined maximum number of clusters. Lastly, we used a similarity-based criterion to keep distinct clusters and merge similar-looking clusters. Main results. We evaluated our algorithm on a dataset collected from two different species (humans and non-human primates (NHPs)) without any retraining. We also validated our algorithm on two publicly available labeled datasets.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Muhammad Saif-ur-Rehman, Omair Ali, Robin Lienkaemper, Sussane Dyck, Marita Metzler, Yaroslav Parpaley, Joerg Wellmer, Charles Liu, Brian Lee, Spencer Kellis, Richard Andersen, Ioannis Iossifidis, Tobias Glasmachers, Christian Klaes. 2019-12-23. SpikeDeep-Classifier: A deep-learning based fully automatic offline spike sorting algorithm. https://doi.org/10.1088/1741-2552%2Fabc8d4

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Implication of modelling choices on connectivity estimation: A comparative analysis

Landscape connectivity is an important field with important conservation implications. Connectivity modelling is a useful tool to inform and guide landscape planning. However, it involves assumptions and methodological decisions which ultimately impact connectivity outcomes. In order to understand the implications of modelling choices on final connectivity estimations, we compare two landscape characterisation approaches - expert knowledge and species distribution models - and three movements models - least-cost paths, circuit theory and an individual-based movement simulator. The implementation of the models and the construction of the analyses scope highlighted conceptual and methodological differences that made the comparison difficult. Landscape characterisation appears as the principal factor determining connectivity outcomes. Therefore, the confrontation between expert knowledge and species distribution models is critical to leverage points of convergence and complementarity between these two approaches. Conceptual differences between movement models are reported on connectivity map and habitat patch contribution estimations. In the want of data and protocol design specifically to validate connectivity models, approaches that integrate stochastic and behavioural processes, bring a more realistic perspective to connectivity estimation.

q-bio.QM

Triplication: an important component of the modern scientific method

A scientific-study protocol (defined) is designed to deliver results from which inductive inference is allowed. In the nineteenth century, triplication was introduced into the plant sciences and Fisher's p<0.05 rule (1925) incorporated into triple-result protocols designed to counter random/systematic errors which contribute to real-world variability. The aims of the present study were to: (1) classify replication protocols; (2) assess their prevalence in plant-science studies (published during one twenty-first-century year; for defined variable construct); (3) explore triplication rationale. Methods: a plant-sciences protocol-prevalence report was produced; experimental/associational-study proportions analyzed; and real-world-data proxies used to show confidence-interval-width patterns with increasing replicate number. Results: 25% plant-science studies analyzed showed triplication, including 11% triple-result protocols (including greater replicate numbers: 48%;17%, respectively). Theoretical considerations indicated that even if systematic errors predominate, (previously-known) square-root rules sometimes apply, contributing to triplication importance (exemplified by real-world-data proxies). Conclusions: The defined protocols, with minor modifications, should provide the means for assessment of most sciences. Triplication was extensively applied in studies analysed and there are strong methodological reasons why triplication, rather than duplication/quadruplication, is the appropriate standard: triple-result protocols: (a) effectively reduce false positives to acceptable levels; (b) give qualitatively-different information (shape) from duplication; (c) have a large efficiency advantage (concerning confidence-interval widths) over quadruplication. The application of batch replication is not, primarily, a statistical problem and cannot effectively be replaced by simulation.

q-bio.QM

Retracing the Process of Translation: Proteome-wide mapping of stable transcriptomic predictors of protein abundance in cancer cell lines

Understanding the relationship between gene expression and protein abundance is central to molecular and systems biology. While gene expression reflects transcriptional activity, proteins are the functional molecules that determine cellular phenotypes. However, numerous post-transcriptional and translational regulatory layers complicate this relationship, and prior studies have reported only weak to moderate correlations between RNA and protein levels. Predicting protein abundance from transcriptomic data remains challenging, but it is a valuable goal for biological insight, especially when proteomic data is limited or unavailable. In this study, we applied a large-scale, Ridge regression-based feature selection strategy to identify predictive gene expression features for each of 8,423 proteins across 940 cancer cell lines. To our knowledge, this is the first work to perform such comprehensive protein-wise feature selection at this scale. Our analysis revealed both globally predictive and context-specific gene features. These included biologically meaningful modules such as immune-related genes, HOX transcription factor targets, and cytoskeletal components. The models identified stable candidate gene-protein associations that remained interpretable at the level of individual proteins and recurrent transcriptomic predictor patterns. Our approach enables interpretable modeling of protein expression from transcriptomic data and provides insight into transcriptomic features associated with protein abundance. This framework may support hypothesis generation, protein imputation in incomplete datasets, and deeper understanding of post-transcriptional regulation in cancer biology.

q-bio.QM