Pith. sign in

REVIEW 1 cited by

HEAT: Hyperbolic Embedding of Attributed Networks

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

arxiv 1903.03036 v2 pith:WSNLJZMF submitted 2019-03-07 cs.SI

classification cs.SI
keywords hyperbolicembeddingnetworksheatattributedlearningalgorithmattributes
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Finding a low dimensional representation of hierarchical, structured data described by a network remains a challenging problem in the machine learning community. An emerging approach is embedding these networks into hyperbolic space because it can naturally represent a network's hierarchical structure. However, existing hyperbolic embedding approaches cannot deal with attributed networks, in which nodes are annotated with additional attributes. These attributes might provide additional proximity information to constrain the representations of the nodes, which is important to learn high quality hyperbolic embeddings. To fill this gap, we introduce HEAT (Hyperbolic Embedding of ATributed networks), the first method for embedding attributed networks to a hyperbolic space. HEAT consists of 1) a modified random walk algorithm to obtain training samples that capture both topological and attribute similarity; and 2) a learning algorithm for learning hyperboloid embeddings from the obtained training samples. We show that by leveraging node attributes, HEAT can outperform a state-of-the-art Hyperbolic embedding algorithm on several downstream tasks. As a general embedding method, HEAT opens the door to hyperbolic manifold learning on a wide range of attributed and unattributed networks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach

    cs.LG 2025-06 conditional novelty 6.0 of 10

    Fast-HyperDT reexpresses HyperDT as pre- and post-processing around standard Euclidean trees, making hyperbolic random forests practical.

Pith tools