activity
20182022
most citedGEMSEC: Graph Embedding with Self Clustering

63 citations · 88 across the 9 of their papers we have counts for

collaborators

13 papers

cs.CG2022

On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem

Peyman Afshani, Mark de Berg, Kevin Buchin +7

We consider the following surveillance problem: Given a set of sites in a metric space and a set of robots with the same maximum speed, compute a patrol schedule of min…

cs.LG2022

Continual and Sliding Window Release for Private Empirical Risk Minimization

Lauren Watson, Abhirup Ghosh, Benedek Rozemberczki +1

It is difficult to continually update private machine learning models with new data while maintaining privacy. Data incur increasing privacy loss -- as measured by differential pri…

cs.LG2021★ 3 cited

PyTorch Geometric Temporal: Spatiotemporal Signal Processing with Neural Machine Learning Models

Benedek Rozemberczki, Paul Scherer, Yixuan He +8

We present PyTorch Geometric Temporal a deep learning framework combining state-of-the-art machine learning algorithms for neural spatiotemporal signal processing. The main goal of…

cs.LG2021★ 7 cited

Chickenpox Cases in Hungary: a Benchmark Dataset for Spatiotemporal Signal Processing with Graph Neural Networks

Benedek Rozemberczki, Paul Scherer, Oliver Kiss +2

Recurrent graph convolutional neural networks are highly effective machine learning techniques for spatiotemporal signal processing. Newly proposed graph neural network architectur…

cs.SI2021★ 7 cited

Twitch Gamers: a Dataset for Evaluating Proximity Preserving and Structural Role-based Node Embeddings

Benedek Rozemberczki, Rik Sarkar

Proximity preserving and structural role-based node embeddings have become a prime workhorse of applied graph mining. Novel node embedding techniques are often tested on a restrict…

cs.LG2021

The Shapley Value of Classifiers in Ensemble Games

Benedek Rozemberczki, Rik Sarkar

What is the value of an individual model in an ensemble of binary classifiers? We answer this question by introducing a class of transferable utility cooperative games called \text…

cs.SI2020

Heterogeneous Interventions Reduce the Spread of COVID-19 in Simulations on Real Mobility Data

Haotian Wang, Abhirup Ghosh, Jiaxin Ding +2

Major interventions have been introduced worldwide to slow down the spread of the SARS-CoV-2 virus. Large-scale lockdowns of human movements are effective in reducing the spread, b…

cs.LG2020

Stability Enhanced Privacy and Applications in Private Stochastic Gradient Descent

Lauren Watson, Benedek Rozemberczki, Rik Sarkar

Private machine learning involves addition of noise while training, resulting in lower accuracy. Intuitively, greater stability can imply greater privacy and improve this privacy-u…

cs.SI2020★ 2 cited

Little Ball of Fur: A Python Library for Graph Sampling

Benedek Rozemberczki, Oliver Kiss, Rik Sarkar

Sampling graphs is an important task in data mining. In this paper, we describe Little Ball of Fur a Python library that includes more than twenty graph sampling algorithms. Our go…

cs.DS2020★ 3 cited

Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency

Peyman Afshani, Mark De Berg, Kevin Buchin +7

We consider the problem of finding patrol schedules for robots to visit a given set of sites in a metric space. Each robot has the same maximum speed and the goal is to min…

cs.LG2020★ 3 cited

Fast Sequence-Based Embedding with Diffusion Graphs

Benedek Rozemberczki, Rik Sarkar

A graph embedding is a representation of graph vertices in a low-dimensional space, which approximately preserves properties such as distances between nodes. Vertex sequence-based…

cs.LG2019

Multi-scale Attributed Node Embedding

Benedek Rozemberczki, Carl Allen, Rik Sarkar

We present network embedding algorithms that capture information about a node from the local distribution over node attributes around it, as observed over random walks following an…

cs.SI2018★ 63 cited

GEMSEC: Graph Embedding with Self Clustering

Benedek Rozemberczki, Ryan Davies, Rik Sarkar +1

Modern graph embedding procedures can efficiently process graphs with millions of nodes. In this paper, we propose GEMSEC -- a graph embedding algorithm which learns a clustering o…