AI Paper Atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

Tensor Completion for Weakly-Dependent Data on Graph for Metro Passenger Flow Prediction

AAAI 2020 · Learning theory and algorithms › Matrix and tensor methods · approach: Low-rank tensor completion · 51 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
Replace the FBCP completion approach with WDGTCHong Kong metro passenger flow · Hong Kong metro passenger flow test setMSE (×10^6): 3.98 -> 2.68Helped
Replace the FBCP completion approach with WDGTCHong Kong metro passenger flow · Hong Kong metro passenger flow test setMAPE (%): 172.81 -> 63Helped
Replace the MTIOP#LRS approach with WDGTCHong Kong metro passenger flow · Hong Kong metro passenger flow test setMSE (×10^6): 6.15 -> 2.68Helped
Add weak-dependency penalty to low-rank completion (ablation)WDGTC · Hong Kong metro passenger flow test setMSE (×10^6): 8.32 -> 4.94Helped
Add POI graph penalty to weak-dependency and low-rank penalties (ablation)WDGTC · Hong Kong metro passenger flow test setMSE (×10^6): 4.94 -> 3.25Helped
Add NET graph penalty to weak-dependency, low-rank, and POI graph penalties (ablation)WDGTC · Hong Kong metro passenger flow test setMSE (×10^6): 3.25 -> 2.68Helped

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