Post #392

Cleora: new unsupervised graph embedding model for hypergraphs A new library Cleora, written in Rust (for efficiency), by Synerise, a startup building AI platform, builds graph embeddings in unsupervised, inductive, and scalable manner. The algorithm itself is very simple, PageRank-like, just iterative multiplication of the adjacency matrix. It claims to be ~5x faster than PyTorch-BigGraph (with better performance) and provides some nice features including real-time updates, determinism of embeddings, independence of each dimension, compositionality of embeddings of the same entity on different datasets. They also claim they use it in production, so worth a try if you have a graph with billions of edges.