EDBT 2026 Demo / reviewers in the wild / expert
Zhiliang Feng
dblp:341/0371
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0007-1752-5646ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 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.
| Databases, data mining, and information retrieval
1 paper |
Web and social media mining · 87% Recommender systems · 13% | |
| Artificial intelligence
1 paper |
Learning theory · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Learning theory
online learning |
0.9 | 1 | 2025 | Online Popularity Prediction Service via Minimal Substitution Reinforcement Learning for Social Networks · IEEE Trans. Serv. Comput. 2025 |
Web and social media mining › information diffusion
information diffusion prediction |
0.9 | 1 | 2025 | Online Popularity Prediction Service via Minimal Substitution Reinforcement Learning for Social Networks · IEEE Trans. Serv. Comput. 2025 |
Web and social media mining
popularity prediction |
0.9 | 1 | 2025 | Online Popularity Prediction Service via Minimal Substitution Reinforcement Learning for Social Networks · IEEE Trans. Serv. Comput. 2025 |
Methods — techniques the papers use, named apart from their topics
substitution theory · 1.7reinforcement learning · 1.7mutual information · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Online Popularity Prediction Service via Minimal Substitution Reinforcement Learning for Social NetworksabstractOne of the key challenges of current online social platforms is predicting the size of information cascades, also known as popularity prediction or cascade prediction. Accurate popularity prediction can benefit various fields, including news distribution, market decisions, and rumor detection. However, existing popularity prediction approaches concentrate more on the historical sequences of single messages, overlooking the interactions between message diffusion and the dynamic nature of social networks, which limits the timeliness and accuracy of predictions. To address this, we propose an online popularity prediction service based on minimal substitution reinforcement learning calledMSRL. Specifically, we explore a substitution theory and design a minimal substitution reinforcement learning method that models diffusion as message substitution and considers mutual information diffusion. That helps the model gain a broader perspective, allowing it to fully exploit the cooperative, competitive, or dependent relationships between information diffusions. Furthermore, the reinforcement learning scheme enables the service to dynamically adjust its parameters to respond to the dynamic social network environment in real-time. Finally, extensive experiments on real-world datasets show that the MSRL outperforms state-of-the-art methods regarding accuracy and service agility. Ranran Wang 0001, Yin Zhang 0002, Henning Meyerhenke, Zhiliang Feng, Sabita Maharjan, Yan Zhang 0002 |
IEEE Trans. Serv. Comput. | 4 |