WRSWorld Research StateContribute
WORLD RESEARCH STATE

LINE first- and second-order network embeddings

Contribution grade

Graph and geometric machine learning · Human-designed research method or resource

Reference score140,000Provisional editorial estimate of this exact contribution; its grade is assessed separately.

What changed

Learns direct-edge and neighborhood-context embeddings using negative sampling and weight-proportional edge sampling, then combines separately trained proximity representations.

Scientific scope

Learns direct-edge and neighborhood-context embeddings using negative sampling and weight-proportional edge sampling, then combines separately trained proximity representations. Six source authors; internship mark not shared-lead mark. First-order objective applies to undirected graphs; second-order supports directed graphs. Practical method concatenates separately trained embeddings rather than solving a claimed joint objective. Empirical near-linear work is not a universal convergence/runtime theorem; isolated unseen vertices need extra information.

Evidence

The linked original sources describe the stated contribution and its evidence limits. WRS has not independently rerun the experiments or certified a proof. Six source authors; internship mark not shared-lead mark. First-order objective applies to undirected graphs; second-order supports directed graphs. Practical method concatenates separately trained embeddings rather than solving a claimed joint objective. Empirical near-linear work is not a universal convergence/runtime theorem; isolated unseen vertices need extra information.

Contributors

Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction