AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

Bipartite Stochastic Block Models with Tiny Clusters

Stefan Neumann

NeurIPS 2018 · Learning theory and algorithms › Clustering · approach: Correlation clustering · 12 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
pcv (SVD + k-means, then degree thresholding) instead of lim, message, lfm at low edge probability p<=0.3bipartite SBM cluster recovery · synthetic bipartite graphs, varying pcluster quality Q (Jaccard)Mixed
pcv instead of lim at high edge probability p>=0.5bipartite SBM cluster recovery · synthetic bipartite graphs, varying pcluster quality Q (Jaccard)Mixed
pcv instead of message, lim, lfm when right clusters are tiny (size 2-6)bipartite SBM cluster recovery · synthetic, p=0.4, q=0.03, varying right-cluster sizeright cluster quality QImproved
pcv instead of message, lim, lfm for left clustersbipartite SBM cluster recovery · synthetic, varying right-cluster sizeleft cluster quality QImproved
pcv instead of message, lim, lfm in running timebipartite SBM cluster recovery · synthetic graphsrunning timeImproved
increase left cluster size l from 20 to 40 or morepcv · synthetic, p=0.5, q=0.03right cluster quality QImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy