atlas

Research map / Graph learning / Graph self-supervised learning

Tri-level Robust Clustering Ensemble with Multiple Graph Learning

AAAI 2021 · Graph learning › Graph self-supervised learning · approach: Heterophily and imbalance on graphs · 39 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
add base-clustering reliability weights (ablation)TRCE · LungACC: 0.8936 -> 0.9034Helped
add base-clustering reliability weights (ablation)TRCE · Tdt2ACC: 0.6024 -> 0.6273Helped
add instance-level self-paced weights (ablation)TRCE · LungACC: 0.8892 -> 0.9034Helped
add instance-level self-paced weights (ablation)TRCE · Tdt2ACC: 0.6023 -> 0.6273Helped
add graph-level noise matrix (ablation)TRCE · LungACC: 0.6847 -> 0.9034Helped
add graph-level noise matrix (ablation)TRCE · Tdt2ACC: 0.1806 -> 0.6273Helped
use tri-level robust ensemble rather than the strongest listed baselineTRCE · LungACC: 0.8675 -> 0.9034Helped
use tri-level robust ensemble rather than the strongest listed baselineTRCE · Tdt2ACC: 0.5744 -> 0.6273Helped

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