Chenglong Zhang

Chenglong Zhang

Auto-generated profile, based on publicly available information

Chenglong Zhang

School of Information Science and Technology, Hangzhou Normal University, Hangzhou, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
12 November 2024 in Pattern Recognition
Verified
Journal Article
Closed access
BJBingbing Jiang
Bingbing Jiang
JLJun Liu
Jun Liu
ZWZidong Wang
Zidong Wang
CZChenglong Zhang
Chenglong Zhang
JYJie Yang
Jie Yang
WDWeiping Ding
Weiping Ding

3 September 2025 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
BJBingbing Jiang
Bingbing Jiang
CZChenglong Zhang
Chenglong Zhang
ZWZhongli Wang
Zhongli Wang
XLXinyan Liang
Xinyan Liang
Peng ZhouPeng Zhou
Peng Zhou
YLYi Liu
Yi Liu
To partition samples into distinct clusters, Fuzzy C-Means (FCM) calculates the membership degrees of samples to cluster centers and provides soft labels, gaining significant attention in recent years. However, existing FCM methods encounter the following challenges. First, traditional FCM focuses on learning membership degrees, neglecting the data similarity structures. Second, graph-based FCM typically separates graph construction from clustering, overlooking the knowledge interaction between graphs and clustering, obtaining suboptimal performance. Third, exploring the similarity structures among all samples is computationally expensive for large-scale tasks. To solve these dilemmas, we propose a scalable fuzzy clustering with collaborative structure learning and preservation (CSLP), which simultaneously leverages both cluster information and similarity structures to learn an optimal membership degree representation. Specifically, a self-weighted manner is devised to measure the sample importance, thereby reducing the adverse impacts of outliers. Moreover, the graph is updated according to the data similarities in the membership degree representation, such that CSLP collaboratively learns the graph and membership degrees in a mutually reinforcing manner. Thus, the similarity structures are fully explored during clustering processes and preserved in the learned membership degrees, enhancing the discrimination of clustering labels. To further improve efficiency, an acceleration solution is developed to reduce the computational cost of CSLP by propagating membership degrees from potential centers to samples, making CSLP scalable for large-scale tasks. An iterative strategy is designed to solve the formulated objective function. Extensive experiments demonstrate that CSLP outperforms other fuzzy clustering methods in terms of both effectiveness and scalability.

21 March 2024 in IEEE Transactions on Emerging Topics in Computational Intelligence
Verified
Journal Article
Closed access
CZChenglong Zhang
Chenglong Zhang
XZXinjie Zhu
Xinjie Zhu
ZWZidong Wang
Zidong Wang
YZYan Zhong
Yan Zhong
WSWeiguo Sheng
Weiguo Sheng
BJBingbing Jiang
Bingbing Jiang
Data fusion has become an important task in multi-view learning. Previous methods suffer from the insufficient data fusion due to the following issues: (i) Several methods ignore the correlation and distinction among views and directly concatenate the features from different views; (ii) They involve intractable parameters to balance different views, degenerating the applicability of models; (iii) A fixed label matrix is used to guide feature fusion, overlooking the distances between different classes (i.e., inter-class distance) or within the same class (i.e., intra-class compactness). To overcome these problems, a novel fusion model is proposed to discriminate different views and samples in an adaptive manner, so as to effectively reduce the adverse impacts of low-quality views and outliers. In contrast to existing methods, a flexible regression target is designed to take full advantage of the label information of data, such that both the inter-class distance and the intra-class compactness are preserved. Benefiting from this, a compact and discriminative representation of multiple views is learned to maintain the consistent and complementary information of diverse views. Extensive experiments validate the effectiveness and the superiority of our proposed model.

28 October 2024
Verified
Conference Paper
Open access
CZChenglong Zhang
Chenglong Zhang
XLXinyan Liang
Xinyan Liang
Peng ZhouPeng Zhou
Peng Zhou
ZLZhaolong Ling
Zhaolong Ling
YZYingwei Zhang
Yingwei Zhang
BJBingbing Jiang
Bingbing Jiang
To tackle the high-dimensional data with multiple representations, multi-view unsupervised feature selection has emerged as a significant learning paradigm. However, previous methods suffer from the following dilemmas: (i) They focus on selecting the features that preserve the similarity structure of data, whereas neglecting the discriminative information in the cluster structure; (ii) The orthogonal constraint is often imposed on the pseudo cluster labels, breaking the locality in the cluster label space; (iii) Learning the similarity or cluster structure from all samples is time-consuming. To this end, a Scalable Multi-view Unsupervised Feature Selection with structure learning and fusion (SMUFS) is proposed to jointly exploit the cluster structure and the similarity relations of data. Specifically, SMUFS introduces the sample-view weights to adaptively fuse the membership matrices that indicate cluster structures and serve as the pseudo cluster labels, such that a unified membership matrix across views can be effectively obtained to guide feature selection. Meanwhile, SMUFS performs graph learning from the membership matrix, preserving the locality of cluster labels and improving their discriminative capability. Further, an acceleration strategy has been developed to make SMUFS scalable for large-scale data. An iterative optimization is designed to solve the formulated objective function, and extensive experiments demonstrate the superiority of SMUFS.

20 April 2026
Verified
Conference Paper
Open access
BJBingbing Jiang
Bingbing Jiang
ZWZhongli Wang
Zhongli Wang
JYJie Yang
Jie Yang
Guangkui XuGuangkui Xu
Guangkui Xu
Wei ChenWei Chen
Wei Chen
Weiping DingWeiping Ding
Weiping Ding
Clustering on high-dimensional and low sample size (HDLSS) data remains a critical, persistent challenge where extreme sparsity and noise confound cluster analysis. This creates a dilemma: spectral methods fail as distance metrics degrade, while deep clustering tends to over-fit scarce data. To break this dilemma, a Self-Enhanced Density Clustering (SEDC) framework that integrates the cluster structure discovery and embedding representation learning into an iterative enhancement process is proposed in this paper. Specifically, SEDC uses adaptive density-derived centroids to parameterize probabilistic soft labels, which in turn supervise a lightweight multilayer perceptron (MLP) to learn the low-dimensional embedding from data. The resulting embedding provides a refined metric space for further generating superior labels in the subsequent interaction process. This feedback forms a mutual reinforcement that progressively enhances the discrimination of embedding while rigorously mitigating over-fitting. Extensive experiments on 43 challenging HDLSS datasets demonstrate state-of-the-art performance, substantially outperforming popular clustering methods. This work delivers a principled and promising solution for robust data clustering in HDLSS situations.

22 September 2023
Verified
Conference Paper
Open access
YLYangfeng Lu
Yangfeng Lu
CZChenglong Zhang
Chenglong Zhang
BJBingbing Jiang
Bingbing Jiang
Recent years have witnessed the proliferation of semi-supervised feature selection, which can select a subset of discrimi-native features for subsequent tasks with a small amount of class label information. However, traditional methods cannot efficiently handle large-scale problems and often fail to mine the reliable similarity structure of data. To address these issues, a novel model is proposed in this paper, called Accelerated Semi-supervised Feature Selection (ASFS). Specifically, a bipartite graph between samples and anchors is adaptively constructed in the feature projection subspace to significantly reduce the computational costs of graph learning and solution procedures, so that the main computational complexity of ASFS is linearly dependent on the number of training data. Moreover, graph learning and feature selection are integrated into a unified framework, wherein they can benefit from each other. Therefore, the interference of noisy features can be largely alleviated, and meanwhile, more informative features will be selected under the guidance of the learned similarity graph. The effectiveness and efficiency of ASFS are validated by extensive experiments on multiple datasets.