Yan Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yan Chen has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Liang Du
School of Computer and Information Technology, Shanxi University, Taiyuan, China
4 shared publications - Feijiang Li
Shanxi University
2 shared publications Henghui Jiang
Shanxi University
2 shared publications- Peng Zhou
Anhui Provincial International Joint Research Center for Advanced Technology in Medical Imaging, School of Computer Science and Technology, Anhui University, Hefei, China
2 shared publications Xiaodong Li
Shanxi University
2 shared publicationsYiqing Guo
Shanxi University
2 shared publications
Latest Publications
- Open Access
- 2 July 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (13) , 2356
Sparse Multiple Kernel Concept Factorization with Adaptive Orthogonal Factors
Concept factorization provides an interpretable route to clustering by expressing latent concepts as combinations of observed samples. Its development in multiple kernel settings, however, remains limited when one simultaneously requires kernel validity, low storage, and mathematically transparent optimization. This paper proposes a sparse multiple kernel concept factorization framework with adaptive orthogonal factors. The framework first constructs sparse positive semi-definite kernel matrices through localized neighborhood regression and then learns a shared nonnegative consensus representation together with kernel-specific orthogonal factors and adaptive kernel weights. The resulting block coordinate procedure contains two closed-form subproblems and one standard multiplicative update. The positive semi-definiteness of the sparse kernels is proved, the exact solutions of the orthogonality-constrained and weight-update blocks are derived, monotonic descent, lower boundedness, and the limiting behavior of the generated objective sequence are analyzed. The computational and storage complexity of the framework are also analyzed. Experiments on nine benchmark datasets, whose sample sizes range from to , show that the proposed method remains competitive in clustering quality while retaining attractive runtime and memory behavior. The paper therefore offers a mathematically explicit and empirically verifiable treatment of sparse multiple kernel concept factorization.- 2 July 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (13) , 2356
Open AccessSparse Multiple Kernel Concept Factorization with Adaptive Orthogonal Factors
Concept factorization provides an interpretable route to clustering by expressing latent concepts as combinations of observed samples. Its development in multiple kernel settings, however, remains limited when one simultaneously requires kernel validity, low storage, and mathematically transparent optimization. This paper proposes a sparse multiple kernel concept factorization framework with adaptive orthogonal factors. The framework first constructs sparse positive semi-definite kernel matrices through localized neighborhood regression and then learns a shared nonnegative consensus representation together with kernel-specific orthogonal factors and adaptive kernel weights. The resulting block coordinate procedure contains two closed-form subproblems and one standard multiplicative update. The positive semi-definiteness of the sparse kernels is proved, the exact solutions of the orthogonality-constrained and weight-update blocks are derived, monotonic descent, lower boundedness, and the limiting behavior of the generated objective sequence are analyzed. The computational and storage complexity of the framework are also analyzed. Experiments on nine benchmark datasets, whose sample sizes range from to , show that the proposed method remains competitive in clustering quality while retaining attractive runtime and memory behavior. The paper therefore offers a mathematically explicit and empirically verifiable treatment of sparse multiple kernel concept factorization. - 4 October 2025
- Published by Springer Nature
- p. 463-479
Late Fusion Multiple Kernel Clustering Refined via Optimal Linear Graph Filtering
- 4 October 2025
- Published by Springer Nature
- p. 463-479
Late Fusion Multiple Kernel Clustering Refined via Optimal Linear Graph Filtering
- Open Access
- 11 April 2025
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 39 (15) , 16381-16388
Sharper Error Bounds in Late Fusion Multi-view Clustering with Eigenvalue Proportion Optimization
Multi-view clustering (MVC) aims to integrate complementary information from multiple views to enhance clustering performance. Late Fusion Multi-View Clustering (LFMVC) has shown promise by synthesizing diverse clustering results into a unified consensus. However, current LFMVC methods struggle with noisy and redundant partitions and often fail to capture high-order correlations across views. To address these limitations, we present a novel theoretical framework for analyzing the generalization error bounds of multiple kernel k-means, leveraging local Rademacher complexity and principal eigenvalue proportions. Our analysis establishes a convergence rate of O(1/n), significantly improving upon the existing rate in the order of O(sqrt(k/n)). Building on this insight, we propose a low-pass graph filtering strategy within a multiple linear K-means framework to mitigate noise and redundancy, further refining the principal eigenvalue proportion and enhancing clustering accuracy. Experimental results on benchmark datasets confirm that our approach outperforms state-of-the-art methods in clustering performance and robustness.
- 11 April 2025
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 39 (15) , 16381-16388
Open AccessSharper Error Bounds in Late Fusion Multi-view Clustering with Eigenvalue Proportion Optimization
Multi-view clustering (MVC) aims to integrate complementary information from multiple views to enhance clustering performance. Late Fusion Multi-View Clustering (LFMVC) has shown promise by synthesizing diverse clustering results into a unified consensus. However, current LFMVC methods struggle with noisy and redundant partitions and often fail to capture high-order correlations across views. To address these limitations, we present a novel theoretical framework for analyzing the generalization error bounds of multiple kernel k-means, leveraging local Rademacher complexity and principal eigenvalue proportions. Our analysis establishes a convergence rate of O(1/n), significantly improving upon the existing rate in the order of O(sqrt(k/n)). Building on this insight, we propose a low-pass graph filtering strategy within a multiple linear K-means framework to mitigate noise and redundancy, further refining the principal eigenvalue proportion and enhancing clustering accuracy. Experimental results on benchmark datasets confirm that our approach outperforms state-of-the-art methods in clustering performance and robustness.
- Open Access
Sharper Error Bounds in Late Fusion Multi-view Clustering Using Eigenvalue Proportion
Multi-view clustering (MVC) aims to integrate complementary information from multiple views to enhance clustering performance. Late Fusion Multi-View Clustering (LFMVC) has shown promise by synthesizing diverse clustering results into a unified consensus. However, current LFMVC methods struggle with noisy and redundant partitions and often fail to capture high-order correlations across views. To address these limitations, we present a novel theoretical framework for analyzing the generalization error bounds of multiple kernel $k$-means, leveraging local Rademacher complexity and principal eigenvalue proportions. Our analysis establishes a convergence rate of $\mathcal{O}(1/n)$, significantly improving upon the existing rate in the order of $\mathcal{O}(\sqrt{k/n})$. Building on this insight, we propose a low-pass graph filtering strategy within a multiple linear $k$-means framework to mitigate noise and redundancy, further refining the principal eigenvalue proportion and enhancing clustering accuracy. Experimental results on benchmark datasets confirm that our approach outperforms state-of-the-art methods in clustering performance and robustness. The related codes is available at https://github.com/csliangdu/GMLKM .Open AccessSharper Error Bounds in Late Fusion Multi-view Clustering Using Eigenvalue Proportion
Multi-view clustering (MVC) aims to integrate complementary information from multiple views to enhance clustering performance. Late Fusion Multi-View Clustering (LFMVC) has shown promise by synthesizing diverse clustering results into a unified consensus. However, current LFMVC methods struggle with noisy and redundant partitions and often fail to capture high-order correlations across views. To address these limitations, we present a novel theoretical framework for analyzing the generalization error bounds of multiple kernel $k$-means, leveraging local Rademacher complexity and principal eigenvalue proportions. Our analysis establishes a convergence rate of $\mathcal{O}(1/n)$, significantly improving upon the existing rate in the order of $\mathcal{O}(\sqrt{k/n})$. Building on this insight, we propose a low-pass graph filtering strategy within a multiple linear $k$-means framework to mitigate noise and redundancy, further refining the principal eigenvalue proportion and enhancing clustering accuracy. Experimental results on benchmark datasets confirm that our approach outperforms state-of-the-art methods in clustering performance and robustness. The related codes is available at https://github.com/csliangdu/GMLKM .