Multiscale co-clustering for tensor data based on canonical polyadic decomposition and slice-wise factorization
From MaRDI portal
Publication:2224916
Recommendations
- A parameter-less algorithm for tensor co-clustering
- Scaling Probabilistic Tensor Canonical Polyadic Decomposition to Massive Data
- scientific article; zbMATH DE number 7306902
- MuLOT: multi-level optimization of the canonical polyadic tensor decomposition at large-scale
- Low-rank tensor constrained co-regularized multi-view spectral clustering
- Multi-manifold matrix decomposition for data co-clustering
- Essential Tensor Learning for Multi-View Spectral Clustering
Cites work
- A Practical Randomized CP Tensor Decomposition
- A probabilistic relaxation labeling framework for reducing the noise effect in geometric biclustering of gene expression data
- Linear grouping using orthogonal regression
- Matrix factorization for low-rank tensor completion using framelet prior
- Multi-view clustering via multi-manifold regularized non-negative matrix factorization
- Nonnegative tensor factorization, completely positive tensors, and a hierarchical elimination algorithm
- Tensor Decomposition for Signal Processing and Machine Learning
- Tensor Decompositions and Applications
Cited in
(6)- MuLOT: multi-level optimization of the canonical polyadic tensor decomposition at large-scale
- Total variation based tensor decomposition for multi-dimensional data with time dimension.
- scientific article; zbMATH DE number 7306902 (Why is no real title available?)
- Co-clustering algorithms for distributional data with automated variable weighting
- A parameter-less algorithm for tensor co-clustering
- Clustering Boolean tensors
This page was built for publication: Multiscale co-clustering for tensor data based on canonical polyadic decomposition and slice-wise factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2224916)
