Join GitHub today
GitHub is home to over 28 million developers working together to host and review code, manage projects, and build software together.
Sign upLeiden algo: many communities with a single node #203
Comments
seinecle
changed the title
Leiden algo: many community with a single node
Leiden algo: many communities with a single node
Jan 31, 2019
This comment has been minimized.
This comment has been minimized.
Hi, when testing it, I found that the resolution parameter must be tweaked for every network and is quite sensitive, so you must test a few numbers until you find one that suits your network. @vtraag can you provide some help? |
This comment has been minimized.
This comment has been minimized.
vtraag
commented
Jan 31, 2019
Ah, @seinecle, I thought the problem was that it slowed down Gephi? The single community nodes may simply not fit anywhere else better. Indeed this will be affected by the resolution parameter. Louvain may leave these nodes in larger communities, while they shouldn't. @eduramiba, is it convenient to keep this issue here? Or is vtraag/gephi-leiden-plugin more suitable for tracking issues around this specific plugin? |
This comment has been minimized.
This comment has been minimized.
@vtraag I think your repository would be a better place, yes. |
This comment has been minimized.
This comment has been minimized.
seinecle
commented
Jan 31, 2019
•
Hey! (yes, can't see issues in vtraag/gephi-leiden-plugin) |
This comment has been minimized.
This comment has been minimized.
vtraag
commented
Jan 31, 2019
Sorry, I didn't realize the issue tracker wasn't open! I've now opened it at https://github.com/vtraag/gephi-leiden-plugin/issues. If we move it there, we can close this one, and continue the conversation there. Thanks! |
This comment has been minimized.
This comment has been minimized.
vtraag
commented
Jan 31, 2019
•
@eduramiba regarding a strategy good resolution parameter for CPM, this is always a bit trial and error. There are some ways to scan entire resolution ranges, to see how things change for different resolution parameters (I've written about that here). As a starting point, a resolution parameter around the average edge weight (i.e. graph density), should be reasonable. But there is no magic formula unfortunately, and any resolution parameter may potentially be of interest. I should add that for the Modularity quality function the default resolution parameter of 1 is also quite arbitrary in a sense, even though that may similarly be a good starting point for further exploration. |
This comment has been minimized.
This comment has been minimized.
vtraag
commented
Jan 31, 2019
Moved to vtraag#2, @eduramiba, you can close this one. |
seinecle commentedJan 31, 2019
The algo finds many communities which are made of just one node, even when these nodes are not isolated. That is not very useful and actually on large networks, this creates hundreds of communities which make the results impractical to process further.