-
Notifications
You must be signed in to change notification settings - Fork 11
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Community detection #4
Comments
I would like to help on this. I see this is a relatively old issue, Is there already something set up? |
Hi @alejandrox1 nope this one's just on the list but not yet started. I'll DM you on Slack to talk about getting started! |
Hello, time to get started! There are many ways to get this started, there are different consensus on the best tools/methods to use and what data is most important for community detection in social media. I have included a couple references I found interesting in here: First of all, I would like to encourage everyone contribute whatever references you have found interesting so that we can have them all in one place. In terms of possible projects within this issue are those related to building networks, visualization, analysis, prediction, and performance. To get started on any of these topics check out these tutorials:
These tutorials briefly cover how to build networks, visualize them, some measures that can be used to analyze the network, and link prediction Also, there is the library community, which works on top of networkx and is used for community detection: Graph Databases |
Hey there! I might be able to help out with this -- I worked on both the algorithmic and engineering sides of community detection at Scale Model. I'll share some scattered thoughts below. We used friendships between users to build graphs (eg. user A follows user B => A -> B), although we had to drop directionality since, IIRC, Louvain (which we also used) cannot partition directed graphs. I've used both igraph and networkx for building and partitioning Twitter subgraphs. Note that igraph is actually a C-optimized graph library similar to networkx. You'll find networkx to be easy but slow, while igraph has a more esoteric API that runs way faster. I actually think the best large-scale graph solution is something like GraphX, while igraph is best for partitioning smaller graphs efficiently (if we don't have money to throw at this problem, like your average startup :) ). Feel free to message me on D4D Slack (achompas) or on here if you have any specific questions. |
I'm closing this issue as it has moved to Assemble |
There are lots of ways to do community detection using Twitter data. We'll want to discuss the nuts-and-bolts on Slack but once we select an implementation we like we can track progress here. There's lots of neat emerging research we could try out, too (i.e. https://arxiv.org/pdf/1608.01771v1.pdf)!
The text was updated successfully, but these errors were encountered: