Zhaoyin Shi

Prof. Zhaoyin Shi

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 September 2023 in Information Fusion
Verified
Journal Article
Closed access
CZChuanbin Zhang
Chuanbin Zhang
LCLong Chen
Long Chen
ZSZhaoyin Shi
Zhaoyin Shi
WDWeiping Ding
Weiping Ding

18 May 2023 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
ZSZhaoyin Shi
Zhaoyin Shi
LCLong Chen
Long Chen
Weiping DingWeiping Ding
Weiping Ding
CZChuanbin Zhang
Chuanbin Zhang
YWYingxu Wang
Yingxu Wang
The ensemble of fuzzy clustering can address the problems presented in the base clustering, such as fluctuations in results due to random initialization and performance degradation due to outliers. However, the performance of fuzzy clustering ensembles is still hampered by some challenges that include misaligned membership matrices, loss of information in the co-similarity matrix, large storage space, unstable ensemble results due to an additional re-clustering, the need for original data information for assistance, etc. To address these issues, we propose a parameter-free robust ensemble framework for fuzzy clustering. After obtaining the set of membership matrices, we cascade these membership matrices and mine the latent spectral matrix of the raw data. Benefiting from this step, we obtain global features of the dataset without knowing the specific data. Then, our framework uses transition matrices to solve the alignment problem, avoiding the storage of large-scale matrices. Most importantly, we introduce a robust weighted mechanism in the optimization model, where each base clustering is adaptively adjusted and the effect of outliers is suppressed by a robust function. In addition, the model yields the results as a membership matrix, which produces the exact partition results directly without any subsequent clustering operations. Finally, since our model is a parameter-free model, the setting of hyper-parameters is avoided and the applicability of the model is improved as well. The effective algorithm of the optimization model is derived and its time complexity and convergence are analyzed. The results of competitive experiments on benchmark data show that the proposed ensemble framework is effective compared to state-of-the-art methods.

31 October 2022 in Engineering Applications of Artificial Intelligence
Verified
Journal Article
Closed access
ZSZhaoyin Shi
Zhaoyin Shi
LCLong Chen
Long Chen
JDJunwei Duan
Junwei Duan
GCGuangyong Chen
Guangyong Chen
KZKai Zhao
Kai Zhao

18 July 2022 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
ZSZhaoyin Shi
Zhaoyin Shi
LCLong Chen
Long Chen
GCGuang-Yong Chen
Guang-Yong Chen
KZKai Zhao
Kai Zhao
CCC. L. Philip Chen
C. L. Philip Chen
Many fuzzy subspace clustering methods have been proposed for high-dimensional image data with rich structural information. However, since these methods do not fully exploit the subspace information in each cluster, their performance on image clustering is still not promising. In this work, we propose to find soft partitions directly based on the construction of subspaces. For each cluster, we use a bilinear orthogonal subspace to represent it. Then, through the reconstruction error of a sample in the subspace corresponding to a cluster, a new membership measure for the sample to the cluster is established. Furthermore, the graph regularization is imposed on these bilinear subspaces to preserve the local relational or manifold information of the image data in the original space. Altogether, we get a clustering model considering not only the subspace information but also the manifold information in image data. An efficient optimization algorithm is proposed to our model, and its theoretical convergence and time complexity are presented correspondingly. The proposed method is a one-stage clustering model that does not require vectorized image data, thereby reducing the computational burden while maintaining the structural relationship between pixels in the image. Competitive experimental results on benchmark datasets show that our model can converge quickly with strong clustering performance, which confirms the efficiency and superiority of the proposed method compared to other state-of-the-art fuzzy clustering methods.

1 January 2021 in Computer Modeling in Engineering & Sciences
Verified
Journal Article
Open access
SSShufang Song
Shufang Song
RHRuyang He
Ruyang He
ZSZhaoyin Shi
Zhaoyin Shi
WZWeiya Zhang
Weiya Zhang
The variable importance measure (VIM) can be implemented to rank or select important variables, which can effectively reduce the variable dimension and shorten the computational time. Random forest (RF) is an ensemble learning method by constructing multiple decision trees. In order to improve the prediction accuracy of random forest, advanced random forest is presented by using Kriging models as the models of leaf nodes in all the decision trees. Referring to the Mean Decrease Accuracy (MDA) index based on Out-of-Bag (OOB) data, the single variable, group variables and correlated variables importance measures are proposed to establish a complete VIM system on the basis of advanced random forest. The link of MDA and variance-based sensitivity total index is explored, and then the corresponding relationship of proposed VIM indices and variance-based global sensitivity indices are constructed, which gives a novel way to solve variance-based global sensitivity. Finally, several numerical and engineering examples are given to verify the effectiveness of proposed VIM system and the validity of the established relationship.

30 May 2024 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
ZSZhaoyin Shi
Zhaoyin Shi
LCLong Chen
Long Chen
Weiping DingWeiping Ding
Weiping Ding
XZXiaopin Zhong
Xiaopin Zhong
QTQi Tan
Qi Tan
CCC.L. Philip Chen
C.L. Philip Chen
The graph-information-based fuzzy clustering has shown promising results in various datasets. However, its performance is hindered when dealing with high-dimensional data due to challenges related to redundant information and sensitivity to the similarity matrix design. To address these limitations, this article proposes an implicit fuzzy k-means (FKMs) model that enhances graph-based fuzzy clustering for high-dimensional data. Instead of explicitly designing a similarity matrix, our approach leverages the fuzzy partition result obtained from the implicit FKMs model to generate an effective similarity matrix. We employ a projection-based technique to handle redundant information, eliminating the need for specific feature extraction methods. By formulating the fuzzy clustering model solely based on the similarity matrix derived from the membership matrix, we mitigate issues, such as dependence on initial values and random fluctuations in clustering results. This innovative approach significantly improves the competitiveness of graph-enhanced fuzzy clustering for high-dimensional data. We present an efficient iterative optimization algorithm for our model and demonstrate its effectiveness through theoretical analysis and experimental comparisons with other state-of-the-art methods, showcasing its superior performance.