I am searching for a library (or framework or graph db function or example code) to split a undirected weighted graph into clusters.
Additional requirement would be that you can configure the numbers of clusters generated.
I already looked at different things:
Does anyone know any other graph clustering algorithm implementations accessible for Java?
Thank you!
Gephi is implemented in Java and contains various community detection algorithms (check the available plugins). It is open source and there's an API system allowing you to integrate its classes in your own source code, or the opposite (develop gephi modules).
See also the answers to this question: https://stats.stackexchange.com/questions/2948/how-to-do-community-detection-in-a-weighted-social-network-graph
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With