Related papers: Multiway clustering of 3-order tensor via affinity matrix

Multiway clustering of 3-order tensor via affinity matrix

URL: http://arxiv.org/abs/2303.07757v1
Date: Tue, 14 Mar 2023 10:02:52 GMT
Title: Multiway clustering of 3-order tensor via affinity matrix
Authors: Dina Faneva Andriantsiory, Joseph Ben Geloun, Mustapha Lebbah
Abstract summary: We propose a new method of multiway clustering for 3-order tensors via affinity matrix (MCAM) Based on a notion of similarity between the tensor slices and the spread of information of each slice, our model builds an affinity/similarity matrix on which we apply advanced clustering methods. MCAM achieves competitive results compared with other known algorithms on synthetics and real datasets.
Score: 0.0
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: We propose a new method of multiway clustering for 3-order tensors via affinity matrix (MCAM). Based on a notion of similarity between the tensor slices and the spread of information of each slice, our model builds an affinity/similarity matrix on which we apply advanced clustering methods. The combination of all clusters of the three modes delivers the desired multiway clustering. Finally, MCAM achieves competitive results compared with other known algorithms on synthetics and real datasets.

Related papers

Mixture of multilayer stochastic block models for multiview clustering [0.0]
We propose an original method for aggregating multiple clustering coming from different sources of information. The identifiability of the model parameters is established and a variational Bayesian EM algorithm is proposed for the estimation of these parameters. The method is utilized to analyze global food trading networks, leading to structures of interest.
arXiv Detail & Related papers (2024-01-09T17:15:47Z)
Parallel Computation of Multi-Slice Clustering of Third-Order Tensors [0.08192907805418585]
We devise parallel algorithms to compute the Multi-Slice Clustering (MSC) for 3rd-order tensors. We show that our parallel scheme outperforms sequential computing and allows for the scalability of the MSC method.
arXiv Detail & Related papers (2023-09-29T16:38:51Z)
Multi-View Clustering via Semi-non-negative Tensor Factorization [120.87318230985653]
We develop a novel multi-view clustering based on semi-non-negative tensor factorization (Semi-NTF) Our model directly considers the between-view relationship and exploits the between-view complementary information. In addition, we provide an optimization algorithm for the proposed method and prove mathematically that the algorithm always converges to the stationary KKT point.
arXiv Detail & Related papers (2023-03-29T14:54:19Z)
Uniform tensor clustering by jointly exploring sample affinities of various orders [37.11798745294855]
We propose a unified tensor clustering method (UTC) that characterizes sample proximity using multiple samples' affinity. UTC is affirmed to enhance clustering by exploiting different order affinities when processing high-dimensional data.
arXiv Detail & Related papers (2023-02-03T06:43:08Z)
Semi-Supervised Subspace Clustering via Tensor Low-Rank Representation [64.49871502193477]
We propose a novel semi-supervised subspace clustering method, which is able to simultaneously augment the initial supervisory information and construct a discriminative affinity matrix. Comprehensive experimental results on six commonly-used benchmark datasets demonstrate the superiority of our method over state-of-the-art methods.
arXiv Detail & Related papers (2022-05-21T01:47:17Z)
Gated recurrent units and temporal convolutional network for multilabel classification [122.84638446560663]
This work proposes a new ensemble method for managing multilabel classification. The core of the proposed approach combines a set of gated recurrent units and temporal convolutional neural networks trained with variants of the Adam gradients optimization approach.
arXiv Detail & Related papers (2021-10-09T00:00:16Z)
Multi-Slice Clustering for 3-order Tensor Data [0.12891210250935145]
Several methods of triclustering of three dimensional data require the specification of the cluster size in each dimension. We propose a new method, namely the multi-slice clustering (MSC) for a 3-order tensor data set. The effectiveness of our algorithm is shown on both synthetic and real-world data sets.
arXiv Detail & Related papers (2021-09-22T15:49:48Z)
Clustering Ensemble Meets Low-rank Tensor Approximation [50.21581880045667]
This paper explores the problem of clustering ensemble, which aims to combine multiple base clusterings to produce better performance than that of the individual one. We propose a novel low-rank tensor approximation-based method to solve the problem from a global perspective. Experimental results over 7 benchmark data sets show that the proposed model achieves a breakthrough in clustering performance, compared with 12 state-of-the-art methods.
arXiv Detail & Related papers (2020-12-16T13:01:37Z)
Kernel learning approaches for summarising and combining posterior similarity matrices [68.8204255655161]
We build upon the notion of the posterior similarity matrix (PSM) in order to suggest new approaches for summarising the output of MCMC algorithms for Bayesian clustering models. A key contribution of our work is the observation that PSMs are positive semi-definite, and hence can be used to define probabilistically-motivated kernel matrices.
arXiv Detail & Related papers (2020-09-27T14:16:14Z)
Conjoined Dirichlet Process [63.89763375457853]
We develop a novel, non-parametric probabilistic biclustering method based on Dirichlet processes to identify biclusters with strong co-occurrence in both rows and columns. We apply our method to two different applications, text mining and gene expression analysis, and demonstrate that our method improves bicluster extraction in many settings compared to existing approaches.
arXiv Detail & Related papers (2020-02-08T19:41:23Z)

This list is automatically generated from the titles and abstracts of the papers in this site.