Zhaogeng Liu

Zhaogeng Liu

Auto-generated profile, based on publicly available information

Zhaogeng Liu

School of Artificial Intelligence, Jilin University, China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
28 March 2023 in Pattern Recognition
Verified
Journal Article
Closed access
ZLZhaogeng Liu
Zhaogeng Liu
JYJielong Yang
Jielong Yang
LWLi Wang
Li Wang
YCYi Chang
Yi Chang

6 April 2020 in IEEE Access
Verified
Journal Article
Open access
BZBo Zhang
Bo Zhang
XYXinkai Yang
Xinkai Yang
BHBiao Hu
Biao Hu
ZLZhaogeng Liu
Zhaogeng Liu
ZLZhanshan Li
Zhanshan Li
Binary butterfly optimization approach (bBOA) is a recent high performing feature selection algorithm presented in 2018 which is based on the food foraging behavior of butterflies. This paper tries to improve the structure of the bBOA to enhance its classification accuracy, dimension reduction and reliability in feature selection task for who are interested in the fields of data mining and pattern recognition. The new initialization strategy and differential evolution strategy are applied to reduce the randomness of bBOA’s initialization and local search process. Then, a new parameter is added to make the bBOA’s transfer function more adaptive to the change of exploration and exploitation. Besides, evolution population dynamics (EPD) mechanism is employed as an extension of bBOA. The new method called optimization and extension of binary butterfly optimization approaches (OEbBOA) is tested with the K nearest neighbor classier in which twenty UCI datasets and seven recent algorithms are utilized to assess the performance of the OEbBOA algorithm. The experimental results and nonparametric Wilcoxons rank sum test confirm the efficiency of the proposed OEbBOA in maximizing classification accuracy while minimizing the number of features selected.

18 May 2023 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
ZLZhaogeng Liu
Zhaogeng Liu
JYJielong Yang
Jielong Yang
XZXionghu Zhong
Xionghu Zhong
WWWenwu Wang
Wenwu Wang
HCHechang Chen
Hechang Chen
YCYi Chang
Yi Chang
Graph neural networks (GNNs) have achieved great success in many fields due to their powerful capabilities of processing graph-structured data. However, most GNNs can only be applied to scenarios where graphs are known, but real-world data are often noisy or even do not have available graph structures. Recently, graph learning has attracted increasing attention in dealing with these problems. In this article, we develop a novel approach to improving the robustness of the GNNs, called composite GNN. Different from existing methods, our method uses composite graphs (C-graphs) to characterize both sample and feature relations. The C-graph is a unified graph that unifies these two kinds of relations, where edges between samples represent sample similarities, and each sample has a tree-based feature graph to model feature importance and combination preference. By jointly learning multiaspect C-graphs and neural network parameters, our method improves the performance of semisupervised node classification and ensures robustness. We conduct a series of experiments to evaluate the performance of our method and the variants of our method that only learn sample relations or feature relations. Extensive experimental results on nine benchmark datasets demonstrate that our proposed method achieves the best performance on almost all the datasets and is robust to feature noises.

30 January 2025 in Pattern Recognition
Verified
Journal Article
Closed access
SZShutong Zhang
Shutong Zhang
XCXing Chen
Xing Chen
ZLZhaogeng Liu
Zhaogeng Liu
HCHechang Chen
Hechang Chen
YCYi Chang
Yi Chang

14 June 2024 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
ZLZhaogeng Liu
Zhaogeng Liu
FJFeng Ji
Feng Ji
JYJielong Yang
Jielong Yang
XCXiaofeng Cao
Xiaofeng Cao
MZMuhan Zhang
Muhan Zhang
YCYi Chang
Yi Chang
Many graph neural networks (GNNs) are inapplicable when the graph structure representing the node relations is unavailable. Recent studies have shown that this problem can be effectively solved by jointly learning the graph structure and the parameters of GNNs. However, most of these methods learn graphs by using either a Euclidean or hyperbolic metric, which means that the space curvature is assumed to be either constant zero or constant negative. Graph embedding spaces usually have nonconstant curvatures, and thus, such an assumption may produce some obfuscatory nodes, which are improperly embedded and close to multiple categories. In this article, we propose a joint-space graph learning (JSGL) method for GNNs. JSGL learns a graph based on Euclidean embeddings and identifies Euclidean obfuscatory nodes. Then, the graph topology near the identified obfuscatory nodes is refined in hyperbolic space. We also present a theoretical justification of our method for identifying obfuscatory nodes and conduct a series of experiments to test the performance of JSGL. The results show that JSGL outperforms many baseline methods. To obtain more insights, we analyze potential reasons for this superior performance.

4 December 2025 in Pattern Recognition
Verified
Journal Article
Closed access
HCHaotian Chi
Haotian Chi
ZLZhaogeng Liu
Zhaogeng Liu
XCXing Chen
Xing Chen
BQBohao Qu
Bohao Qu
JHJifeng Hu
Jifeng Hu
YCYi Chang
Yi Chang