Zhengkui Wang

Dr. Zhengkui Wang

orcid

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
29 October 2020 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
JLJing Lu
Jing Lu
YZYuhai Zhao
Yuhai Zhao
KTKian-Lee Tan
Kian-Lee Tan
ZWZhengkui Wang
Zhengkui Wang
Density Peaks (DP) Clustering organizes data into clusters by finding peaks in dense regions. This involves computing density ($\rho$ρ) and distance ($\delta$δ) of every point. As such, though DP has been very effective in producing high quality clusters, their complexity is O($N^2$N2) where $N$N is the number of data points. In this paper, we propose a fast distributed density peaks clustering algorithm, FDDP, based on the z-value index. In FDDP, we first employ the z-value index to map multi-dimensional data points into one dimensional space, and then range-partition the data according to the z-value to balance the load across the processing nodes. We ensure minimal overlapping range to handle computations at the boundary points. We also propose FC, an efficient algorithm that employs a forward computing strategy to calculate $\rho$ρ linearly. Additionally, we propose another algorithm, CB, which uses a caching and efficient searching strategy to compute $\delta$δ. Moreover, FDDP is able to reduce the time complexity from $O(N^2)$O(N2) to $O(N\cdot log(N))$O(N·log(N)). We provide a theoretical analysis of FDDP and evaluated FDDP empirically. Our experimental results show that FDDP outperforms the state-of-the-art algorithms significantly.

6 March 2024 in Neural Processing Letters
Verified
Journal Article
Open access
PDF file
LPLi-Hu Pan
Li-Hu Pan
JDJianzhong Diao
Jianzhong Diao
ZWZhengkui Wang
Zhengkui Wang
SPShouxin Peng
Shouxin Peng
CZCunhui Zhao
Cunhui Zhao
Pedestrian detection is crucial for various applications, including intelligent transportation and video surveillance systems. Although recent research has advanced pedestrian detection models like the YOLO series, they still face limitations in handling diverse pedestrian scales, leading to performance challenges. To address these issues, we propose HF-YOLO, an advanced pedestrian detection model. HF-YOLO tackles the complexities of pedestrian detection in complex scenes by addressing scale variations and occlusions among pedestrians. In the feature fusion stage, our algorithm leverages both shallow localization information and deep semantic information. This involves fusing P2 layer features and adding a high-resolution detection layer, significantly improving the detection of small-scale pedestrians and occluded instances. To enhance feature representation, HF-YOLO incorporates the HardSwish activation function, introducing more non-linear factors and strengthening the model’s ability to represent complex and discriminative features. Additionally, to address regression imbalance, a balance factor is introduced to the CIoU loss function. This modification effectively resolves the imbalance problem and enhances pedestrian localization accuracy. Experimental results demonstrate the effectiveness of our proposed algorithm. HF-YOLO achieves notable improvements, including a 3.52% increase in average precision, a 1.35% boost in accuracy, and a 4.83% enhancement in recall. Moreover, the algorithm maintains real-time performance with a detection time of 8.5ms, meeting the stringent requirements of real-time applications.

17 April 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
LLLing Li
Ling Li
YZYuhai Zhao
Yuhai Zhao
SLSiqiang Luo
Siqiang Luo
GWGuoren Wang
Guoren Wang
ZWZhengkui Wang
Zhengkui Wang
Given a graph, searching for a community containing a query vertex is a fundamental problem and has found many applications. Most existing community search models are based on non-attributed or vertex-attributed graphs. In many real-world graphs, however, the edges carry the richest information to describe the interactions between vertices; hence, it is important to take the information into account in community search. In this paper, we conduct a pioneer study on the community search on edge-attributed graphs. We proposed the Edge-Attributed Community Search (EACS) problem, which aims to extract a subgraph that contains the given query vertex while its edges have the maximum attribute similarity. We prove that the EACS problem is NP-hard and propose both exact and 2-approximation algorithms to address EACS. Our exact algorithms run up to 2320.34 times faster than the baseline solution. Our approximate algorithms further improve the efficiency by up to 2.93 times. We conducted extensive experiments to demonstrate the efficiency and effectiveness of our algorithms.

1 August 2023
Verified
Conference Paper
Open access
PDF file
SJSonghao Jiang
Songhao Jiang
YCYan Chu
Yan Chu
ZWZhengkui Wang
Zhengkui Wang
TMTianxing Ma
Tianxing Ma
HWHanlin Wang
Hanlin Wang
BWBo Wang
Bo Wang
Mixing data augmentation methods have been widely used in text classification recently. However, existing methods do not control the quality of augmented data and have low model explainability. To tackle these issues, this paper proposes an explainable text classification solution based on attentive and targeted mixing data augmentation, ATMIX. Instead of selecting data for augmentation without control, ATMIX focuses on the misclassified training samples as the target for augmentation to better improve the model's capability. Meanwhile, to generate meaningful augmented samples, it adopts a self-attention mechanism to understand the importance of the subsentences in a text, and cut and mix the subsentences between the misclassified and correctly classified samples wisely. Furthermore, it employs a novel dynamic augmented data selection framework based on the loss function gradient to dynamically optimize the augmented samples for model training. In the end, we develop a new model explainability evaluation method based on subsentence attention and conduct extensive evaluations over multiple real-world text datasets. The results indicate that ATMIX is more effective with higher explainability than the typical classification models, hidden-level, and input-level mixup models.


1 June 2022 in Knowledge-Based Systems
Verified
Journal Article
Closed access
LLLing Li
Ling Li
YZYuhai Zhao
Yuhai Zhao
YLYuan Li
Yuan Li
FWFazal Wahab
Fazal Wahab
ZWZhengkui Wang
Zhengkui Wang