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

Zhengxiang Liu

dblp:395/6501 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
—ORCID · unresolved

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

Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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
Knowledge representation and reasoning · 38% Graph learning · 38% Deep learning architectures and training · 12%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational finance and economics · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning
relational learning
0.912025
Relational Stock Selection via Probabilistic State Space Learning · IEEE Trans. Knowl. Data Eng. 2025
Machine learning › Graph learning › relation modeling
stock relation modeling
0.912025
Relational Stock Selection via Probabilistic State Space Learning · IEEE Trans. Knowl. Data Eng. 2025
Computational finance and economics › quantitative investment
quantitative trading
0.912025
Relational Stock Selection via Probabilistic State Space Learning · IEEE Trans. Knowl. Data Eng. 2025
Computational finance and economics › portfolio management
stock selection
0.912025
Relational Stock Selection via Probabilistic State Space Learning · IEEE Trans. Knowl. Data Eng. 2025
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › bayesian filtering
kalman filtering
0.312025
Relational Stock Selection via Probabilistic State Space Learning · IEEE Trans. Knowl. Data Eng. 2025
Machine learning › Deep learning architectures and training
state space model
0.312025
Relational Stock Selection via Probabilistic State Space Learning · IEEE Trans. Knowl. Data Eng. 2025

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

tree-based structure learning · 1.7probabilistic state space model · 1.7probabilistic kalman network · 1.7attention mechanism · 1.7
YearPublicationVenuePosition
2026 Continuous learning approach to synergize shimmering image enhancement and de-fogging with small sample
Fenglin Yao, Zhengxiang Liu
Expert Syst. Appl.2
2025 Relational Stock Selection via Probabilistic State Space Learning
abstract
Optimizing stock selection through stock ranking is one of the critical but intricate tasks in quantitative trading areas because of the non-stationary dynamics and complicated interdependencies behind stock markets. Recent studies have made efforts to model historical market movements to enhance stock selection. However, they primarily borrowed the spirit of time series modeling and sought to build a deterministic paradigm without considering the uncertain fluctuations. In addition, some of these studies tailor to explore stock correlations from a predefined (e.g., binary) graph structure and use explicitly simple relations (such as first-order relations) to guide evolving interactions. Nevertheless, aggregating predefined but shallow relationships to collaborate with stock movements may affect selection generalizability and increase the risk of portfolio failure. This study introduces a novelRelational stock selection framework via probabilisticStateSpaceLearning (orRSSL) for stock selection. Specifically, RSSL first attempts to build a tree-based structure to explicitly expose higher-order relations in the stock market, primarily by discovering a hierarchical delineation of ties between stocks. Whereafter, it couples with time-varying movements via an attention mechanism to smoothly explore the interactive correlations among different stocks. Inspired by recent state space models (SSM) in probabilistic Bayesian learning, we devise a Probabilistic Kalman Network (PKNet) with uncertainty estimates to recursively simulate ever-changing stock volatility, enabling more promising return-risk trade-offs. The experimental results on several real-world stock market datasets demonstrate that RSSL outperforms several representative baseline methods by a significant margin.
Qiang Gao 0003, Zhengxiang Liu, Li Huang 0002, Kunpeng Zhang 0001, Jun Wang 0089, Guisong Liu
IEEE Trans. Knowl. Data Eng.2