atlas

Research map / Graph learning / Graph algorithms and clustering

Online Prediction of Switching Graph Labelings with Cluster Specialists

NeurIPS 2019 · Graph learning › Graph algorithms and clustering · approach: Graph comparison and random features · 1 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 SCS-F or SCS-B instead of the kernel PerceptronSwitching graph labeling prediction · Chicago Divvy Bicycle Sharing datacumulative mistakesHelped
Use SCS-F or SCS-B instead of the natural benchmarksSwitching graph labeling prediction · Chicago Divvy Bicycle Sharing datacumulative mistakesHelped
Replace the complete basis F_n with the binary-tree basis B_n (ablation)SCS · Chicago Divvy Bicycle Sharing datacumulative mistakesHelped
Increase ensemble size from 1 to 65 random-spine instances (ablation)SCS-F and SCS-B · Chicago Divvy Bicycle Sharing datacumulative mistakesHelped
Use the binary-tree basis B_n rather than F_n (ablation)SCS · Graph labeling predictionprediction time per trial: Θ(n^2) -> O(log n)Helped
Tune the switching parameter α (ablation)SCS-F · Chicago Divvy Bicycle Sharing datacumulative mistakesMixed
Tune the switching parameter α (ablation)SCS-B · Chicago Divvy Bicycle Sharing datacumulative mistakesNo 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