Uniform tensor clustering by jointly exploring sample affinities of various orders
Authors:
- Hongmin CaiHCHongmin Cai
- Fei QiFQFei Qi
- Junyu LiJLJunyu Li
- Yu HuYHYu Hu
- Yue ZhangYZYue Zhang
- Yiu-Ming CheungYCYiu-Ming Cheung
- Bin HuBHBin Hu
Preprint
Abstract
Conventional clustering methods based on pairwise affinity usually suffer from the concentration effect while processing huge dimensional features yet low sample sizes data, resulting in inaccuracy to encode the sample proximity and suboptimal performance in clustering. To address this issue, we propose a unified tensor clustering method (UTC) that characterizes sample proximity using multiple samples' affinity, thereby supplementing rich spatial sample distributions to boost clustering. Specifically, we find that the triadic tensor affinity can be constructed via the Khari-Rao product of two affinity matrices. Furthermore, our early work shows that the fourth-order tensor affinity is defined by the Kronecker product. Therefore, we utilize arithmetical products, Khatri-Rao and Kronecker products, to mathematically integrate different orders of affinity into a unified tensor clustering framework. Thus, the UTC jointly learns a joint low-dimensional embedding to combine various orders. Finally, a numerical scheme is designed to solve the problem. Experiments on synthetic datasets and real-world datasets demonstrate that 1) the usage of high-order tensor affinity could provide a supplementary characterization of sample proximity to the popular affinity matrix; 2) the proposed method of UTC is affirmed to enhance clustering by exploiting different order affinities when processing high-dimensional data.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Integrating Tensor Similarity to Enhance Clustering PerformanceIEEE Transactions on Pattern Analysis and Machine Intelligence, 2020
- Modern deep learning in bioinformaticsJournal of Molecular Cell Biology, 2020
- Deep Subspace ClusteringIEEE Transactions on Neural Networks and Learning Systems, 2020
- Self-Adaptive Multiprototype-Based Competitive Learning Approach: A k-Means-Type Algorithm for Imbalanced Data ClusteringIEEE Transactions on Cybernetics, 2019
- On Perfect Clustering of High Dimension, Low Sample Size DataIEEE Transactions on Pattern Analysis and Machine Intelligence, 2019
- Clustering single-cell RNA-seq data with a model-based deep learning approachNature Machine Intelligence, 2019
- TheZ‐eigenvalues of a symmetric tensor and its application to spectral hypergraph theoryNumerical Linear Algebra with Applications, 2013
- A Game-Theoretic Approach to Hypergraph ClusteringIEEE Transactions on Pattern Analysis and Machine Intelligence, 2012
- An efficient k-means clustering algorithm: analysis and implementationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2002
- Normalized cuts and image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000