PloS one · 2026
Multi-view graph-regularized deep metric subspace clustering network.
СтатьяНазвание и аннотация: Перевод в очереди
Обработка статьи · этапы, ошибки и управление
Загрузка состояния…
Ошибки и ограничения
История · было → стало
Состояние обновляется каждые 5 секунд, пока блок открыт. Процент показывается только там, где известен объём работы. Пауза останавливает продолжение этапа; текущий запрос к источнику может завершиться.
Luo Pengpeng, Yang Ming, Peng Chong, Wang Qianqian
Аннотация
Multi-view subspace clustering has progressed significantly by using deep neural networks to handle nonlinear data representations. A recent advancement, the Multi-view Self-Expressive Subspace Clustering (MSESC) network, achieves markedly higher computational efficiency by substituting the traditional self-expression layer with a deep metric learning approach. Nevertheless, MSESC still suffers from two notable limitations: it fails to adequately capture the high-order geometric structures inherent in multi-view data, and it lacks effective guidance from the underlying clustering distribution. To overcome these shortcomings, we propose a novel framework termed Multi-View Graph Regularized Deep Metric Subspace Clustering (MVGR-DMSC). The proposed method introduces two key components into MSESC to enhance the discriminability of representations. First, a dual-order graph regularization module is devised to maintain both first-order and second-order manifold structures, thereby allowing the model to capture more complex local geometric relationships. Second, an adaptive view-weighted deep clustering module is incorporated, which employs the Kullback-Leibler divergence to guide representation learning while dynamically adjusting the contributions of different views. Through evaluations on five benchmark datasets, we show that MVGR-DMSC consistently yields better results than several state-of-the-art approaches, including the direct baseline MSESC, in both accuracy and robustness.