Multi-Slice Clustering for 3-order Tensor Data

Several methods of triclustering of three dimensional data require the specification of the cluster size in each dimension. This introduces a certain degree of arbitrariness. To address this issue, we propose a new method, namely the multi-slice clustering (MSC) for a 3-order tensor data set. We analyse, in each dimension or tensor mode, the spectral decomposition of each tensor slice, i.e. a matrix. Thus, we define a similarity measure between matrix slices up to a threshold (precision) parameter, and from that, identify a cluster. The intersection of all partial clusters provides the desired triclustering. The effectiveness of our algorithm is shown on both synthetic and real-world data sets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/14/2023

DBSCAN of Multi-Slice Clustering for Third-Order Tensors

Several methods for triclustering three-dimensional data require the clu...
research
03/14/2023

Multiway clustering of 3-order tensor via affinity matrix

We propose a new method of multiway clustering for 3-order tensors via a...
research
02/01/2023

Density peak clustering using tensor network

Tensor networks, which have been traditionally used to simulate many-bod...
research
06/23/2023

Tensor Dirichlet Process Multinomial Mixture Model for Passenger Trajectory Clustering

Passenger clustering based on travel records is essential for transporta...
research
03/10/2019

Algorithms for an Efficient Tensor Biclustering

Consider a data set collected by (individuals-features) pairs in differe...
research
08/23/2021

Effective Streaming Low-tubal-rank Tensor Approximation via Frequent Directions

Low-tubal-rank tensor approximation has been proposed to analyze large-s...
research
10/28/2019

A framework for second order eigenvector centralities and clustering coefficients

We propose and analyse a general tensor-based framework for incorporatin...

Please sign up or login with your details

Forgot password? Click here to reset