AH-UGC produces multiple coarsened graphs from one sorted hashed list and keeps heterogeneous node types pure by coarsening each type separately.
A novel coarsened graph learning method for scalable single-cell data analysis,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
baseline 1
citation-polarity summary
fields
cs.SI 1years
2025 1verdicts
CONDITIONAL 1roles
baseline 1polarities
baseline 1representative citing papers
citing papers explorer
-
AH-UGC: Adaptive and Heterogeneous-Universal Graph Coarsening
AH-UGC produces multiple coarsened graphs from one sorted hashed list and keeps heterogeneous node types pure by coarsening each type separately.