Category Graph Algorithms
The densest subgraph problem with negative weights
Few days ago I uploaded on Arxiv our preprint “Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries”. This is joint work with Tianyi, Nao, and Jakub. In this paper we study the following extension of the densest subgraph problem (DSP) that is known to be solvable exactly in polynomial time on graphs with […]
Denoising binary images
Let’s start by writing the letter T using numpy in Python, encoded in a 0/1 array. Let’s visualize this. This is what we get, indeed the array represents the letter “T”. Now, let’s generate a corrupted version of this image by flipping each bit with some probability p. We can also do it a bit faster […]
Dense subgraph discovery applications
Recently, I compiled a collection of applications that rely on dense subgraph discovery for my KDD’15 tutorial with Aris Gionis. In general, dense subgraph discovery is a key graph mining primitive. While by “dense” we generally mean subgraphs which are large enough and contain many edges, the exact notion of dense is application dependent. The […]
tsourakakis.com 