Honghao Zhu

Dr. Honghao Zhu

orcid

Research Focus & Metrics

Representative Publications

View All Publications
15 January 2020 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
ZHZhenhua Huang
Zhenhua Huang
XXXin Xu
Xin Xu
HZHonghao Zhu
Honghao Zhu
Mengchu ZhouMengchu Zhou
Mengchu Zhou
Group recommendation research has recently received much attention in a recommender system community. Currently, several deep-learning-based methods are used in group recommendation to learn preferences of groups on items and predict the next ones in which groups may be interested. However, their recommendation effectiveness is disappointing. To address this challenge, this article proposes a novel model called a multiattention-based group recommendation model (MAGRM). It well utilizes multiattention-based deep neural network structures to achieve accurate group recommendation. We train its two closely related modules: vector representation for group features and preference learning for groups on items. The former is proposed to learn to accurately represent each group's deep semantic features. It integrates four aspects of subfeatures: group co-occurrence, group description, and external and internal social features. In particular, we employ multiattention networks to learn to capture internal social features for groups. The latter employs a neural attention mechanism to depict preference interactions between each group and its members and then combines group and item features to accurately learn group preferences on items. Through extensive experiments on two real-world databases, we show that MAGRM remarkably outperforms the state-of-the-art methods in solving a group recommendation problem.

1 September 2020 in Neurocomputing
Verified
Journal Article
Closed access
HZHonghao Zhu
Honghao Zhu
GLGuanjun Liu
Guanjun Liu
Mengchu ZhouMengchu Zhou
Mengchu Zhou
YXYu Xie
Yu Xie
AAAbdullah Abusorrah
Abdullah Abusorrah
QKQi Kang
Qi Kang

7 March 2023 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
HZHonghao Zhu
Honghao Zhu
Mengchu ZhouMengchu Zhou
Mengchu Zhou
GLGuanjun Liu
Guanjun Liu
YXYu Xie
Yu Xie
SLShijun Liu
Shijun Liu
CGCheng Guo
Cheng Guo
Since minority samples are substantially less common than majority samples, many industrial applications, such as credit card fraud detection (CCFD) and defective part identification, call for imbalanced classification. The performance of a classifier tends to suffer from the noisy samples in majority or minority classes. This work proposes a new undersampling scheme, called a clustering-based noisy-sample-removed undersampling scheme (NUS) for imbalanced classification. The majority class samples are first clustered. The distance of the majority class sample from the cluster center that is furthest away is used as the radius to build a hypersphere, with each cluster’s center assumed to be a spherical center. We determine the Euclidean distance between the center of a cluster and each minority sample to find whether they are in the hypersphere or not. Afterward, we exclude noisy samples from the minority class. The noisy samples of majority classes are removed by using the same procedure. Second, we propose an NUS, which combines noisy sample removal with undersampling techniques. Finally, to prove the effectiveness of NUS, we integrate NUS with the basic classifiers random forest (RF), decision tree (DT), and logistics regression (LR). We conduct their comparison with seven undersampling, oversampling, and noisy-sample-removed methods. This work performs experiments on 13 public and three real transaction datasets related to e-commerce. The results show that NUS plays a positive role in promoting existing classifiers’ performance.

15 April 2025 in IEEE/CAA Journal of Automatica Sinica
Verified
Journal Article
Closed access
YXYu Xie
Yu Xie
Mengchu ZhouMengchu Zhou
Mengchu Zhou
GLGuanjun Liu
Guanjun Liu
LWLifei Wei
Lifei Wei
HZHonghao Zhu
Honghao Zhu
Pasquale De MeoPasquale De Meo
Pasquale De Meo
The task of detecting fraud in credit card transactions is crucial to ensure the security and stability of a financial system, as well as to enforce customer confidence in digital payment systems. Historically, credit card companies have used rule-based approaches to detect fraudulent transactions, but these have proven inadequate due to the complexity of fraud strategies and have been replaced by much more powerful solutions based on machine learning or deep learning algorithms. Despite significant progress, the current approaches to fraud detection suffer from a number of limitations: for example, it is unclear whether some transaction features are more effective than others in discriminating fraudulent transactions, and they often neglect possible correlations among transactions, even though they could reveal illicit behaviour. In this paper, we propose a novel credit card fraud detection (CCFD) method based on a transaction behaviour-based hierarchical gated network. First, we introduce a feature-oriented extraction module capable of identifying key features from original transactions, and such analysis is effective in revealing the behavioural characteristics of fraudsters. Second, we design a transaction-oriented extraction module capable of capturing the correlation between users' historical and current transactional behaviour. Such information is crucial for revealing users' sequential behaviour patterns. Our approach, called transactional-behaviour-based hierarchical gated network model (TbHGN), extracts two types of new transactional features, which are then combined in a feature interaction module to learn the final transactional representations used for CCFD. We have conducted extensive experiments on a real-world credit card transaction dataset with an increase in average F1 between 1.42% and 6.53% and an improvement in average AUC between 0.63% and 2.78% over the state of the art.

9 July 2019 in IEEE Access
Verified
Journal Article
Open access
HZHonghao Zhu
Honghao Zhu
GLGuanjun Liu
Guanjun Liu
Mengchu ZhouMengchu Zhou
Mengchu Zhou
YXYu Xie
Yu Xie
QKQi Kang
Qi Kang
A dandelion algorithm (DA) is a recently-proposed intelligent optimization algorithm and shows an excellent performance in solving function optimization problems. However, like other intelligent algorithms, it converges slowly and falls into local optima easily. In order to overcome these two flaws, a dandelion algorithm with probability-based mutation (DAPM) is proposed in this paper. In DAPM, both Gaussian and Levy mutations can be used interchangeably according to a given probability model. In this paper, three probability models are discussed, namely linear, binomial and exponential models. Experiments show that DAPM achieves better overall performance on standard test functions than DA.

29 January 2024 in IEEE/CAA Journal of Automatica Sinica
Verified
Journal Article
Closed access
HZHonghao Zhu
Honghao Zhu
Mengchu ZhouMengchu Zhou
Mengchu Zhou
YXYu Xie
Yu Xie
Aiiad AlbeshriAiiad Albeshri
Aiiad Albeshri
A dandelion algorithm (DA) is a recently developed intelligent optimization algorithm for function optimization problems. Many of its parameters need to be set by experience in DA, which might not be appropriate for all optimization problems. A self-adapting and efficient dandelion algorithm is proposed in this work to lower the number of DA's parameters and simplify DA's structure. Only the normal sowing operator is retained; while the other operators are discarded. An adaptive seeding radius strategy is designed for the core dandelion. The results show that the proposed algorithm achieves better performance on the standard test functions with less time consumption than its competitive peers. In addition, the proposed algorithm is applied to feature selection for credit card fraud detection (CCFD), and the results indicate that it can obtain higher classification and detection performance than the-state-of-the-art methods.