EDBT 2026 Demo / reviewers in the wild / expert
Jianming Zhu 0001
dblp:50/1455-1
· DBLP profile ↗
7ranked-venue papers in the field
1as first author
7since 2021 · last 2026
0000-0002-8147-8254ORCID · conflict
Domains — venue-derived; a paper can count in several
Knowledge Engineering, Semantic Web & Information Systems · 5 (1 first)Data Mining & Knowledge Discovery · 1Information Retrieval & Web Search · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Leveraging threshold-dependent model for avoiding influence overexposure in online social networks
Jianming Zhu 0001, Peikun Ni |
Inf. Sci. | 2 |
| 2024 | Minimizing the misinformation concern over social networks
Peikun Ni, Jianming Zhu 0001 |
Inf. Process. Manag. | 2 |
| 2024 | Competitive net influence maximization on intergroup debate effect
Jialing Dai, Jianming Zhu 0001 |
Inf. Sci. | 2 |
| 2023 | Equilibrium of individual concern-critical influence maximization in virtual and real blending network
Peikun Ni, Barbara Guidi, Andrea Michienzi, Jianming Zhu 0001 |
Inf. Sci. | 4 |
| 2023 | Misinformation Blocking Problem in Virtual and Real Interconversion Social NetworksabstractWith the in-depth development of intelligent media technology, online and offline fusion, reality and virtual entanglement, information content generalization, the boundary between positive and negative information is blurred, all kinds of misinformation in the social network fission spread, and cyberspace governance has become a global consensus. In this article, we comprehensively consider the spread of misinformation in location-based interpersonal social network and online social network, and systematically tackle the novel problem of minimizing the influence of misinformation under individual protection strategies. We first analyze the complexity and modularity of the problem. Then, we leverage the Lovász extension to devise a nonsubmodular set function continuity approximate convex relaxation method, and develop an approximate projected subgradient procedure to obtain a solution with a factor approximate guarantee. Finally, experiments on three assembled real-world datasets demonstrate the effectiveness and feasibility of our designed method and developed the algorithm. Peikun Ni, Jianming Zhu 0001 |
ACM Trans. Knowl. Discov. Data | 2 |
| 2022 | Opinion influence maximization problem in online social networks based on group polarization effect
Jialing Dai, Jianming Zhu 0001 |
Inf. Sci. | 2 |
| 2021 | Misinformation influence minimization problem based on group disbanded in social networks
Jianming Zhu 0001, Peikun Ni, Yuan Li 0055 |
Inf. Sci. | 1 |