Research map / Graph learning / Graph algorithms and clustering
Directed Probabilistic Watershed
Enrique Fita Sanmartín, Sebastian Damrich, Fred A Hamprecht
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 changed | Where | Measured | Effect |
|---|---|---|---|
| use DProbWS instead of existing semi-supervised methods (ARW, GTG, LLUD) | Directed Probabilistic Watershed · Digits, 20Newsgroups, Email-EU, Cora, CiteseerX node classification | accuracy | Mixed |
| use teleporting random walker (TRW) variant on sparse networks (ablation) | DProbWS and ARW · Cora, CiteseerX | accuracy | Improved |
Closest papers by meaning
- Probabilistic Watershed: Sampling all spanning forests for seeded segmentation and semi-supervised learning (NeurIPS 2019 · similarity 0.94)
- Transduction on Directed Graphs via Absorbing Random Walks (TPAMI 2017 · similarity 0.86)
- Fast Wasserstein rates for estimating probability distributions of probabilistic graphical models (NeurIPS 2026 · similarity 0.84)
- Distribution Learning Meets Graph Structure Sampling (NeurIPS 2025 · similarity 0.84)
- Efficient Streaming Algorithms for Graphlet Sampling (NeurIPS 2024 · similarity 0.83)
- Node Similarities under Random Projections: Limits and Pathological Cases (ICLR 2025 · similarity 0.83)
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.
