Jingwei Chen

Jingwei Chen

Auto-generated profile, based on publicly available information

Jingwei Chen

Jiangxi Academy of Water Science and Engineering, Jiangxi Key Laboratory of Flood and Drought Disaster Defense, Nanchang, P.R. China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
26 October 2022 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
JCJingwei Chen
Jingwei Chen
JZJianyong Zhu
Jianyong Zhu
HJHongyun Jiang
Hongyun Jiang
HYHui Yang
Hui Yang
FNFeiping Nie
Feiping Nie
The clustering method has been widely used in data mining, pattern recognition, and image identification. Fuzzy c-means (FCM) is a soft clustering method that introduces the concept of membership. In this method, the fuzzy membership matrix is obtained by calculating the distance between data points in the original space. However, these methods may yield suboptimal results owing to the influence of redundant features. Moreover, FCM is always sensitive to noise points and heavily subject to outliers. In this paper, we propose a method called sparsity FCM clustering with principal component analysis embedding (P_SFCM). We simultaneously conduct principal component analysis (PCA) and membership learning, and then add an additional weighting factor for each data point. The goal of this operation is to identify the noise or outliers. Overall, the benefit of our framework is that it retains most of the information in the subspace while improving the robustness of the noise. In this paper, we employ an iterative optimization algorithm to efficiently solve our model. To verify the reliability of the proposed method, we conduct a convergence analysis, noise robustness analysis, and multi-cluster experiments. Furthermore, comparative experiments are conducted on both synthetic and real benchmark datasets. The experimental results show that the P_SFCM is competitive with comparable methods.

26 July 2024 in Information Sciences
Verified
Journal Article
Closed access
JCJingwei Chen
Jingwei Chen
SXShiyu Xie
Shiyu Xie
HYHui Yang
Hui Yang
FNFeiping Nie
Feiping Nie

17 February 2025 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
JCJingwei Chen
Jingwei Chen
ZWZihan Wu
Zihan Wu
JCJingqing Cheng
Jingqing Cheng
XXXiaohua Xu
Xiaohua Xu
FNFeiping Nie
Feiping Nie
Graph clustering has become a crucial technique for uncovering community structures in complex network data. However, existing approaches often introduce cumbersome regularization or constraints (hyperparameter tuning burden) to obtain balanced clustering results, thereby increasing hyperparameter tuning requirements and intermediate variables. These limitations can lead to suboptimal performance, particularly in scenarios involving imbalanced clusters or large-scale datasets. Besides, most graph cut clustering methods solve two separate discrete problems, resulting in information loss and relying on time-consuming eigen-decomposition. To address these challenges, this paper propose an effective graph cut framework, termed Harmonic MaxMin Cut (HMMC), inspired by worst-case objective optimization and the harmonic mean. Unlike traditional spectral clustering, HMMC produces all cluster assignments in a single step, eliminating the need for additional discretization and notably enhancing robustness to “worst-case cluster” boundaries. this paper further devise a fast coordinate descent (CD) solver that scales linearly complexity with the graph size, offering a computationally efficient alternative to eigen decomposition. Extensive experiments on real-world datasets demonstrate that HMMC is comparable to, or even surpasses, state-of-the-art methods, while also finding more favorable local solutions than non-negative matrix factorization techniques.

14 June 2023 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
JCJingwei Chen
Jingwei Chen
SXShiyu Xie
Shiyu Xie
HJHongyun Jiang
Hongyun Jiang
HYHui Yang
Hui Yang
FNFeiping Nie
Feiping Nie
Owing to its simplicity, the traditional $k$ -means (Lloyd heuristic) clustering method plays a vital role in a variety of machine-learning applications. Disappointingly, the Lloyd heuristic is prone to local minima. In this article, we propose $k$ -mRSR, which converts the sum-of-squared error (SSE) (Lloyd) into a combinatorial optimization problem and incorporates a relaxed trace maximization term and an improved spectral rotation term. The main advantage of $k$ -mRSR is that it only needs to solve the membership matrix instead of computing the cluster centers in each iteration. Furthermore, we present a nonredundant coordinate descent method that brings the discrete solution infinitely close to the scaled partition matrix. Two novel findings from the experiments are that $k$ -mRSR can further decrease (increase) the objective function values of the $k$ -means obtained by Lloyd (CD), while Lloyd (CD) cannot decrease (increase) the objective function obtained by $k$ -mRSR. In addition, the results of extensive experiments on 15 datasets indicate that $k$ -mRSR outperforms both Lloyd and CD in terms of the objective function value and outperforms other state-of-the-art methods in terms of clustering performance.

26 February 2025 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
JCJingwei Chen
Jingwei Chen
SFShasha Fu
Shasha Fu
HYHui Yang
Hui Yang
FNFeiping Nie
Feiping Nie
Due to the excellent performance of spectral clustering (SC), it has been widely used in many fields of application. However, the high computational complexity and two successive steps have limited SC’s development. In addition, the traditional SC is formulated to maximize the arithmetic mean of trace ratios which is dominated by the larger objectives and may reduce the recognition accuracy in practical applications. In this article, we propose a novel graph cut criterion to minimize the trace ratios of harmonic mean with objectives, which can avoid the worst-cluster issue without imposing any regularization or constraints. Furthermore, an efficient and effective coordinate descent (CD) method is exploited to achieve a one-step solution. Therefore, this article can simultaneously solve three main challenges in a unified framework. Extensive experiments verify that the harmonic fast one-step graph cut (HFOC) achieves superior clustering performance with relatively less time-consuming compared to the other state-of-the-art clustering methods.

9 May 2025 in Knowledge-Based Systems
Verified
Journal Article
Closed access
JCJingwei Chen
Jingwei Chen
JCJingqing Cheng
Jingqing Cheng
XWXiaoxiao Wang
Xiaoxiao Wang
XXXiaohua Xu
Xiaohua Xu
FNFeiping Nie
Feiping Nie