activity
20162022
most citedMixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing

270 citations · 805 across the 13 of their papers we have counts for

collaborators
Showing cs.SIShow all

6 papers · 1 filter

cs.SI202020 cited

Just SLaQ When You Approximate: Accurate Spectral Distances for Web-Scale Graphs

Anton Tsitsulin, Marina Munkhoeva, Bryan Perozzi

Graph comparison is a fundamental operation in data mining and information retrieval. Due to the combinatorial nature of graphs, it is hard to balance the expressiveness of the sim…

cs.SI2019109 cited

Is a Single Embedding Enough? Learning Node Representations that Capture Multiple Social Contexts

Alessandro Epasto, Bryan Perozzi

Recent interest in graph embedding methods has focused on learning a single representation for each node in the graph. But can nodes really be best described by a single vector rep…

cs.SI2018

Enhanced Network Embeddings via Exploiting Edge Labels

Haochen Chen, Xiaofei Sun, Yingtao Tian +3

Network embedding methods aim at learning low-dimensional latent representation of nodes in a network. While achieving competitive performance on a variety of network inference tas…

cs.SI2018

A Tutorial on Network Embeddings

Haochen Chen, Bryan Perozzi, Rami Al-Rfou +1

Network embedding methods aim at learning low-dimensional latent representation of nodes in a network. These representations can be used as features for a wide range of tasks on gr…

cs.SI2017125 cited

HARP: Hierarchical Representation Learning for Networks

Haochen Chen, Bryan Perozzi, Yifan Hu +1

We present HARP, a novel method for learning low dimensional embeddings of a graph's nodes which preserves higher-order structural features. Our proposed method achieves this by co…

cs.SI20172 cited

Ties That Bind - Characterizing Classes by Attributes and Social Ties

Aria Rezaei, Bryan Perozzi, Leman Akoglu

Given a set of attributed subgraphs known to be from different classes, how can we discover their differences? There are many cases where collections of subgraphs may be contrasted…