Shuisheng Zhou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Shuisheng Zhou has a total of 72 co-authors. Here are the top co-authors by number of shared publications:
- Cui Fu
School of Mathematics and Statistics, Xianyang Normal University, Xianyang, China
5 shared publications Feng Ye
5 shared publications- Dong Li
School of Mathematics and Statistics, Xidian University, Xian, China
4 shared publications - Junna Zhang
School of Mathematics and Statistics, Xidian University, Xi’an, People’s Republic of China
4 shared publications Li Chen
College of Physical Education (Main Campus) Zhengzhou University 100 Science Avenue Zhengzhou China
4 shared publicationsDezheng Kong
3 shared publications
Latest Publications
- Open Access
- 12 November 2026
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (9) , 1014
A robust intuitionistic fuzzy variance-penalized SVM for class imbalance learning
- 12 November 2026
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (9) , 1014
Open AccessA robust intuitionistic fuzzy variance-penalized SVM for class imbalance learning
- 30 September 2026
- Published by Springer Nature in Pattern Analysis and Applications
- Vol. 29 (4) , 199
Dual anomaly robust sample weight for sparse feature selection
- 30 September 2026
- Published by Springer Nature in Pattern Analysis and Applications
- Vol. 29 (4) , 199
Dual anomaly robust sample weight for sparse feature selection
- 8 August 2026
- Published by Elsevier in Neurocomputing
- Vol. 703
Graph diversity measurement and tensor-based soft label learning for multi-view clustering with late fusion
- 8 August 2026
- Published by Elsevier in Neurocomputing
- Vol. 703
Graph diversity measurement and tensor-based soft label learning for multi-view clustering with late fusion
- Open Access
- 11 July 2026
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (6) , 604
Multi-label feature selection via label orthogonal embedding and feature self-representation
In multi-label applications like text classification, feature selection is crucial for reducing complexity and enhancing interpretability. Existing methods often inadequately exploit label space discriminative information and rely excessively on pairwise feature correlations for redundancy reduction. To address these limitations, this paper proposes an efficient multi-label feature selection method based on label Orthogonal embedding and feature Self-representation (OSMFS). In the feature space, a feature self-representation matrix, learned by feature-wise local linear embedding, is used to construct a feature manifold regularization term for suppressing feature redundancy. In the label space, the original logical label matrix is orthogonally embedded into a latent label matrix and a dynamic label manifold regularizer is introduced to align this latent space with the feature representation space. A unified sparse regression model is constructed by incorporating the two manifold regularizers, enabling it to simultaneously explore label correlations, suppress feature redundancy, and enforce cross-space structural consistency. Finally, an optimization scheme is proposed to solve the model, along with a rigorous convergence analysis. Extensive experiments on 18 multi-label datasets, using three different base classifiers (ML-KNN, BR-SVM, and CC-SVM), consistently demonstrate that OSMFS significantly outperforms seven state-of-the-art methods across all four evaluation metrics, achieving the best average ranks on Hamming Loss, Average Precision, Macro-F1, and Micro-F1. The code is available at https://github.com/xxwang714/OSMFS .
- 11 July 2026
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (6) , 604
Open AccessMulti-label feature selection via label orthogonal embedding and feature self-representation
In multi-label applications like text classification, feature selection is crucial for reducing complexity and enhancing interpretability. Existing methods often inadequately exploit label space discriminative information and rely excessively on pairwise feature correlations for redundancy reduction. To address these limitations, this paper proposes an efficient multi-label feature selection method based on label Orthogonal embedding and feature Self-representation (OSMFS). In the feature space, a feature self-representation matrix, learned by feature-wise local linear embedding, is used to construct a feature manifold regularization term for suppressing feature redundancy. In the label space, the original logical label matrix is orthogonally embedded into a latent label matrix and a dynamic label manifold regularizer is introduced to align this latent space with the feature representation space. A unified sparse regression model is constructed by incorporating the two manifold regularizers, enabling it to simultaneously explore label correlations, suppress feature redundancy, and enforce cross-space structural consistency. Finally, an optimization scheme is proposed to solve the model, along with a rigorous convergence analysis. Extensive experiments on 18 multi-label datasets, using three different base classifiers (ML-KNN, BR-SVM, and CC-SVM), consistently demonstrate that OSMFS significantly outperforms seven state-of-the-art methods across all four evaluation metrics, achieving the best average ranks on Hamming Loss, Average Precision, Macro-F1, and Micro-F1. The code is available at https://github.com/xxwang714/OSMFS .
- 25 April 2026
- Published by Elsevier in Information Systems
- Vol. 141
KNN-connectivity constrained multi-prototype clustering algorithm with adaptive merging via major/minor axis projected area ratio
- 25 April 2026
- Published by Elsevier in Information Systems
- Vol. 141
KNN-connectivity constrained multi-prototype clustering algorithm with adaptive merging via major/minor axis projected area ratio
- Open Access
Improve Contrastive Clustering Performance by Multiple Fusing-Augmenting ViT Blocks
In the field of image clustering, the widely used contrastive learning networks improve clustering performance by maximizing the similarity between positive pairs and the dissimilarity of negative pairs of the inputs. Extant contrastive learning networks, whose two encoders often implicitly interact with each other by parameter sharing or momentum updating, may not fully exploit the complementarity and similarity of the positive pairs to extract clustering features from input data. To explicitly fuse the learned features of positive pairs, we design a novel multiple fusing-augmenting ViT blocks (MFAVBs) based on the excellent feature learning ability of Vision Transformers (ViT). Firstly, two preprocessed augmentions as positive pairs are separately fed into two shared-weight ViTs, then their output features are fused to input into a larger ViT. Secondly, the learned features are split into a pair of new augmented positive samples and passed to the next FAVBs, enabling multiple fusion and augmention through MFAVBs operations. Finally, the learned features are projected into both instance-level and clustering-level spaces to calculate the cross-entropy loss, followed by parameter updates by backpropagation to finalize the training process. To further enhance ability of the model to distinguish between similar images, our input data for the network we propose is preprocessed augmentions with features extracted from the CLIP pretrained model. Our experiments on seven public datasets demonstrate that MFAVBs serving as the backbone for contrastive clustering outperforms the state-of-the-art techniques in terms of clustering performance.
Open AccessImprove Contrastive Clustering Performance by Multiple Fusing-Augmenting ViT Blocks
In the field of image clustering, the widely used contrastive learning networks improve clustering performance by maximizing the similarity between positive pairs and the dissimilarity of negative pairs of the inputs. Extant contrastive learning networks, whose two encoders often implicitly interact with each other by parameter sharing or momentum updating, may not fully exploit the complementarity and similarity of the positive pairs to extract clustering features from input data. To explicitly fuse the learned features of positive pairs, we design a novel multiple fusing-augmenting ViT blocks (MFAVBs) based on the excellent feature learning ability of Vision Transformers (ViT). Firstly, two preprocessed augmentions as positive pairs are separately fed into two shared-weight ViTs, then their output features are fused to input into a larger ViT. Secondly, the learned features are split into a pair of new augmented positive samples and passed to the next FAVBs, enabling multiple fusion and augmention through MFAVBs operations. Finally, the learned features are projected into both instance-level and clustering-level spaces to calculate the cross-entropy loss, followed by parameter updates by backpropagation to finalize the training process. To further enhance ability of the model to distinguish between similar images, our input data for the network we propose is preprocessed augmentions with features extracted from the CLIP pretrained model. Our experiments on seven public datasets demonstrate that MFAVBs serving as the backbone for contrastive clustering outperforms the state-of-the-art techniques in terms of clustering performance.
- 30 September 2025
- Published by Springer Nature in International Journal of Fuzzy Systems
- p. 1-22
Fuzzy C-Means Clustering Using Gauss-Seidel Iteration
- 30 September 2025
- Published by Springer Nature in International Journal of Fuzzy Systems
- p. 1-22
Fuzzy C-Means Clustering Using Gauss-Seidel Iteration
- 8 September 2025
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 45 (1) , 1-28
A high-dimensional feature selection method based on feature interaction clustering and integer-encoded TLBO
- 8 September 2025
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 45 (1) , 1-28
A high-dimensional feature selection method based on feature interaction clustering and integer-encoded TLBO
- 31 July 2025
- Published by Elsevier in Knowledge-Based Systems
- Vol. 328
A novel consistency low-rank graph learning for multi-view clustering
- 31 July 2025
- Published by Elsevier in Knowledge-Based Systems
- Vol. 328
A novel consistency low-rank graph learning for multi-view clustering
- 19 May 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Pattern Recognition and Artificial Intelligence
- Vol. 39 (07)
Interpretable Multiple Kernel K-Means Clustering with Entropy Regularization
Multi-kernel k-means clustering (MKC) aims to learn a composite kernel from multiple precomputed basic kernels to better reflect the data distribution. In the existing MKC models, the optimal composite kernel is linearly combined by basic kernels with varying weights, subject to different constraints. While some state-of-the-art models have achieved satisfactory clustering performance, they often do so at the expense of model interpretability. To address this issue, this paper proposes a new Multi-Kernel K-means Clustering model with maximized Entropy regularization (MKKC-E). In the new model, convex combination of basic kernels is used to learn the optimal composite kernel to enhance interpretability. Meanwhile, an entropy regularization term is introduced to prevent the kernel weights from becoming overly sparse, thereby improving the model’s robustness. Experimental results demonstrate that the proposed model’s interpretability and robustness are validated on synthetic datasets, while its superior clustering performance is confirmed on benchmark datasets. In conclusion, the MKKC-E model not only achieves excellent clustering performance but also offers significant interpretability.
- 19 May 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Pattern Recognition and Artificial Intelligence
- Vol. 39 (07)
Interpretable Multiple Kernel K-Means Clustering with Entropy Regularization
Multi-kernel k-means clustering (MKC) aims to learn a composite kernel from multiple precomputed basic kernels to better reflect the data distribution. In the existing MKC models, the optimal composite kernel is linearly combined by basic kernels with varying weights, subject to different constraints. While some state-of-the-art models have achieved satisfactory clustering performance, they often do so at the expense of model interpretability. To address this issue, this paper proposes a new Multi-Kernel K-means Clustering model with maximized Entropy regularization (MKKC-E). In the new model, convex combination of basic kernels is used to learn the optimal composite kernel to enhance interpretability. Meanwhile, an entropy regularization term is introduced to prevent the kernel weights from becoming overly sparse, thereby improving the model’s robustness. Experimental results demonstrate that the proposed model’s interpretability and robustness are validated on synthetic datasets, while its superior clustering performance is confirmed on benchmark datasets. In conclusion, the MKKC-E model not only achieves excellent clustering performance but also offers significant interpretability.