AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Bernoulli Embeddings for Graphs

Vinith Misra, Sumit Bhatia

AAAI 2018 · Graph learning › Graph algorithms and clustering · approach: Graph embedding and spectral sparsification · 10 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
learn Bernoulli binary embeddings instead of quantizing real-valued embeddingsnode retrieval · KG, Wordnet, Slashdot, Flickr, and BlogCatalog (25-bit ranking)test set MAP: KG: .0047 -> .0112; Wordnet: .0212 -> .1013; Slashdot: .0216 -> .0298; Flickr: .0054 -> .0161; BlogCatalog: .0094 -> .01Improved
rerank Bernoulli-retrieved nodes using observable featuresBernoulli embeddings · KG, Wordnet, Slashdot, Flickr, and BlogCatalogtest set MAP: KG: .0112 -> .0267; Wordnet: .1013 -> .0514; Slashdot: .0298 -> .0516; Flickr: .0161 -> .0487; BlogCatalog: .0181 -> .02Mixed
use uniform negative sampling rather than alternative noise distributions or curriculaBernoulli embeddings · five graph datasetstest set MAPNo clear effect
use a more complex distance transformation instead of the simple linear scalingBernoulli embedding objective · graph link predictiontest set precision-recallNo clear effect

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