Demo Data from EDBT 2026 / reviewers in the wild / expert
Zhaosong Zhang
dblp:368/2203
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Computer 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.
| Databases, data mining, and information retrieval
1 paper |
Web and social media mining · 50% Data stream processing · 50% | |
| Theoretical computer science
1 paper |
Approximation and online algorithms · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Web and social media mining › social network analysis
influence maximization |
0.8 | 1 | 2024 | Tracking Influencers in Decaying Social Activity Streams With Theoretical Guarantees · IEEE/ACM Trans. Netw. 2024 |
Data stream processing
streaming algorithms |
0.8 | 1 | 2024 | Tracking Influencers in Decaying Social Activity Streams With Theoretical Guarantees · IEEE/ACM Trans. Netw. 2024 |
Approximation and online algorithms › approximation algorithms
approximation guarantees |
0.2 | 1 | 2024 | Tracking Influencers in Decaying Social Activity Streams With Theoretical Guarantees · IEEE/ACM Trans. Netw. 2024 |
Methods — techniques the papers use, named apart from their topics
streaming optimization · 1.5probabilistic decay model · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Tracking Influencers in Decaying Social Activity Streams With Theoretical GuaranteesabstractInfluence maximization (IM) is the fundamental problem in many real world applications such as viral marketing, political campaign, and network monitoring. Although extensively studied, most studies on IM assume that social influence is static and they cannot handle the dynamic influence challenge in reality, i.e., a user’s influence is varying over time. To address this challenge, we formulate a novel influencer tracking problem over a social activity stream. In order to keep the solutions up-to-date and forget outdated data in the stream smoothly, we propose a probabilistic-decaying social activity stream (PDSAS) model that enforces each social activity in the stream participating in the analysis with a probability decaying over time. Built on the PDSAS model, we propose a family of streaming optimization algorithms to solve the influencer tracking problem. SIEVE PAIT can identify influencers from a special kind of probabilistic addition-only social activity streams with high efficiency, and guarantees an$(1/2-\epsilon)$approximation ratio. BASIC IT leverages SIEVE PAIT as a building block to identify influencers from general PDSASs, and also guarantees an$(1/2-\epsilon)$approximation ratio. HIST IT improves the efficiency of BASIC IT, and still guarantees an$(1/4-\epsilon)$approximation ratio. Experiments on real data show that our methods can find high quality solutions with much less computational costs than baselines. Junzhou Zhao, Pinghui Wang, Zhaosong Zhang, Maoli Liu, John C. S. Lui |
IEEE/ACM Trans. Netw. | 4 |