TY - JOUR
T1 - Discriminating Tensor Spectral Clustering for High-Dimension-Low-Sample-Size Data
AU - Hu, Yu
AU - Qi, Fei
AU - Cheung, Yiu-ming
AU - Cai, Hongmin
N1 - This work was supported in part by the National Key Research and Development Program of China under Grant 2022YFE0112200; in part by the National Natural Science Foundation of China under Grant U21A20520 and Grant 62325204; in part by the Key-Area Research and Development Program of Guangzhou City under Grant 202206030009; in part by the NSFC/Research Grants Council (RGC)
Joint Research Scheme under Grant N_HKBU214/21; in part by the General Research Fund of RGC under Grant 12201321, Grant 12202622, and Grant 12201323; and in part by the RGC Senior Research Fellow Scheme under Grant SRFS2324-2S02.
PY - 2025/5
Y1 - 2025/5
N2 - Tensor spectral clustering (TSC) is a recently proposed approach to robustly group data into underlying clusters. Unlike the traditional spectral clustering (SC), which merely uses pairwise similarities of data in an affinity matrix, TSC aims at exploring their multiwise similarities in an affinity tensor to achieve better performance. However, the performance of TSC highly relies on the design of multiwise similarities, and it remains unclear especially for high-dimension-low-sample-size (HDLSS) data. To this end, this article has proposed a discriminating TSC (DTSC) for HDLSS data. Specifically, DTSC uses the proposed discriminating affinity tensor that encodes the pair-to-pair similarities, which are particularly constructed by the anchor-based distance. HDLSS asymptotic analysis shows that the proposed affinity tensor can explicitly differentiate samples from different clusters when the feature dimension is large. This theoretical property allows DTSC to improve the clustering performance on HDLSS data. Experimental results on synthetic and benchmark datasets demonstrate the effectiveness and robustness of the proposed method in comparison to several baseline methods.
AB - Tensor spectral clustering (TSC) is a recently proposed approach to robustly group data into underlying clusters. Unlike the traditional spectral clustering (SC), which merely uses pairwise similarities of data in an affinity matrix, TSC aims at exploring their multiwise similarities in an affinity tensor to achieve better performance. However, the performance of TSC highly relies on the design of multiwise similarities, and it remains unclear especially for high-dimension-low-sample-size (HDLSS) data. To this end, this article has proposed a discriminating TSC (DTSC) for HDLSS data. Specifically, DTSC uses the proposed discriminating affinity tensor that encodes the pair-to-pair similarities, which are particularly constructed by the anchor-based distance. HDLSS asymptotic analysis shows that the proposed affinity tensor can explicitly differentiate samples from different clusters when the feature dimension is large. This theoretical property allows DTSC to improve the clustering performance on HDLSS data. Experimental results on synthetic and benchmark datasets demonstrate the effectiveness and robustness of the proposed method in comparison to several baseline methods.
KW - High-dimension-low-sample-size (HDLSS) data
KW - similarity measurement
KW - spectral clustering (SC)
KW - tensor
KW - tensor SC (TSC)
UR - http://www.scopus.com/inward/record.url?scp=105004262051&partnerID=8YFLogxK
U2 - 10.1109/TNNLS.2024.3422243
DO - 10.1109/TNNLS.2024.3422243
M3 - Journal article
SN - 2162-237X
VL - 36
SP - 8499
EP - 8509
JO - IEEE Transactions on Neural Networks and Learning Systems
JF - IEEE Transactions on Neural Networks and Learning Systems
IS - 5
ER -