2 code implementations • 14 Jul 2023 • Thibault Marette, Pauli Miettinen, Stefan Neumann
In this paper, we study the problem of visualizing \emph{a given clustering} of overlapping clusters in bipartite graphs and the related problem of visualizing Boolean Matrix Factorizations.
1 code implementation • 17 Jun 2023 • Sijing Tu, Stefan Neumann, Aristides Gionis
To address this concern, we raise the following question: Can an attacker sow discord in a social network, even when only the network topology is known?
1 code implementation • 28 Jun 2022 • Stefan Neumann, Pan Peng
We provide a local clustering oracle for signed graphs with such a clear community structure, that can answer membership queries, i. e., "Given a vertex $v$, which community does $v$ belong to?
no code implementations • 5 Dec 2020 • Stefan Neumann, Pauli Miettinen
We provide an algorithm that, after one pass over the stream, recovers the set of clusters on the right side of the graph using sublinear space; to the best of our knowledge, this is the first algorithm with this property.
no code implementations • 5 Dec 2020 • Pauli Miettinen, Stefan Neumann
The goal of Boolean Matrix Factorization (BMF) is to approximate a given binary matrix as the product of two low-rank binary factor matrices, where the product of the factor matrices is computed under the Boolean algebra.
no code implementations • NeurIPS 2018 • Stefan Neumann
We study the problem of finding clusters in random bipartite graphs.