pith. sign in

arxiv: 1811.10734 · v1 · pith:Y3FZFGPNnew · submitted 2018-11-26 · 💻 cs.LG · cs.AI· cs.SI· stat.ML

DynamicGEM: A Library for Dynamic Graph Embedding Methods

classification 💻 cs.LG cs.AIcs.SIstat.ML
keywords dynamicgemlibrarymethodsalgorithmsdynamicevaluategraphnode
0
0 comments X
read the original abstract

DynamicGEM is an open-source Python library for learning node representations of dynamic graphs. It consists of state-of-the-art algorithms for defining embeddings of nodes whose connections evolve over time. The library also contains the evaluation framework for four downstream tasks on the network: graph reconstruction, static and temporal link prediction, node classification, and temporal visualization. We have implemented various metrics to evaluate the state-of-the-art methods, and examples of evolving networks from various domains. We have easy-to-use functions to call and evaluate the methods and have extensive usage documentation. Furthermore, DynamicGEM provides a template to add new algorithms with ease to facilitate further research on the topic.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.