School of Electrical and Information Engineering, Zhengzhou University, Zhengzhou, 450001, China; Henan Key Laboratory of Brain Science and Brain-Computer Interface Technology, Zhengzhou, 450001, China.
School of Electrical and Information Engineering, Zhengzhou University, Zhengzhou, 450001, China; Henan Key Laboratory of Brain Science and Brain-Computer Interface Technology, Zhengzhou, 450001, China.
Comput Biol Med. 2023 Sep;164:107253. doi: 10.1016/j.compbiomed.2023.107253. Epub 2023 Jul 8.
Spike sorting is the basis for analyzing spike firing patterns encoded in high-dimensional information spaces. With the fact that high-density microelectrode arrays record multiple neurons simultaneously, the data collected often suffers from two problems: a few overlapping spikes and different neuronal firing rates, which both belong to the multi-class imbalance problem. Since deep reinforcement learning (DRL) assign targeted attention to categories through reward functions, we propose ImbSorter to implement spike sorting under multi-class imbalance. We describe spike sorting as a Markov sequence decision and construct a dynamic reward function (DRF) to improve the sensitivity of the agent to minor classes based on the inter-class imbalance ratios. The agent is eventually guided by the optimal strategy to classify spikes. We consider the Wave_Clus dataset, which contains overlapping spikes and diverse noise levels, and the macaque dataset, which has a multi-scale imbalance. ImbSorter is compared with classical DRL architectures, traditional machine learning algorithms, and advanced overlapping spike sorting techniques on these two above datasets. ImbSorter obtained improved results on the Macro_F1. The results show ImbSorter has a promising ability to resist overlapping and noise interference. It has high stability and promising performance in processing spikes with different degrees of skewed distribution.
尖峰分选是分析高维信息空间中编码的尖峰发射模式的基础。由于高密度微电极阵列可以同时记录多个神经元,因此收集的数据经常存在两个问题:少数重叠尖峰和不同神经元的发射率,这两者都属于多类不平衡问题。由于深度强化学习 (DRL) 通过奖励函数对目标类别进行有针对性的关注,因此我们提出了 ImbSorter 来在多类不平衡情况下实现尖峰分选。我们将尖峰分选描述为马尔可夫序列决策,并根据类间不平衡比构建动态奖励函数 (DRF),以提高代理对小类别的敏感性。最终,代理会根据最优策略对尖峰进行分类。我们考虑了包含重叠尖峰和不同噪声水平的 Wave_Clus 数据集,以及具有多尺度不平衡的猕猴数据集。ImbSorter 在这两个数据集上与经典 DRL 架构、传统机器学习算法和先进的重叠尖峰分选技术进行了比较。ImbSorter 在 Macro_F1 上获得了更好的结果。结果表明,ImbSorter 具有抵抗重叠和噪声干扰的能力。它在处理具有不同程度偏斜分布的尖峰时具有较高的稳定性和良好的性能。