31 citations · 104 across the 17 of their papers we have counts for
Showing cs.SIShow all
2 papers · 1 filter
cs.SI2021
Fast and Error-Adaptive Influence Maximization based on Count-Distinct Sketches
Gokhan Gokturk, Kamer Kaya
Influence maximization (IM) is the problem of finding a seed vertex set that maximizes the expected number of vertices influenced under a given diffusion model. Due to the NP-Hardn…
cs.SI2020
Understanding Coarsening for Embedding Large-Scale Graphs
Taha Atahan Akyildiz, Amro Alabsi Aljundi, Kamer Kaya
A significant portion of the data today, e.g, social networks, web connections, etc., can be modeled by graphs. A proper analysis of graphs with Machine Learning (ML) algorithms ha…