Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zhengze Li

dblp:247/4109 · DBLP profile ↗
← Back
9ranked-venue papers
5as first author
7since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 4 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author · 2 since 2021Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Graph learning · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational finance and economics · 100%
Databases, data mining, and information retrieval
1 paper
Web and social media mining · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph construction
0.912025
COGRASP: Co-Occurrence Graph Based Stock Price Forecasting · IJCAI 2025
Computational finance and economics › financial market prediction
stock price prediction
0.912025
COGRASP: Co-Occurrence Graph Based Stock Price Forecasting · IJCAI 2025
Web and social media mining
social media analysis
0.912025
COGRASP: Co-Occurrence Graph Based Stock Price Forecasting · IJCAI 2025

Methods — techniques the papers use, named apart from their topics

multi-timescale aggregation · 2.6
YearPublicationVenuePosition
2026 Segment Routing Header (SRH)-Aware Traffic Engineering in Hybrid IP/SRv6 Networks With Deep Reinforcement Learning
abstract
Segment Routing over IPv6 (SRv6) gives operators explicit path control and alleviates network congestion, making it a compelling technique for traffic engineering (TE). Yet two practical hurdles slow adoption. First, a one-shot upgrade of every traditional device is prohibitively expensive, so operators must prioritize which devices to upgrade. Second, the Segment Routing Header (SRH) increases packet size; if TE algorithms ignore this overhead, they will underestimate link load and may cause congestion in practice. We address both challenges with DRL-TE, an algorithm that couples deep reinforcement learning (DRL) with a lightweight local search (LS) step to minimize the network’s maximum link utilization (MLU). DRL-TE first identifies the smallest set of critical devices whose upgrade yields the largest drop in MLU, enabling hybrid IP/SRv6 networks to approach optimal performance with minimal investment. It then computes SRH-aware routes, and the DRL agent, augmented by a fast LS refinement, rapidly reduces MLU even under traffic variation. Experiments on an 11-node hardware testbed and three larger simulated topologies show that upgrading about 30% of devices allows DRL-TE to match fully upgraded networks and reduce MLU by up to 34% compared with existing algorithms. DRL-TE also maintains high performance under link failures and traffic variations, offering a cost-effective and robust path toward incremental SRv6 deployment.
Shuyi Liu, Zhengze Li, Fangyu Zhang, Hancheng Lu, Lizhe Liu
IEEE Trans. Netw. Serv. Manag.3
2025 COGRASP: Co-Occurrence Graph Based Stock Price Forecasting
abstract
Forecasting stock prices is complex and challenging. Uncovering correlations among stocks has proven to enhance stock price forecasting. However, existing correlation discovery methods, such as concept-based methods, are slow, inaccurate, and limited by their reliance on predefined concepts and manual analysis. In this paper, we propose COGRASP, a novel approach for stock price forecasting that constructs stock co-occurrence graphs automatically by analyzing rapidly updated sources such as reports, newspapers, and social media. Besides, we aggregate forecasts across multiple timescales (i.e., long-, medium-, and short-term) to capture multi-timescale trends fluctuations, thereby enhancing price forecasting accuracy. In experiments with real-world open-source stock market data, COGRASP outperforms state-of-the-art methods.
Zhengze Li, Zilin Song, Tingting Yuan 0001, Xiaoming Fu 0001
IJCAI1
2023 Adversarial feature hybrid framework for steganography with shifted window local loss
Zhengze Li, Xiaoyuan Yang 0003, Kangqing Shen, Fazhen Jiang, Jin Jiang 0003, Huwei Ren
Neural Networks1
2023 DuaFace: Data uncertainty in angular based loss for face recognition
Fazhen Jiang, Xiaoyuan Yang 0003, Huwei Ren, Zhengze Li, Kangqing Shen, Jin Jiang 0003
Pattern Recognit. Lett.4
2022 Dual branch parallel steganographic framework based on multi-scale distillation in framelet domain
Zhengze Li, Xiaoyuan Yang 0003, Kangqing Shen, Fazhen Jiang, Jin Jiang 0003, Huwei Ren
Neurocomputing1
2022 MultiBSP: multi-branch and multi-scale perception object tracking framework based on siamese CNN
Jin Jiang 0003, Xiaoyuan Yang 0003, Zhengze Li, Kangqing Shen, Fazhen Jiang, Huwei Ren
Neural Comput. Appl.3
2021 PSGU: Parametric self-circulation gating unit for deep neural networks
Zhengze Li, Xiaoyuan Yang 0003, Kangqing Shen, Fazhen Jiang, Jin Jiang 0003, Huwei Ren
J. Vis. Commun. Image Represent.1
2020 Real-time least-squares ensemble visual tracking
abstract
In this study, the authors present a novel ensemble tracking system by formulating the tracking task in terms of a linear regression which is a least‐squares problem. A set of weak classifiers are trained using least squares which are solved efficiently using the Moore–Penrose inverse. Then, these weak classifiers are combined into a strong classifier using bagging. The strong classifier is used to recognise the target and locate its position, which is obtained efficiently in the Fourier domain. For obtaining a good ensemble, a novel sampling strategy is proposed to train accurate and diverse weak classifiers. By exploiting historical targets to monitor the training process, pose change and occlusion are well‐handled. The proposed method is extensively evaluated using a variety of evaluation protocols on the recent standard datasets including OTB50, OTB100 and VOT2016. Experimental results show that the proposed methodology performs favourably against state‐of‐the‐art methods in terms of efficiency, accuracy and robustness.
Ridong Zhu, Xiaoyuan Yang 0003, Jingkai Wang 0001, Zhengze Li
IET Image Process.4
2020 Information encryption communication system based on the adversarial networks Foundation
Zhengze Li, Xiaoyuan Yang 0003, Kangqing Shen, Ridong Zhu, Jin Jiang 0003
Neurocomputing1