communities
awesome-community-detection
Our great sponsors
| communities | awesome-community-detection | |
|---|---|---|
| 12 | 1 | |
| 697 | 2,266 | |
| - | - | |
| 4.0 | 2.8 | |
| 6 months ago | about 1 month ago | |
| Python | Python | |
| MIT License | Creative Commons Zero v1.0 Universal |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
communities
-
I made a graph neural network specifically for graphs with community structure
I made a tool for plotting graphs with community structure. You can check it out here.
-
[OC] Algorithmically organizing a social network into cliques
A few people are asking what this is a visualization of. OP's graphs look very similar to an example of the Louvain Method shown in the library's documentation. The Louvain Method is a community detection algorithm used on network graphs. It works by iteratively optimizing modularity of the graph. Modularity is a measure of the density of the number of edges (lines between nodes) that fall within a given group/cluster compared to what would be expected from a random distribution of edges throughout the graph.
-
Algorithmically organizing a social network into cliques
I made this visualization with: https://github.com/shobrook/communities
- I made Communities: a library of clustering algorithms for network graphs (link in comments)
- [P] I made Communities: a library of clustering algorithms for network graphs (link in comments)
- I made a library for organizing social networks into cliques (link in comments)
- [P] I made communities: a library for detecting and visualizing clusters in network graphs (link in comments)
- I made 'communities' – a library of clustering algorithms for graphs
- I made 'communities' – a library for detecting communities in graphs, built on numpy
- [Project] I made a lightweight Python library for graph clustering
awesome-community-detection
What are some alternatives?
graphtage - A semantic diff utility and library for tree-like files such as JSON, JSON5, XML, HTML, YAML, and CSV.
minisom - :red_circle: MiniSom is a minimalistic implementation of the Self Organizing Maps
pytextrank - Python implementation of TextRank algorithms ("textgraphs") for phrase extraction
Ringer-Client - Ringer is a new messaging app for windows. Its currently in beta but lets work together to make it better. The code here is snapshot code so it might not work as intended. To get the latest stable build pls download the installer.
leidenalg - Implementation of the Leiden algorithm for various quality functions to be used with igraph in Python.
DBCV - Python implementation of Density-Based Clustering Validation
libmaths - A Python library created to assist programmers with complex mathematical functions
Clover - An Efficient DNA Clustering algorithm based on Tree Structure.
NetworkX - Network Analysis in Python
traph - A terminal/cmd graph algorithm visualiser