Density of states for fast embedding node-attributed graphs

Given a node-attributed graph, how can we efficiently represent it with few numerical features that expressively reflect its topology and attribute information? We propose A-DOGE , for attributed DOS-based graph embedding, based on density of states (DOS, a.k.a. spectral density) to tackle this prob...

Ausführliche Beschreibung