arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2312.02407cs.LGcs.DBcs.SC

使用超维计算的鲁棒聚类

Robust Clustering using Hyperdimensional Computing

University of Minnesota(明尼苏达大学);CISCO Systems(思科系统公司)

Lulu Ge, Keshab K. Parhi

AI总结:

本文针对HDCluster初始化随机导致性能不鲁棒的问题,利用查询超向量相似性提出四种HDC聚类算法,其中基于相似性的亲和传播在八个数据集上准确性提升2~38%,且单遍聚类更鲁棒。

摘要:

本文解决了超维计算(HDC)领域中的数据聚类问题。在先前的工作中,已经提出了一种基于HDC的聚类框架,称为HDCluster。然而,现有HDCluster的性能并不鲁棒。由于在初始化步骤中聚类超向量是随机选择的,HDCluster的性能会下降。为了克服这一瓶颈,我们通过探索编码数据(称为查询超向量)的相似性来分配初始聚类超向量。簇内超向量比簇间超向量具有更高的相似性。利用查询超向量之间的相似性结果,本文提出了四种基于HDC的聚类算法:基于相似性的k均值、等宽直方图、等高分位直方图和基于相似性的亲和传播。实验结果表明:(i)与现有HDCluster相比,我们提出的基于HDC的聚类算法可以实现更高的准确性、更鲁棒的性能、更少的迭代次数和更短的执行时间。基于相似性的亲和传播在八个数据集上的聚类准确性比其他三种基于HDC的聚类算法高出2%至38%。(ii)即使对于单遍聚类,即不进行任何聚类超向量的迭代更新,我们提出的算法也能提供比HDCluster更鲁棒的聚类准确性。(iii)在八个数据集中,有五个在投影到超维空间时能达到更高或相当的准确性。当聚类数k较大时,传统聚类比HDC更可取。

英文摘要:

This paper addresses the clustering of data in the hyperdimensional computing (HDC) domain. In prior work, an HDC-based clustering framework, referred to as HDCluster, has been proposed. However, the performance of the existing HDCluster is not robust. The performance of HDCluster is degraded as the hypervectors for the clusters are chosen at random during the initialization step. To overcome this bottleneck, we assign the initial cluster hypervectors by exploring the similarity of the encoded data, referred to as \textit{query} hypervectors. Intra-cluster hypervectors have a higher similarity than inter-cluster hypervectors. Harnessing the similarity results among query hypervectors, this paper proposes four HDC-based clustering algorithms: similarity-based k-means, equal bin-width histogram, equal bin-height histogram, and similarity-based affinity propagation. Experimental results illustrate that: (i) Compared to the existing HDCluster, our proposed HDC-based clustering algorithms can achieve better accuracy, more robust performance, fewer iterations, and less execution time. Similarity-based affinity propagation outperforms the other three HDC-based clustering algorithms on eight datasets by 2~38% in clustering accuracy. (ii) Even for one-pass clustering, i.e., without any iterative update of the cluster hypervectors, our proposed algorithms can provide more robust clustering accuracy than HDCluster. (iii) Over eight datasets, five out of eight can achieve higher or comparable accuracy when projected onto the hyperdimensional space. Traditional clustering is more desirable than HDC when the number of clusters, $k$, is large.

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

↑