You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This page contains benchmarks of all models implemented in GraphVite, including their
time and performance. All experiments are conducted on a server with 24 CPU threads
and 4 V100 GPUs.
Node Embedding
We experiment node embedding models on 3 datasets, ranging from million-scale to
half billion-scale. The following table shows the size of each dataset, as well as
the time and resource required by `LINE`_ model.
The learned node embeddings are evaluated on the standard task of multi-label node
classifcation. We report micro-F1 and macro-F1 of each model, with regard to
different percentages of training data.
For larger datasets, `node2vec`_ fails with out-of-memory error, as it requires more
than 200 GiB memory to build alias tables for the 2nd order random walks.
For knowledge graph embedding, we benchmark `TransE`_, `DistMult`_, `ComplEx`_ and
`RotatE`_ on 4 standard datasets. The training time and resource of `RotatE`_ on
these datasets is given in the following table.
To evaluate the knowledge graph embeddings, we test them on the link prediction
task. We report the results for each model on the test set, where ranking metrics
are computed based on filtered results.
The high-dimensional data visualization is evaluated on two popular image datasets.
The training time and resource needed by `LargeVis`_ is given in the following table.
Note that more than 95% GPU memory cost comes from the construction of KNN Graph, and
can be traded off with speed if necessary.
For `ImageNet`_, since it contains 1000 classes, we visualize classes according to
their hierarchy in `WordNet`_. The following animation shows how the class of
english setter (a kind of dog) is traversed in the hierarchy.