Wenhua Zeng

Dr. Wenhua Zeng

orcid

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
25 December 2017 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
HXHang Xu
Hang Xu
WZWenhua Zeng
Wenhua Zeng
Defu ZhangDefu Zhang
Defu Zhang
XZXIANGXIANG ZENG
XIANGXIANG ZENG
Recently, numerous multiobjective evolutionary algorithms (MOEAs) have been proposed to solve the multiobjective optimization problems (MOPs). One of the most widely studied MOEAs is that based on decomposition (MOEA/D), which decomposes an MOP into a series of scalar optimization subproblems, via a set of uniformly distributed weight vectors. MOEA/D shows excellent performance on most mild MOPs, but may face difficulties on ill MOPs, with complex Pareto fronts, which are pointed, long tailed, disconnected, or degenerate. That is because the weight vectors used in decomposition are all preset and invariant. To overcome it, a new MOEA based on hierarchical decomposition (MOEA/HD) is proposed in this paper. In MOEA/HD, subproblems are layered into different hierarchies, and the search directions of lower-hierarchy subproblems are adaptively adjusted, according to the higher-hierarchy search results. In the experiments, MOEA/HD is compared with four state-of-the-art MOEAs, in terms of two widely used performance metrics. According to the empirical results, MOEA/HD shows promising performance on all the test problems.

31 July 2018 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
HXHang Xu
Hang Xu
WZWenhua Zeng
Wenhua Zeng
XZXIANGXIANG ZENG
XIANGXIANG ZENG
GYGary G. Yen
Gary G. Yen
The existing multiobjective evolutionary algorithms (EAs) based on nondominated sorting may encounter serious difficulties in tackling many-objective optimization problems (MaOPs), because the number of nondominated solutions increases exponentially with the number of objectives, leading to a severe loss of selection pressure. To address this problem, some existing many-objective EAs (MaOEAs) adopt Euclidean or Manhattan distance to estimate the convergence of each solution during the environmental selection process. Nevertheless, either Euclidean or Manhattan distance is a special case of Minkowski distance with the order P = 2 or P = 1, respectively. Thus, it is natural to adopt Minkowski distance for convergence estimation, in order to cover various types of Pareto fronts (PFs) with different concavity-convexity degrees. In this paper, a Minkowski distance-based EA is proposed to solve MaOPs. In the proposed algorithm, first, the concavity-convexity degree of the approximate PF, denoted by the value of P, is dynamically estimated. Subsequently, the Minkowski distance of order P is used to estimate the convergence of each solution. Finally, the optimal solutions are selected by a comprehensive method, based on both convergence and diversity. In the experiments, the proposed algorithm is compared with five state-of-the-art MaOEAs on some widely used benchmark problems. Moreover, the modified versions for two compared algorithms, integrated with the proposed P-estimation method and the Minkowski distance, are also designed and analyzed. Empirical results show that the proposed algorithm is very competitive against other MaOEAs for solving MaOPs, and two modified compared algorithms are generally more effective than their predecessors.

6 June 2023 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
YLYuanguo Lin
Yuanguo Lin
YLYong Liu
Yong Liu
FLFan Lin
Fan Lin
LZLixin Zou
Lixin Zou
PWPengcheng Wu
Pengcheng Wu
CMChunyan Miao
Chunyan Miao
Recommender systems have been widely applied in different real-life scenarios to help us find useful information. In particular, reinforcement learning (RL)-based recommender systems have become an emerging research topic in recent years, owing to the interactive nature and autonomous learning ability. Empirical results show that RL-based recommendation methods often surpass supervised learning methods. Nevertheless, there are various challenges in applying RL in recommender systems. To understand the challenges and relevant solutions, there should be a reference for researchers and practitioners working on RL-based recommender systems. To this end, we first provide a thorough overview, comparisons, and summarization of RL approaches applied in four typical recommendation scenarios, including interactive recommendation, conversational recommendation, sequential recommendation, and explainable recommendation. Furthermore, we systematically analyze the challenges and relevant solutions on the basis of existing literature. Finally, under discussion for open issues of RL and its limitations of recommender systems, we highlight some potential research directions in this field.

12 March 2022 in Knowledge-Based Systems
Verified
Journal Article
Closed access
YLYuanguo Lin
Yuanguo Lin
FLFan Lin
Fan Lin
WZWenhua Zeng
Wenhua Zeng
JXJianbing Xiahou
Jianbing Xiahou
LLLi Li
Li Li
CMChunyan Miao
Chunyan Miao

4 February 2020 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
HXHang Xu
Hang Xu
WZWenhua Zeng
Wenhua Zeng
XZXIANGXIANG ZENG
XIANGXIANG ZENG
GYGary G. Yen
Gary G. Yen
Over the past two decades, numerous multi- and many-objective evolutionary algorithms (MOEAs and MaOEAs) have been proposed to solve the multi- and many-objective optimization problems (MOPs and MaOPs), respectively. It is known that the difficulty of maintaining the convergence and diversity performances rapidly grows as the number of objectives increases. This phenomenon is especially evident for the Pareto-dominance-based EAs, because the nondominated sorting often fails to provide enough convergent pressure toward the Pareto front (PF). Therefore, many researchers came up with some non-Pareto-dominance-based EAs, which are based on indicator, decomposition, and so on. In this article, we propose a polar-metric ( p-metric)-based EA (PMEA) for tackling both MOPs and MaOPs. p-metric is a recently proposed performance indicator which adopts a set of uniformly distributed direction vectors. In PMEA, we use a two-phase selection which combines both nondominated sorting and p-metric. Moreover, a modification is proposed to adjust the direction vectors of p-metric dynamically. In the experiments, PMEA is compared with six state-of-the-art EAs in total and is measured by three performance metrics, including p-metric. According to the empirical results, PMEA shows promising performances on most of the test problems, involving both MOPs and MaOPs.

10 December 2023 in Neural Computing and Applications
Verified
Journal Article
Closed access
PDF file
YLYuanguo Lin
Yuanguo Lin
WZWei Zhang
Wei Zhang
FLFan Lin
Fan Lin
WZWenhua Zeng
Wenhua Zeng
XZXiuze Zhou
Xiuze Zhou
PWPengcheng Wu
Pengcheng Wu