Uniform Tensor Clustering by Jointly Exploring Sample Affinities of Various Orders
Open Access
- 14 August 2024
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 36 (5) , 8699-8713
Abstract
Traditional clustering methods rely on pairwise affinity to divide samples into different subgroups. However, high-dimensional small-sample (HDLSS) data are affected by the concentration effects, rendering traditional pairwise metrics unable to accurately describe relationships between samples, leading to suboptimal clustering results. This article advances the proposition of employing high-order affinities to characterize multiple sample relationships as a strategic means to circumnavigate the concentration effects. We establish a nexus between different order affinities by constructing specialized decomposable high-order affinities, thereby formulating a uniform mathematical framework. Building upon this insight, a novel clustering method named uniform tensor clustering (UTC) is proposed, which learns a consensus low-dimensional embedding for clustering by the synergistic exploitation of multiple-order affinities. Extensive experiments on synthetic and real-world datasets demonstrate two findings: 1) high-order affinities are better suited for characterizing sample relationships in complex data and 2) reasonable use of different order affinities can enhance clustering effectiveness, especially in handling high-dimensional data.Keywords
All Related Versions
Funding Information
- National Key Research and Development Program of China (2022YFE0112200)
- National Natural Science Foundation of China (U21A20520, 62325204, 62172112)
- Key-Area Research and Development Program of Guangzhou City (202206030009)
- NSFC/Research Grants Council (RGC) Joint Research Scheme (N)
- General Research Fund of RGC (12201321, 12202622, 12201323)
- RGC Senior Research Fellow Scheme (SRFS2324-2S02)
This publication has 35 references indexed in Scilit:
- Adaptive Consensus Clustering for Multiple K-Means Via Base Results RefiningIEEE Transactions on Knowledge and Data Engineering, 2023
- Multi-View Spectral Clustering with High-Order Optimal Neighborhood Laplacian MatrixIEEE Transactions on Knowledge and Data Engineering, 2020
- Modern deep learning in bioinformaticsJournal of Molecular Cell Biology, 2020
- Self-Adaptive Multiprototype-Based Competitive Learning Approach: A k-Means-Type Algorithm for Imbalanced Data ClusteringIEEE Transactions on Cybernetics, 2019
- Clustering single-cell RNA-seq data with a model-based deep learning approachNature Machine Intelligence, 2019
- Spectral Embedded Adaptive Neighbors ClusteringIEEE Transactions on Neural Networks and Learning Systems, 2018
- Dynamic Affinity Graph Construction for Spectral Clustering Using Multiple FeaturesIEEE Transactions on Neural Networks and Learning Systems, 2018
- Deep learning for natural language processing: advantages and challengesNational Science Review, 2017
- Asymptotics of hierarchical clustering for growing dimensionJournal of Multivariate Analysis, 2014
- TheZ‐eigenvalues of a symmetric tensor and its application to spectral hypergraph theoryNumerical Linear Algebra with Applications, 2013