Yizhang Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Yizhang Wang has a total of 52 co-authors. Here are the top co-authors by number of shared publications:
- Wei Pang
School of Mathematical and Computer Sciences, Heriot-Watt University, Edinburgh, Scotland, United Kingdom
7 shared publications - You Zhou
College of Computer Science and Technology, Jilin University, Changchun 130012, China
5 shared publications Di Wang
Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly, Nanyang Technological University, Jurong West, Singapore
4 shared publicationsWei Pang
3 shared publications- Xuming Han
College of Information Science and Technology, Jinan University, Guangzhou, China
3 shared publications You Zhou
3 shared publications
Latest Publications
- 1 April 2026
- Published by Springer Nature
- p. 667-675
Faster Words Memorization: Reaction Time-Aware Interval Repeat Memory Optimization
- 1 April 2026
- Published by Springer Nature
- p. 667-675
Faster Words Memorization: Reaction Time-Aware Interval Repeat Memory Optimization
- 24 February 2026
- Published by Elsevier in Pattern Recognition
- Vol. 177
BlockDPC: Distributed density peak clustering for large-scale data
- 24 February 2026
- Published by Elsevier in Pattern Recognition
- Vol. 177
BlockDPC: Distributed density peak clustering for large-scale data
- 17 October 2025
- Published by Springer Nature
- p. 203-212
IO-K-Means: Iterative Optimization for Centroids in K-Means
- 17 October 2025
- Published by Springer Nature
- p. 203-212
IO-K-Means: Iterative Optimization for Centroids in K-Means
- 19 August 2025
- Published by Elsevier in Neurocomputing
- Vol. 654
S2F: Border peeling clustering from cluster skeletons to final clusters
- 19 August 2025
- Published by Elsevier in Neurocomputing
- Vol. 654
S2F: Border peeling clustering from cluster skeletons to final clusters
- 18 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 36 (8) , 14131-14143
One-Shot Secure Federated K -Means Clustering Based on Density Cores
Federated clustering (FC) performs well in independent and identically distributed (IID) scenarios, but it does not perform well in non-IID scenarios. In addition, existing methods lack proof of strict privacy protection. To address the above issues, we propose a new secure federated k-means clustering framework to achieve better clustering results under privacy requirements. Specifically, for the clients, we use cluster centers (representative points) generated by k-means to represent the corresponding clusters. These representative points can effectively preserve the structure of the local data and they are encrypted by differential privacy. For the server, we propose two methods to reprocess the uploaded encrypted representative points to obtain better final cluster centers, one uses k-means, and the other considers the improved density peaks (density cores) as final centers and then sends them back to the clients. Finally, each client assigns local data to their nearest centers. Experimental results show that the proposed methods perform better than several centralized (nonfederated) classical clustering algorithms [k-means, density-based spatial clustering of applications with noise (DBSCAN), and density peak clustering (DPC)] and state-of-the-art (SOTA) centralized clustering algorithms in most cases. In particular, the proposed algorithms perform better than the SOTA FC framework k-FED (ICML2021) and MUFC (ICLR2023).
- 18 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 36 (8) , 14131-14143
One-Shot Secure Federated K -Means Clustering Based on Density Cores
Federated clustering (FC) performs well in independent and identically distributed (IID) scenarios, but it does not perform well in non-IID scenarios. In addition, existing methods lack proof of strict privacy protection. To address the above issues, we propose a new secure federated k-means clustering framework to achieve better clustering results under privacy requirements. Specifically, for the clients, we use cluster centers (representative points) generated by k-means to represent the corresponding clusters. These representative points can effectively preserve the structure of the local data and they are encrypted by differential privacy. For the server, we propose two methods to reprocess the uploaded encrypted representative points to obtain better final cluster centers, one uses k-means, and the other considers the improved density peaks (density cores) as final centers and then sends them back to the clients. Finally, each client assigns local data to their nearest centers. Experimental results show that the proposed methods perform better than several centralized (nonfederated) classical clustering algorithms [k-means, density-based spatial clustering of applications with noise (DBSCAN), and density peak clustering (DPC)] and state-of-the-art (SOTA) centralized clustering algorithms in most cases. In particular, the proposed algorithms perform better than the SOTA FC framework k-FED (ICML2021) and MUFC (ICLR2023).
- 13 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 20 (11) , 13262-13272
One-Shot Federated Clustering Based on Stable Distance Relationships
Federated clustering (FC) is an emerging and important topic in data clustering research. However, for existing works, there are two challenging issues as follows. 1) FC does not perform well on non-IID data. 2) Differential privacy is a common-used way to protect raw data in FC, but there is no solid theoretical basis for selecting privacy budget $\epsilon$ in Laplacian noise, and $\epsilon$ is randomly set in most algorithms. In this article, we propose a new framework called NN-FC for addressing the above-mentioned issues. Specifically, 1) we provide a rigorous mathematical proof when selecting $\epsilon$ , we have shown that when the value of $\epsilon$ satisfies certain conditions, the neighbor relationship of data points before and after adding Laplacian noises remains unchanged. 2) According to 1), we propose a new method of obtaining global cluster centers based on distance relationships at the server, and the results of clustering the original data and clustering the privacy data become close. The experimental results show that NN-FC performs better than eight traditional and state-of-the-art (SOTA) centralized (nonfederated) clustering algorithms. In particular, NN-FC performs better than two SOTA FC frameworks k-FED (ICML2021) and MUFC (ICLR2023).
- 13 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 20 (11) , 13262-13272
One-Shot Federated Clustering Based on Stable Distance Relationships
Federated clustering (FC) is an emerging and important topic in data clustering research. However, for existing works, there are two challenging issues as follows. 1) FC does not perform well on non-IID data. 2) Differential privacy is a common-used way to protect raw data in FC, but there is no solid theoretical basis for selecting privacy budget $\epsilon$ in Laplacian noise, and $\epsilon$ is randomly set in most algorithms. In this article, we propose a new framework called NN-FC for addressing the above-mentioned issues. Specifically, 1) we provide a rigorous mathematical proof when selecting $\epsilon$ , we have shown that when the value of $\epsilon$ satisfies certain conditions, the neighbor relationship of data points before and after adding Laplacian noises remains unchanged. 2) According to 1), we propose a new method of obtaining global cluster centers based on distance relationships at the server, and the results of clustering the original data and clustering the privacy data become close. The experimental results show that NN-FC performs better than eight traditional and state-of-the-art (SOTA) centralized (nonfederated) clustering algorithms. In particular, NN-FC performs better than two SOTA FC frameworks k-FED (ICML2021) and MUFC (ICLR2023).
- Open Access
- 26 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
One-shot Federated K-means Clustering based on Density Cores
Federated clustering (FC) is an emerging and important topic that clustering all the data from many different heterogeneous clients/devices while prohibiting clients from sharing raw data. However, for existing works, there are some problems: (1) federated learning performs well in independent and identically distributed (IID) scenarios, but for Non-IID scenarios (Non-Identical class distribution), it is hard to collaboratively train a clustering algorithm based on global similarity measure while keeping all data local. (2) Some federated clustering algorithms have good performance, but their communication costs are high. It is difficult to balance communication costs and clustering effectiveness. In this paper, we propose new federated k-means clustering framework to solve the above two problems and balance communication costs and clustering effectiveness. (1) For the clients, we use cluster centers (representative points) genearate by K-means to represent the corresponding clusters because these representative points form density backbone of clusters and can effectively preserve the structure of the local data. (2) For the server, we propose two methods to reprocess these uploaded encrypted representative points to obtain better final cluster centers, one uses K-means and the other takes the improved density peaks (density cores) as final centers, and then send them back to the clients. Finally, each client assign local data to the nearest centers. The experimental results show that the proposed method performs better than some centralized (non-federated) classical clustering algorithms (K-means, DBSCAN and density peak clustering) and state-of-the-art (SOTA) centralized clustering algorithms in most cases. In particular, the proposed algorithms performs better than SOTA federated clustering framework k-FED (ICML2021) and MUFC (ICLR2023).
- 26 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessOne-shot Federated K-means Clustering based on Density Cores
Federated clustering (FC) is an emerging and important topic that clustering all the data from many different heterogeneous clients/devices while prohibiting clients from sharing raw data. However, for existing works, there are some problems: (1) federated learning performs well in independent and identically distributed (IID) scenarios, but for Non-IID scenarios (Non-Identical class distribution), it is hard to collaboratively train a clustering algorithm based on global similarity measure while keeping all data local. (2) Some federated clustering algorithms have good performance, but their communication costs are high. It is difficult to balance communication costs and clustering effectiveness. In this paper, we propose new federated k-means clustering framework to solve the above two problems and balance communication costs and clustering effectiveness. (1) For the clients, we use cluster centers (representative points) genearate by K-means to represent the corresponding clusters because these representative points form density backbone of clusters and can effectively preserve the structure of the local data. (2) For the server, we propose two methods to reprocess these uploaded encrypted representative points to obtain better final cluster centers, one uses K-means and the other takes the improved density peaks (density cores) as final centers, and then send them back to the clients. Finally, each client assign local data to the nearest centers. The experimental results show that the proposed method performs better than some centralized (non-federated) classical clustering algorithms (K-means, DBSCAN and density peak clustering) and state-of-the-art (SOTA) centralized clustering algorithms in most cases. In particular, the proposed algorithms performs better than SOTA federated clustering framework k-FED (ICML2021) and MUFC (ICLR2023).
- 26 January 2024
- Published by Elsevier in Neurocomputing
- Vol. 576
MDBSCAN: A multi-density DBSCAN based on relative density
- 26 January 2024
- Published by Elsevier in Neurocomputing
- Vol. 576
MDBSCAN: A multi-density DBSCAN based on relative density
- 29 September 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 238
Density peak clustering algorithms: A review on the decade 2014–2023
- 29 September 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 238
Density peak clustering algorithms: A review on the decade 2014–2023
- Open Access
Adaptive Density Spatial Clustering Method Fusing Chameleon Swarm Algorithm
The density-based spatial clustering of application with noise (DBSCAN) algorithm is able to cluster arbitrarily structured datasets. However, the clustering result of this algorithm is exceptionally sensitive to the neighborhood radius (Eps) and noise points, and it is hard to obtain the best result quickly and accurately with it. To solve the above problems, we propose an adaptive DBSCAN method based on the chameleon swarm algorithm (CSA-DBSCAN). First, we take the clustering evaluation index of the DBSCNA algorithm as the objective function and use the chameleon swarm algorithm (CSA) to iteratively optimize the evaluation index value of the DBSCAN algorithm to obtain the best Eps value and clustering result. Then, we introduce the theory of deviation in the data point spatial distance of the nearest neighbor search mechanism to assign the identified noise points, which solves the problem of over-identification of the algorithm noise points. Finally, we construct color image superpixel information to improve the CSA-DBSCAN algorithm’s performance regarding image segmentation. The simulation results of synthetic datasets, real-world datasets, and color images show that the CSA-DBSCAN algorithm can quickly find accurate clustering results and segment color images effectively. The CSA-DBSCAN algorithm has certain clustering effectiveness and practicality.
Open AccessAdaptive Density Spatial Clustering Method Fusing Chameleon Swarm Algorithm
The density-based spatial clustering of application with noise (DBSCAN) algorithm is able to cluster arbitrarily structured datasets. However, the clustering result of this algorithm is exceptionally sensitive to the neighborhood radius (Eps) and noise points, and it is hard to obtain the best result quickly and accurately with it. To solve the above problems, we propose an adaptive DBSCAN method based on the chameleon swarm algorithm (CSA-DBSCAN). First, we take the clustering evaluation index of the DBSCNA algorithm as the objective function and use the chameleon swarm algorithm (CSA) to iteratively optimize the evaluation index value of the DBSCAN algorithm to obtain the best Eps value and clustering result. Then, we introduce the theory of deviation in the data point spatial distance of the nearest neighbor search mechanism to assign the identified noise points, which solves the problem of over-identification of the algorithm noise points. Finally, we construct color image superpixel information to improve the CSA-DBSCAN algorithm’s performance regarding image segmentation. The simulation results of synthetic datasets, real-world datasets, and color images show that the CSA-DBSCAN algorithm can quickly find accurate clustering results and segment color images effectively. The CSA-DBSCAN algorithm has certain clustering effectiveness and practicality.