Search Results for author:
Found 6 papers, 3 papers with code
Visualizing Overlapping Biclusterings and Boolean Matrix Factorizations
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.
Adversaries with Limited Information in the Friedkin--Johnsen Model
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?
Sublinear-Time Clustering Oracle for Signed Graphs
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?
Biclustering and Boolean Matrix Factorization in Data Streams
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.
Recent Developments in Boolean Matrix Factorization
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.
Bipartite Stochastic Block Models with Tiny Clusters
We study the problem of finding clusters in random bipartite graphs.
