arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2011.10163eess.SP
收藏

一种用于棘波分类的特征提取和聚类统一模型

A Unified Model of Feature Extraction and Clustering for Spike Sorting

Libo Huang, Lu Gan, Bingo Wing-Kuen Ling

摘要:

锋电位排序在理解大脑代码中起着不可替代的作用。传统的锋电位分类技术是在锋电位被很好地检测到之后,分别进行特征提取和聚类。然而,它通常会导致许多额外的过程,并进一步导致低精度和/或不稳定的结果,特别是当数据集中存在噪声和/或重叠尖峰时。为了解决这些问题,在本文中,我们提出了一个统一的优化模型集成特征提取和聚类的穗排序。有趣的是,代替广泛使用的组合策略,即,采用主成分分析(PCA)进行棘波特征提取,K均值(KM)进行聚类,将PCA和KM统一到一个优化模型中,减少了额外的过程,减少了迭代次数。随后,通过嵌入K-means++策略的初始化和比较更新规则的求解过程中,所提出的模型可以很好地处理噪声和/或重叠干扰。最后,将最佳的聚类有效性指标引入到该模型中,我们得到了一个自动的尖峰排序方法。在合成数据集和真实数据集上的大量实验结果证实,我们提出的方法优于相关的最先进的方法。

英文摘要:

Spike sorting plays an irreplaceable role in understanding brain codes. Traditional spike sorting technologies perform feature extraction and clustering separately after spikes are well detected. However, it may often cause many additional processes and further lead to low-accurate and/or unstable results especially when there are noises and/or overlapping spikes in datasets. To address these issues, in this paper, we proposed a unified optimisation model integrating feature extraction and clustering for spike sorting. Interestingly, instead of the widely used combination strategies, i.e., performing the principal component analysis (PCA) for spike feature extraction and K-means (KM) for clustering in sequence, we unified PCA and KM into one optimisation model, which reduces additional processes with fewer iteration times. Subsequently, by embedding the K-means++ strategy for initialising and a comparison updating rule in the solving process, the proposed model can well handle the noises and/or overlapping interference. Finally, taking the best of the clustering validity indices into the proposed model, we derive an automatic spike sorting method. Plenty of experimental results on both synthetic and real-world datasets confirm that our proposed method outperforms the related state-of-the-art approaches.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑