arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2303.07768cs.LGstat.ML
收藏

三阶张量多切片聚类的DBSCAN

DBSCAN of Multi-Slice Clustering for Third-Order Tensors

Sorbonne Paris Nord University(索邦巴黎北大学);University of Versailles(凡尔赛大学);Université Paris-Saclay(巴黎萨克雷大学)

Dina Faneva Andriantsiory, Joseph Ben Geloun, Mustapha Lebbah

摘要:

有几种三聚三维数据的方法需要指定每个维度中的聚类大小或聚类数。为了解决这个问题,用于3阶张量的多切片聚类(MSC)找到位于一阶张量数据集的低维子空间中的信号切片,以便基于阈值相似性找到聚类。我们提出了一种扩展算法MSC-DBSCAN,如果数据集是r秩一张量之和(r > 1),则从数据中提取位于不同子空间的切片的不同聚类。我们的算法使用与MSC算法相同的输入,并且可以找到与MSC相同的一阶张量数据的解决方案。

英文摘要:

Several methods for triclustering three-dimensional data require the cluster size or the number of clusters in each dimension to be specified. To address this issue, the Multi-Slice Clustering (MSC) for 3-order tensor finds signal slices that lie in a low dimensional subspace for a rank-one tensor dataset in order to find a cluster based on the threshold similarity. We propose an extension algorithm called MSC-DBSCAN to extract the different clusters of slices that lie in the different subspaces from the data if the dataset is a sum of r rank-one tensor (r > 1). Our algorithm uses the same input as the MSC algorithm and can find the same solution for rank-one tensor data as MSC.

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

↑