Multi-View Subspace-Enhanced Clustering Via Tensor-Nuclear Norm and Discriminative Graph

Multi-view data offer richer features than single-view data but are often noisy, posing challenges. To address these issues, we propose a novel multi-view clustering model that integrates weighted tensor-nuclear norm regularization and discriminative graph learning. Our approach decomposes multi-view features into self-representative and noise components. It uses a weighted tensor-nuclear norm to capture higher-order correlations among samples, adaptively assigning weights based on clustering contributions. The noise term is constrained by the L<inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</inf>-norm to enhance robustness. Additionally, a discriminative graph learning framework is designed to model inter-class commonality and intra-class distinctiveness jointly. Extensive experiments show that our method outperforms state-of-the-art techniques, demonstrating its effectiveness.

Authors

Institutions

Publication Details

Published
2025-04-25
DOI
https://doi.org/10.1109/iccea65460.2025.11102449
Primary Topic
Advanced Clustering Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-View Subspace-Enhanced Clustering Via Tensor-Nuclear Norm and Discriminative Graph

Xiaochen Zhang, Shuangxi Wang
Advanced Clustering Algorithms Research
article

Multi-View Subspace-Enhanced Clustering Via Tensor-Nuclear Norm and Discriminative Graph

Xiaochen Zhang, Shuangxi Wang
article en

Abstract

Multi-view data offer richer features than single-view data but are often noisy, posing challenges. To address these issues, we propose a novel multi-view clustering model that integrates weighted tensor-nuclear norm regularization and discriminative graph learning. Our approach decomposes multi-view features into self-representative and noise components. It uses a weighted tensor-nuclear norm to capture higher-order correlations among samples, adaptively assigning weights based on clustering contributions. The noise term is constrained by the L<inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</inf>-norm to enhance robustness. Additionally, a discriminative graph learning framework is designed to model inter-class commonality and intra-class distinctiveness jointly. Extensive experiments show that our method outperforms state-of-the-art techniques, demonstrating its effectiveness.

Shangqiu Normal University (CN)
Reduced inequalities
Openalex Percentile: Top 90%
Advanced Clustering Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.