DBSCAN of Multi-Slice Clustering for Third-Order Tensors

Dina Faneva Andriantsiory, Joseph Ben Geloun, Mustapha Lebbah
3/14/2023
cs.LGstat.ML

No confident code implementation found for this paper. 3 possible matches can be shown below.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 3 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{andriantsiory2023dbscan,
  title  = {DBSCAN of Multi-Slice Clustering for Third-Order Tensors},
  author = {Dina Faneva Andriantsiory and Joseph Ben Geloun and Mustapha Lebbah},
  year   = {2023},
  eprint = {2303.07768},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.07768v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2303.07768.svg)](https://codeofpaper.com/paper/2303.07768)

Discussion