AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Random Intersection Graphs and Missing Data

Dror Salti, Yakir Berchenko

AAAI 2020 · Graph learning › Graph algorithms and clustering · approach: Graph comparison and random features · 1 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
Increase missingness fraction p beyond the connectivity threshold p**EM for linear regression with missing covariates · Simulated n=100, m=30, Gaussian Xscaled coefficient error: threshold p** = 0.033Hurt
Vary coefficient norm ||beta|| over 50, 100, 500, 1000, 5000 (ablation)EM for linear regression with missing covariates · Simulated n=100, m=30location of error blow-upNo clear effect
Increase p above 1/sqrt(mn), where a giant component appearsEM for linear regression with missing covariates · Simulated n=100, p in {0.02,...,0.028}EM cycles per coefficient: critical point at p^2 n m = 1Hurt
Replace Gaussian design matrix with uniform U(0,50) (ablation)EM missing-data simulation · Simulated n=100, m=30error threshold: p** = 0.033No clear effect
Large signal-to-noise ratio with p below the giant-component thresholdEM algorithm · Simulated linear regressionEM cycles to convergenceHurt

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