AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

GMDNet: A Graph-Based Mixture Density Network for Estimating Packages’ Multimodal Travel Time Distribution

AAAI 2023 · Graph learning › Graph algorithms and clustering · approach: Graph comparison and random features · 10 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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
Use GMDNet instead of KDEPackage travel-time distribution estimation · D1logL: -2.02 -> -0.73 ± 0.02Helped
Use GMDNet instead of KDEPackage travel-time distribution estimation · D2CRPS: 1.35 -> 1.21 ± 0.01Helped
Train with EM rather than gradient descentGMDNet · D1MAE (h): 1.92 ± 0.08 -> 1.89 ± 0.03Helped
Train with EM rather than gradient descentGMDNet · D2CRPS: 1.23 ± 0.03 -> 1.21 ± 0.01Helped
Replace graph-cooperated route encoding with an MLP (ablation)GMDNet · D1MAE, MAPE, logL, and CRPSHurt
Remove mutual-correlation modeling among route edges (ablation)GMDNet · D1MAE, MAPE, logL, and CRPSHurt
Use one mixture component instead of multiple components (ablation)GMDNet · D1logL and CRPSHurt

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