REVIEW 4 cited by
Multi-scale Attributed Node Embedding
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Multi-scale Attributed Node Embedding
read the original abstract
We present network embedding algorithms that capture information about a node from the local distribution over node attributes around it, as observed over random walks following an approach similar to Skip-gram. Observations from neighborhoods of different sizes are either pooled (AE) or encoded distinctly in a multi-scale approach (MUSAE). Capturing attribute-neighborhood relationships over multiple scales is useful for a diverse range of applications, including latent feature identification across disconnected networks with similar attributes. We prove theoretically that matrices of node-feature pointwise mutual information are implicitly factorized by the embeddings. Experiments show that our algorithms are robust, computationally efficient and outperform comparable models on social networks and web graphs.
Forward citations
Cited by 4 Pith papers
-
Evaluating LLMs on Large-Scale Graph Property Estimation via Random Walks
EstGraph benchmark evaluates LLMs on estimating properties of very large graphs from random-walk samples that fit in context limits.
-
Swarm-Inspired Generation of Collective Behaviors in Graph Dynamical Systems
SIES learns generalizable local coupling operators via signed source-target attention for controllable synchronization in graph dynamical systems and applies the principle to heterophilous graph representation learning.
-
Adversarial Graph Neural Network Benchmarks: Towards Practical and Fair Evaluation
A large-scale standardized benchmark of GNN attacks and defenses reveals that target node selection and attacked-model training process can completely distort measured attack effectiveness.
-
Influence Strength Estimation in Hyperbolic Space for Social Influence Maximization
HIM learns hyperbolic user representations from propagation data to estimate influence strength and select seeds for model-agnostic influence maximization.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.