Sourav S Bhowmick
Biographic Data
| ID | 10054698 |
|---|---|
| NAME | Sourav S Bhowmick |
| GIVEN NAMES | Sourav S |
| FAMILY NAME | Bhowmick |
| SIGNATURE | BHOWMICK S S |
| AFFILIATIONS | Nanyang Technological University |
| ORCID | 0000-0003-1957-8016 |
| VERIFIED | Yes |
| TOTAL WORKS | 1 |
| TOTAL CITATIONS | 0 |
| WORKS AS AUTHOR | 1 |
| WORKS AS EDITOR | 0 |
| FIRST PUBLICATION YEAR | 2023 |
| LATEST PUBLICATION YEAR | 2023 |
| H-INDEX | 0 |
Piano
Since its introduction in 2003, the influence maximization (IM) problem has drawn significant research attention in the literature. The aim of IM, which is NP-hard, is to select a set of $k$ users known as seed users who can influence the most individuals in the social network. The state-of-the-art algorithms estimate the expected influence of nodes based on sampled diffusion paths. As the number of required samples has been recently proven to be…
No prominent works on this page.
Piano
Since its introduction in 2003, the influence maximization (IM) problem has drawn significant research attention in the literature. The aim of IM, which is NP-hard, is to select a set of $k$ users known as seed users who can influence the most individuals in the social network. The state-of-the-art algorithms estimate the expected influence of nodes based on sampled diffusion paths. As the number of required samples has been recently proven to be…
Advanced Graph Neural Networks (1 work) · Algorithm (1 work) · Arithmetic (1 work) · Artificial Intelligence (1 work) · Bounded function (1 work) · Complex Network Analysis Techniques (1 work) · Computer Science (1 work) · Deep learning (1 work) · Embedding (1 work) · Mathematical optimization (1 work)