ZJZhibin Jiang

Zhibin Jiang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Zhibin Jiang has a total of 12 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Cost-Sensitive TSK for Recognition of Imbalanced Epilepsy EEG Signal

    by Jinhui Dai, Tingke Ye, Peisheng Yan, Zhibin Jiang, Zekang Bian, Jie Zhou

    Epilepsy EEG signal recognition is an important method for epilepsy detection. However, the traditional machine learning methods used for epilepsy EEG signal recognition face many challenges. For example, traditional intelligent recognition methods often ignore the imbalance of epilepsy EEG signals, which misclassifies positive samples and may cause serious consequences; the existing imbalanced classification methods ignore class-guided global inter-class correlations among samples, resulting in poor classification results. In order to overcome these challenges, a cost-sensitive-based TSK method (CITSK) is proposed for imbalanced epilepsy EEG signal recognition. This proposed method constructs a Class-guided Sample Collaborative Relationship (SCR) matrix to assign higher weight to positive minority samples, and supplements global inter-class collaborative penalty information on the basis of the traditional static cost-sensitive matrix. Then, a model combining the SCR matrix and TSK is proposed, which inherits the good generalization ability and interpretability of TSK while ensuring classification performance. Experiments on real EEG datasets demonstrate the effectiveness of the proposed method and its applicability to the imbalanced classification of epileptic EEG signals. Quantitatively, the CITSK method achieves an average Accuracy of 93.96%, an average F_measure of 88.33%, and an average G_means of 91.34% across various imbalanced datasets. Furthermore, comparative evaluations demonstrate that the proposed CITSK achieves superior overall performance across comprehensive evaluation metrics compared to baseline models, offering a highly robust and interpretable solution for imbalanced data scenarios via reasonable global inter-class penalty compensation.

  • Open Access

    An Improved Ensemble Learning Regression Algorithm for Electricity Demand Forecasting with Symmetric Experimental Evaluation

    by Jie Zhou, Peisheng Yan, Zekang Bian, Zhibin Jiang, Donghua Yu

    Electricity demand forecasting plays a crucial role in energy planning and power system operation. However, it is affected by numerous factors and complex relationships, making accurate prediction challenging. Therefore, from the perspective of sample diversity in the base dataset, we propose an improved stacking-based ensemble regression algorithm to enhance the accuracy of electricity demand forecasting. Firstly, a continuous sampling strategy is constructed between the sample integration selection probability and the base dataset using D2-Sampling and KNN; secondly, multiple base regression models are integrated through stacking to improve the predictive performance. In the electricity demand forecasting experiments conducted on three different datasets and across multiple base models, the proposed improved stacking ensemble learning regression algorithm (DK-Stacking) achieved the best performance. This symmetric experimental evaluation ensured consistent and balanced assessment of the model performance across datasets and models, highlighting the robustness and generalization of the proposed algorithm. Compared to the ANN, SVR, and RF models, its prediction accuracy increased by more than 1 percentage point. Even when compared to the optimized XGBoost model, it showed an improvement of 0.44 percentage points. Overall, the proposed DK-Stacking demonstrates symmetry-inspired robustness in electricity demand forecasting through the balanced treatment of datasets and model integration.

  • Open Access

    Ensemble Clustering Method via Robust Consensus Learning

    by Jia Qu, Qidong Dai, Zekang Bian, Jie Zhou, Zhibin Jiang

    Although ensemble clustering methods based on the co-association (CA) matrix have achieved considerable success, they still face the following challenges: (1) in the label space, the noise within the connective matrices and the structural differences between them are often neglected, and (2) the rich structural information inherent in the feature space is overlooked. Specifically, for each connective matrix, a symmetric error matrix is first introduced in the label space to characterize the noise. Then, a set of mapping models is designed, each of which processes a denoised connective matrix to recover a reliable consensus matrix. Moreover, multi-order graph structures are introduced into the feature space to enhance the expressiveness of the consensus matrix further. To preserve a clear cluster structure, a theoretical rank constraint with a block-diagonal enhancement property is imposed on the consensus matrix. Finally, spectral clustering is applied to the refined consensus matrix to obtain the final clustering result. Experimental results demonstrate that ECM-RCL achieves superior clustering performance compared to several state-of-the-art methods.


  • Open Access

    Divide-and-Merge Parallel Hierarchical Ensemble DNNs with Local Knowledge Augmentation

    by Zhibin Jiang, Shuai Dong, Kaining Liu, Jie Zhou, Xiongtao Zhang

    Traditional deep neural networks (DNNs) often suffer from a time-consuming training process, which is restricted by accumulation of excessive network layers and a large amount of parameters. More neural units are required to be stacked to achieve desirable performance. Specifically, when dealing with large-scale datasets, a single DNN can hardly obtain the best performance on the available limited computing resources. To address the issues above, in this paper, a novel Parallel Hierarchical Ensemble Deep Neural Network (PH-E-DNN) is proposed to improve accuracy and efficiency of the deep network. Firstly, the fuzzy C-means algorithm (FCM) is adopted so that the large-scale dataset is separated into several small data partitions. As a benefit of the fuzzy partitioning of the FCM, several sub-models can be obtained through learning their respective data partitions and isolating them from the others. Secondly, the prediction results of each sub-model in the current level are used as the discriminative knowledge appended to original regional subsets, and predictions from each level symmetrically augment inputs for the next level. In the PH-E-DNN architecture, predictions from each level symmetrically augment inputs for the next level, creating a symmetrical flow of discriminative knowledge across the hierarchical structure. Finally, multiple regional subsets are merged to form a global augmented dataset, while multi-level parallel sub-models are stacked to organize a large-scale deep ensemble network. More importantly, only the multiple DNNs in the last level are ensembled to generate the decision result of the proposed PH-E-DNN. Extensive experiments demonstrate that the PH-E-DNN is superior to some traditional and deep learning models, only requiring a few parameters to be set, which demonstrates its efficiency and flexibility.

  • Open Access

    Multi-View Utility-Based Clustering: A Mutually Supervised Perspective

    by Zhibin Jiang, Jie Zhou, Shitong Wang

    Information in multiple views is typically symmetrical and distinctive. Multi-view clustering generally attempts to address two key issues: (1) how to mine/leverage additional useful information between different views for current view clustering, and (2) how to combine multiple clustering results from multiple views by using compatible and complementary information hidden in multiple views. In order to achieve this, we propose a multi-view clustering method, namely the multi-view utility-based clustering method (MUC), from the novel perspective of utility-based mutual supervision between different views. The proposed method, MUC, has notable merits: (1) It moves multi-view clustering from the level of feature and/or sample side to partition side information. That is, in order to handle the first issue, MUC considers how to use utility-based partition-level side information from all the other views for current view clustering. Such partition-level side information is consistent with human thinking; it is high-caliber and instructional for clustering. (2) The utility-based partition-level side information provided by other views complements current view information in a mutually supervised way. Then, we conduct multi-view clustering via a mutual supervision mode to circumvent the second issue. As a result, using an alternating optimization strategy, the objective function of MUC can be solved in a K-means-like way. Moreover, we leverage multi-view weight learning based on maximum entropy to integrate multi-view clustering results and further improve performance. The extensive experimental results on various multi-view datasets indicate that the proposed method is better than—or at least comparable to—the existing commonly used single- and multi-view clustering methods, in terms of both clustering performance and running speed.