Benchmarking Clustering Strategies for High-Dimensional Spike Time-Windows Data from Multi-Electrode Arrays

From a statistical point of view, clustering spike time-windows from multi-electrode arrays (MEAs) recordings is a challenging high-dimensional, unsupervised clustering task where stationarity, commonly assumed in standard time-series analysis, is often violated and for which a gold standard is currently unavailable. Here we aim at providing practical guidance on how to cluster this type of data by systematically comparing 108 clustering pipelines differing along three main dimensions: (i) the data feature space; (ii) the metrics used to quantify distance between data points; and (iii) the clustering algorithm. For our benchmark we used both labeled synthetic data, mimicking four physiologically-inspired classes of spike time-windows, and a set of real MEAs recordings from a two-dimensional in-vitro neural culture. The performance of the competing pipelines was evaluated in terms of balanced accuracy and computational time when analyzing the synthetic datasets, while the Silhouette score was used for the real dataset, where no ground-truth is available. Overall, our analysis shows that the best combination is formed by k-means with Euclidean distance applied after Principal Component Analysis (PCA) of the spike time-windows. Conversely, hierarchical clustering showed the highest computational burden, while Independent Component Analysis and kernel PCA provided less effective noise suppression.