Gui-Fu Lu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Gui-Fu Lu has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
Guangyan Ji
School of Computer Science and Information, AnHui Polytechnic University, Wuhu, China
4 shared publicationsYangfan Du
School of Computer Science and Information, AnHui Polytechnic University, WuHu, AnHui, 241000, PR China
3 shared publications- Liang Yao
School of Electrical Engineering, Anhui Polytechnic University, Wuhu, China
2 shared publications - Rong Tang
School of Electrical Engineering, Anhui Polytechnic University, Wuhu, China
2 shared publications - Xiaoxing Guo
School of Computer Science and Information, AnHui Polytechnic University, WuHu, AnHui, China
2 shared publications - Yaozu Kan
Key Laboratory of Advanced Process Control for Light Industry (Ministry of Education), Jiangnan University, Wuxi, China
2 shared publications
Latest Publications
- 10 October 2026
- Published by Elsevier in Neural Networks
- Vol. 206 (Pt A) , 109751
Fast multi-view clustering via smooth low-rank tensor learning
- 10 October 2026
- Published by Elsevier in Neural Networks
- Vol. 206 (Pt A) , 109751
Fast multi-view clustering via smooth low-rank tensor learning
- 18 December 2025
- Published by Elsevier in Neural Networks
- Vol. 197, 108507
Tensorized multi-dimensional multi-view clustering based on nonnegative matrix factorization
- 18 December 2025
- Published by Elsevier in Neural Networks
- Vol. 197, 108507
Tensorized multi-dimensional multi-view clustering based on nonnegative matrix factorization
- 7 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 37 (3) , 1492-1504
Contrastive-Driven Diversity and Consistency Exploration in Tensorized Multiview Subspace Clustering
The success of multiview subspace clustering (MVSC) lies in the efficient integration of consensus and complementary information from subspace structures. However, existing MVSC algorithms often treat these two types of information separately, overlooking the obvious correlations—both positive and negative—that exist between them. To address this issue, we propose a novel method called contrastive-driven diversity and consistency exploration in tensorized MVSC (CD-TMSC). Specifically, our method begins by segmenting self-representations into a consensus representation and a set of specific representations to accurately model both consensus and complementary information. Drawing inspiration from contrastive learning, we introduce a novel fractional regularization term to harness both the positive and negative correlations inherent in consensus and complementary information, where the numerator, employing the Hilbert–Schmidt independence criterion (HSIC), quantifies the negative correlation between the consensus and view-specific representations, as well as among the view-specific representations themselves. Conversely, the denominator, also leveraging HSIC, measures the positive correlation between the original data matrices and their self-representations. Minimizing this term has a dual effect: it reduces the numerator, thereby amplifying the negative correlation, a move that might be seen as counterproductive but, in our innovative approach, it promotes the diversity within representation matrices. Simultaneously, it increases the denominator, reinforcing the positive correlation and bolstering the consistency of the information. Additionally, we incorporate a graph regularization term for the consensus matrix to capture more consistent manifold information. Finally, utilizing the high-quality consensus and view-specific representations derived from our constraints, we reconstruct self-representation matrices and construct a third-order tensor with a low-rank constraint to explore higher order correlations within the self-representations. Our method integrates contrastive-driven regularization, manifold learning, and low-rank tensor learning into a cohesive framework, optimized using an alternating direction minimization strategy. Experimental results on multiple benchmark datasets show that our approach outperforms several state-of-the-art methods.
- 7 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 37 (3) , 1492-1504
Contrastive-Driven Diversity and Consistency Exploration in Tensorized Multiview Subspace Clustering
The success of multiview subspace clustering (MVSC) lies in the efficient integration of consensus and complementary information from subspace structures. However, existing MVSC algorithms often treat these two types of information separately, overlooking the obvious correlations—both positive and negative—that exist between them. To address this issue, we propose a novel method called contrastive-driven diversity and consistency exploration in tensorized MVSC (CD-TMSC). Specifically, our method begins by segmenting self-representations into a consensus representation and a set of specific representations to accurately model both consensus and complementary information. Drawing inspiration from contrastive learning, we introduce a novel fractional regularization term to harness both the positive and negative correlations inherent in consensus and complementary information, where the numerator, employing the Hilbert–Schmidt independence criterion (HSIC), quantifies the negative correlation between the consensus and view-specific representations, as well as among the view-specific representations themselves. Conversely, the denominator, also leveraging HSIC, measures the positive correlation between the original data matrices and their self-representations. Minimizing this term has a dual effect: it reduces the numerator, thereby amplifying the negative correlation, a move that might be seen as counterproductive but, in our innovative approach, it promotes the diversity within representation matrices. Simultaneously, it increases the denominator, reinforcing the positive correlation and bolstering the consistency of the information. Additionally, we incorporate a graph regularization term for the consensus matrix to capture more consistent manifold information. Finally, utilizing the high-quality consensus and view-specific representations derived from our constraints, we reconstruct self-representation matrices and construct a third-order tensor with a low-rank constraint to explore higher order correlations within the self-representations. Our method integrates contrastive-driven regularization, manifold learning, and low-rank tensor learning into a cohesive framework, optimized using an alternating direction minimization strategy. Experimental results on multiple benchmark datasets show that our approach outperforms several state-of-the-art methods.
- 27 October 2025
- Published by Springer Nature in Applied Intelligence
- Vol. 55 (16) , 1-16
Nonconvex low-rank tensor approximation with denoising model for multi-view subspace clustering
- 27 October 2025
- Published by Springer Nature in Applied Intelligence
- Vol. 55 (16) , 1-16
Nonconvex low-rank tensor approximation with denoising model for multi-view subspace clustering
- 14 June 2025
- Published by Elsevier in Neural Networks
- Vol. 190, 107669
Scalable one-pass multi-view clustering with tensorized multiscale bipartite graphs fusion
- 14 June 2025
- Published by Elsevier in Neural Networks
- Vol. 190, 107669
Scalable one-pass multi-view clustering with tensorized multiscale bipartite graphs fusion
- 7 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 27 (15209210) , 6102-6112
Tensor-Based Late Fusion Incomplete Multiview Clustering
Late fusion-based algorithms have attracted extensive attention because of their low time and space complexity for handling in-complete multiview data. However, these methods have certain limitations. First, the basic clustering indicator matrices generated by incomplete views are susceptible to low-quality imputation. Second, traditional methods often fail to adequately consider the high-order correlations between these basic clustering indicator matrices, leading to suboptimal performance. Third, conventional methods focus primarily on improving speed, with less emphasis on enhancing clustering performance. To address these issues, we propose two novel models. The first is called tensor-based late fusion incomplete multiview clustering (TLF-IMVC-1). Specifical-ly, TLF-IMVC-1 first seeks a consensus clustering matrix from the basic clustering indicator matrices and subsequently imputes the incomplete portions of these matrices via the learned consen-sus matrix. This approach seamlessly integrates the clustering process with the imputation of missing elements into a unified framework. Furthermore, we construct a third-order tensor from these basic clustering matrices, constrained by the tensor nuclear norm, to capture their high-order correlations. Although this model is effective, it lacks proper guidance in the learning process of the basic clustering indicator matrices, making them susceptible to low-quality imputation. Therefore, we introduce the second novel model, i.e., TLF-IMVC-2, to address this issue. Specifically, TLF-IMVC-2 uses the learned consensus representation matrix as a new component to construct the third-order tensor. This strategy leverages the robust clustering structure inherent in the consensus matrix to guide the learning process of the basic clustering matrices. The experimental results demonstrate that both models outperform state-of-the-art methods in clustering.
- 7 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 27 (15209210) , 6102-6112
Tensor-Based Late Fusion Incomplete Multiview Clustering
Late fusion-based algorithms have attracted extensive attention because of their low time and space complexity for handling in-complete multiview data. However, these methods have certain limitations. First, the basic clustering indicator matrices generated by incomplete views are susceptible to low-quality imputation. Second, traditional methods often fail to adequately consider the high-order correlations between these basic clustering indicator matrices, leading to suboptimal performance. Third, conventional methods focus primarily on improving speed, with less emphasis on enhancing clustering performance. To address these issues, we propose two novel models. The first is called tensor-based late fusion incomplete multiview clustering (TLF-IMVC-1). Specifical-ly, TLF-IMVC-1 first seeks a consensus clustering matrix from the basic clustering indicator matrices and subsequently imputes the incomplete portions of these matrices via the learned consen-sus matrix. This approach seamlessly integrates the clustering process with the imputation of missing elements into a unified framework. Furthermore, we construct a third-order tensor from these basic clustering matrices, constrained by the tensor nuclear norm, to capture their high-order correlations. Although this model is effective, it lacks proper guidance in the learning process of the basic clustering indicator matrices, making them susceptible to low-quality imputation. Therefore, we introduce the second novel model, i.e., TLF-IMVC-2, to address this issue. Specifically, TLF-IMVC-2 uses the learned consensus representation matrix as a new component to construct the third-order tensor. This strategy leverages the robust clustering structure inherent in the consensus matrix to guide the learning process of the basic clustering matrices. The experimental results demonstrate that both models outperform state-of-the-art methods in clustering.
- 16 June 2024
- Published by Elsevier in Neural Networks
- Vol. 178, 106434
An adaptive kernel dictionary-based low-rank representation method for subspace clustering
- 16 June 2024
- Published by Elsevier in Neural Networks
- Vol. 178, 106434
An adaptive kernel dictionary-based low-rank representation method for subspace clustering
- 14 June 2024
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 15 (11) , 5173-5184
Tensor low-rank representation combined with consistency and diversity exploration
- 14 June 2024
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 15 (11) , 5173-5184
Tensor low-rank representation combined with consistency and diversity exploration