DSG Seminar Series • Efficient Network Embeddings for Large Graphs
Please note: This seminar will be given online.
Xiaokui Xiao, School of Computing
National University of Singapore
Given a graph G, network embedding maps each node in G into a compact, fixed-dimensional feature vector, which can be used in downstream machine learning tasks. Most of the existing methods for network embedding fail to scale to large graphs with millions of nodes, as they either incur significant computation cost or generate low-quality embeddings on such graphs.