shenweichen/graphembedding

Implementation and experiments of graph embedding algorithms.

View on GitHub ↗Jump to charts ↓

Summary Information

Updated 1 hour ago
Added to GitGenius on September 18th, 2026
Created on February 11th, 2019
Open Issues & Pull Requests: 37 (+0)
GitHub issues: Enabled
Number of forks: 995
Total Stargazers: 3,841 (+0)
Total Subscribers: 58 (+0)

Repository Insights (GitGenius)

Median issue/PR response: 1047.3 days
Mean response time: 942.0 days
90th percentile: 2131.6 days
Tracked items: 9

Most active contributors

Sign in to see contributor activity.

Charts & Analytics

Fetching additional details & charts...

Issue Activity (beta)

Open issues: 0
New in 7 days: 0
Closed in 7 days: 0
Avg open age: N/A days
Stale 30+ days: 0
Stale 90+ days: 0

Recent activity

Opened in 7 days: 0
Closed in 7 days: 0
Comments in 7 days: 0
Events in 7 days: 0

Top labels

No label distribution available yet.

Most active issues this week

No issue events were indexed in the last 7 days.

Detailed Description

GraphEmbedding is a Python library that implements graph embedding algorithms.

The tool addresses the problem of learning low-dimensional vector representations for nodes in networks. It provides implementations of five established algorithms: DeepWalk, which uses random walks and skip-gram models; LINE, which preserves both first-order and second-order proximity; Node2Vec, which extends random walks with biased sampling; SDNE, which uses deep autoencoders to capture nonlinear structure; and Struc2Vec, which learns representations based on structural roles rather than proximity. The library follows a simple design principle of graph-in, embedding-out, accepting input as edge lists via NetworkX graph objects.

The tool suits researchers and practitioners working with network analysis who want to experiment with multiple embedding approaches without implementing algorithms from scratch. It is particularly useful for comparative studies across different embedding methods. The library does not position itself against alternatives in the README, so no comparative guidance is available.

The project shows consistent maintenance with regular updates to the codebase. Documentation is provided through detailed explanatory notes accompanying each algorithm implementation. The repository includes example scripts demonstrating how to run each embedding method, making it accessible for users new to graph embedding techniques.