Songtao Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Songtao Li has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
Xin Jin
5 shared publicationsYang Li
Wuhan Univ Sci & Technol, Engn Res Ctr Met Automat & Measurement Technol, Minist Educ, Wuhan 430080, Peoples R China
4 shared publicationsYipeng Wang
4 shared publications- Chang Tang
Huazhong University of Science and Technology
3 shared publications Jiaxin Yuan
Jianghan University
3 shared publicationsChang Tang
2 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (11) , 19202-19218
Unified Joint Semi-Supervised Non-Negative Matrix Factorization for Multi-View Data Clustering
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (11) , 19202-19218
Unified Joint Semi-Supervised Non-Negative Matrix Factorization for Multi-View Data Clustering
- 30 September 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 334
Style-consistent prior-driven dual-branch tensor ring fusion with adaptive kernel estimation
- 30 September 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 334
Style-consistent prior-driven dual-branch tensor ring fusion with adaptive kernel estimation
- 14 September 2026
- Published by Elsevier in Pattern Recognition
- Vol. 183
Robust incomplete multi-view clustering via adaptive similarity graph completion and dual-tensor decomposition
- 14 September 2026
- Published by Elsevier in Pattern Recognition
- Vol. 183
Robust incomplete multi-view clustering via adaptive similarity graph completion and dual-tensor decomposition
- Open Access
- 25 May 2026
- Published by Elsevier in SSRN Electronic Journal
Robust Incomplete Multi-View Clustering via Adaptive Similarity Graph Completion and Dual-Tensor Decomposition
Incomplete multi-view clustering (IMC) is crucial for real-world applications such as image retrieval, text classification, and subtype recognition, where multi-modal data frequently suffer from missing values and severe noise due to acquisition limitations or transmission losses. However, most existing methods rely on raw data completion, single-tensor constraints, and isolated multi-step processing paradigms. These approaches not only struggle to simultaneously preserve cross-view consistent principal components and filter out view-specific variations, but their phased nature also introduces irreversible error accumulation. To overcome these bottlenecks, this paper proposes a novel unified framework named Dual-Tensor Graph Completion for Incomplete Multi-View Clustering (DTGC-IMVC). Specifically, to eliminate reconstruction noise at the data feature level, an adaptive similarity graph completion mechanism is introduced to directly recover the similarity graph within the self-representation. Meanwhile, a dual-tensor architecture seamlessly integrating the tensor nuclear norm and the Schatten-p norm is constructed to rigorously capture high-order cross-view consistent features and effectively sparsify noise and view-specific components. Furthermore, a unified multi-source denoising strategy constrained by the L2,1-norm is introduced. Comprehensive experiments on various benchmark datasets demonstrate that the proposed framework substantially outperforms state-of-the-art methods in terms of clustering performance and robustness. The source code of this work is available at https://github.com/kamenrider-x/DTGC-IMVC.
- 25 May 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessRobust Incomplete Multi-View Clustering via Adaptive Similarity Graph Completion and Dual-Tensor Decomposition
Incomplete multi-view clustering (IMC) is crucial for real-world applications such as image retrieval, text classification, and subtype recognition, where multi-modal data frequently suffer from missing values and severe noise due to acquisition limitations or transmission losses. However, most existing methods rely on raw data completion, single-tensor constraints, and isolated multi-step processing paradigms. These approaches not only struggle to simultaneously preserve cross-view consistent principal components and filter out view-specific variations, but their phased nature also introduces irreversible error accumulation. To overcome these bottlenecks, this paper proposes a novel unified framework named Dual-Tensor Graph Completion for Incomplete Multi-View Clustering (DTGC-IMVC). Specifically, to eliminate reconstruction noise at the data feature level, an adaptive similarity graph completion mechanism is introduced to directly recover the similarity graph within the self-representation. Meanwhile, a dual-tensor architecture seamlessly integrating the tensor nuclear norm and the Schatten-p norm is constructed to rigorously capture high-order cross-view consistent features and effectively sparsify noise and view-specific components. Furthermore, a unified multi-source denoising strategy constrained by the L2,1-norm is introduced. Comprehensive experiments on various benchmark datasets demonstrate that the proposed framework substantially outperforms state-of-the-art methods in terms of clustering performance and robustness. The source code of this work is available at https://github.com/kamenrider-x/DTGC-IMVC.
- Open Access
- 7 May 2026
- Published by Elsevier in SSRN Electronic Journal
CGS-Net: A Context-Guided Progressive Spectral Network for Agricultural Hyperspectral Reconstruction
Recently, deep learning has revolutionized RGB to HSI reconstruction. Pioneering convolutional neural networks (CNNs) including HSCNN+ Shi et al. (2018) and AWAN Li et al. (2020) significantly improved spectral recovery accuracy. The advent of Vision Transformers Dosovitskiy et al. (2020) further accelerated this progression. This led to successful models including the Mask guided Spectral wise Transformer (MST) Cai et al. (2022). Concurrently, the broader image restoration field has witnessed a surge
- 7 May 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessCGS-Net: A Context-Guided Progressive Spectral Network for Agricultural Hyperspectral Reconstruction
Recently, deep learning has revolutionized RGB to HSI reconstruction. Pioneering convolutional neural networks (CNNs) including HSCNN+ Shi et al. (2018) and AWAN Li et al. (2020) significantly improved spectral recovery accuracy. The advent of Vision Transformers Dosovitskiy et al. (2020) further accelerated this progression. This led to successful models including the Mask guided Spectral wise Transformer (MST) Cai et al. (2022). Concurrently, the broader image restoration field has witnessed a surge
- 4 April 2026
- Published by Elsevier in Information Sciences
- Vol. 747
Bayesian-inspired non-negative matrix factorization with label propagation for multi-view clustering
- 4 April 2026
- Published by Elsevier in Information Sciences
- Vol. 747
Bayesian-inspired non-negative matrix factorization with label propagation for multi-view clustering
- 1 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (8) , 16480-16495
CDMVC: Consensus-Driven Multiview Clustering via Adaptive Hierarchical Matrix Factorization With Dynamic View Fusion
Multiview clustering is important for discovering shared patterns from heterogeneous data, but many existing methods are constrained by fixed architectures, rigid fusion strategies, and weak theoretical support. We propose a new framework consensus-driven multiview clustering (CDMVC), which integrates adaptive hierarchical matrix factorization with dynamic view fusion. First, an adaptive hierarchical matrix decomposition (AHMD) module is designed to automatically determine the decomposition depth of each view based on its intrinsic complexity, thus avoiding the limitations of manually specified or fixed-depth structures. Second, a consensus-driven fusion mechanism jointly preserves view-specific information and cross-view consistency through an adaptive optimization process with theoretical guarantees. Third, a dynamic weighting strategy updates the contribution of each view according to its structural quality and clustering relevance. Theoretical analysis proves the convergence of CDMVC, and experiments on benchmark datasets demonstrate that CDMVC consistently achieves superior clustering performance while maintaining computational efficiency.
- 1 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (8) , 16480-16495
CDMVC: Consensus-Driven Multiview Clustering via Adaptive Hierarchical Matrix Factorization With Dynamic View Fusion
Multiview clustering is important for discovering shared patterns from heterogeneous data, but many existing methods are constrained by fixed architectures, rigid fusion strategies, and weak theoretical support. We propose a new framework consensus-driven multiview clustering (CDMVC), which integrates adaptive hierarchical matrix factorization with dynamic view fusion. First, an adaptive hierarchical matrix decomposition (AHMD) module is designed to automatically determine the decomposition depth of each view based on its intrinsic complexity, thus avoiding the limitations of manually specified or fixed-depth structures. Second, a consensus-driven fusion mechanism jointly preserves view-specific information and cross-view consistency through an adaptive optimization process with theoretical guarantees. Third, a dynamic weighting strategy updates the contribution of each view according to its structural quality and clustering relevance. Theoretical analysis proves the convergence of CDMVC, and experiments on benchmark datasets demonstrate that CDMVC consistently achieves superior clustering performance while maintaining computational efficiency.
- 3 February 2026
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 168
Labeled diffusion-constrained nonnegative matrix factorization for multiview clustering
- 3 February 2026
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 168
Labeled diffusion-constrained nonnegative matrix factorization for multiview clustering
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 35, 10682-10696
Few-Shot Anchor-Guided Multi-View Clustering With Pearson Correlation
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 35, 10682-10696
Few-Shot Anchor-Guided Multi-View Clustering With Pearson Correlation