-
The [Louvain algorithm](https://en.wikipedia.org/wiki/Louvain_method) is commonly used to identify communities in graphs, and is present in other libraries/tools such as [NetworkX](https://networkx.or…
-
### Description
The NSL-KDD dataset, provided by the University of New Brunswick's Canadian Institute for Cybersecurity, serves as a revised version of the original KDD Cup 1999 dataset. It is exte…
-
i recognize that RedisGraph has the PageRank algorithm, but the label propagation algorithm is a more general case of the pagerank algorithm.
It allows for more usecases like community detection, e…
-
As a data-generator developer, I need a summary of the complexities and worst-case input data shapes for popular community detection algorithms so that I can identify the key (common) factors that wil…
-
Hi there,
I am using macOs and got this error:
[/usr/local/lib/python3.10/dist-packages/py3plex/algorithms/community_detection/community_wrapper.py](https://localhost:8080/#) in parse_infomap(ou…
-
As a researcher developing cross-hardware benchmarks, I require a suite of graphs of varying 'difficulty' to use as input to community detection algorithms so that I can evaluate the impact that diffe…
-
Hi,
I am working with a graph that has both node attributes (numerical) and edge labels (categorical, string-like). I checked the community detection algorithms listed in
https://cdlib.readthedo…
-
Hi,
I interested in running CRANE for a network analysis. I been trying the implementation in the NetZooR package.
In the paper it's mentioned that CRANE can be used with other methods outside of…
-
- Graph construction was implemented using `rustworkx` in #234, I want to mention that the `rustworkx` python interface is remarkably optimized. Using Python, we can build all graph-downstream analyse…
-
Let's have a code that use "standard" community detection algorithms. Non overlapping.
Maybe networkX or whather the python library has.
Take a graph in the format we will generate DBLP
and parse i…