mlsanityData to 7 Oct 2026

DBSCAN of Multi-Slice Clustering for Third-Order Tensors

arXiv 2303.07768 ↗First posted 14 Mar 2023cs.LG stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 4 of its 20 references that are in the map. First posted on arXiv 14 Mar 2023.

Builds on

4 of 20 references.

References · 4

  1. 2015Computational and Statistical Boundaries for Submatrix Localization in a Large Noisy Matrixcited by 12
  2. 2017Dynamic Tensor Clusteringcited by 12
  3. 2021Multi-Slice Clustering for 3-order Tensor Datacited by 3
  4. 2019Algorithms for an Efficient Tensor Biclusteringcited by 2

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.