4 ms·

Algorithmic recruitment with GitHub

58 points by danw 17y ago

mbrubeck 17y ago
Neat! I'm attempting to generate a ranking for Seattle now. [Edit: Nevermind, this Java newbie got bored trying to figure out jars and classpaths.] I also didn't realize before that you could find users by their most-used language: http://github.com/search?type=Users&language=python&q=location:seattle&repo=&langOverride=&x=9&y=18&start_value=1 http://github.com/search?type=Users&language=python&... ...and GitHub's own results are ranked by total number of followers, which gives a simpler version of this article's "connectedness" measurement.
- grandalf 17y ago
  great, it's a popularity contest for programmers. Imagine if Ashton Kutcher started blogging via Github. I'd want to hire him immediately.
- Tichy 17y ago
  It's not a requirement to do it in Java. Just saying...
  - mbrubeck 17y ago
    I meant that I was attempting to install and run the code from the article, which is written in JRuby+Java and depends on a couple of third-party Java libraries.
    - Tichy 17y ago
      Ah, I totally missed that he published the code. Thanks!
jimbokun 17y ago
This led me to the JUNG Java library, which looks pretty cool. Thinking it could be fun to play with this in Clojure.
metabrew 17y ago
This is awesome. The full lists for SF and London are here: http://github.com/mattb/flotsam/tree/master/github-recruitment http://github.com/mattb/flotsam/tree/master/github-recruitme... Looks like I'm languishing at #27 in the London list, better get back to work..
jey 17y ago
Why betweenness centrality and not eigenvector centrality?
- deleted 17y ago
  [deleted]
- frisco 17y ago
  It's way easier to compute betweenness centrality? Eigenvector centrality requires inverting a potentially giant link matrix -- a notoriously expensive operation, which says nothing of the additional code complexity needed to do it properly.
  - brendano 17y ago
    betweenness centrality also has a nice interpretation that might make some sense for this application. or so.
  - jey 17y ago
    You can get the first eigenvector through power iteration, just take some random vector then repeatedly normalize it and multiply by the adjacency matrix. So no giant matrix inversion needed.
  - frisco 17y ago
    Also, I should point out that his reasoning for betweenness over eigvector centrality was given in a link in the article: http://www.stoweboyd.com/message/its-betweenness-that-matters-not-your-eigenvalue-the-dark-ma.html http://www.stoweboyd.com/message/its-betweenness-that-matter...
Tichy 17y ago
If it becomes more common, we might see GitHub being gamed or spammed by people trying to create artificial networks.

58 points by danw 17y ago

Neat! I'm attempting to generate a ranking for Seattle now. [Edit: Nevermind, this Java newbie got bored trying to figure out jars and classpaths.] I also didn't realize before that you could find users by their most-used language: http://github.com/search?type=Users&language=python&q=location:seattle&repo=&langOverride=&x=9&y=18&start_value=1 http://github.com/search?type=Users&language=python&... ...and GitHub's own results are ranked by total number of followers, which gives a simpler version of this article's "connectedness" measurement.

grandalf 17y ago
great, it's a popularity contest for programmers. Imagine if Ashton Kutcher started blogging via Github. I'd want to hire him immediately.
Tichy 17y ago
It's not a requirement to do it in Java. Just saying...
- mbrubeck 17y ago
  I meant that I was attempting to install and run the code from the article, which is written in JRuby+Java and depends on a couple of third-party Java libraries.
  - Tichy 17y ago
    Ah, I totally missed that he published the code. Thanks!

jimbokun 17y ago

This led me to the JUNG Java library, which looks pretty cool. Thinking it could be fun to play with this in Clojure.

metabrew 17y ago

This is awesome. The full lists for SF and London are here: http://github.com/mattb/flotsam/tree/master/github-recruitment http://github.com/mattb/flotsam/tree/master/github-recruitme... Looks like I'm languishing at #27 in the London list, better get back to work..

jey 17y ago

Why betweenness centrality and not eigenvector centrality?

deleted 17y ago
[deleted]
frisco 17y ago
It's way easier to compute betweenness centrality? Eigenvector centrality requires inverting a potentially giant link matrix -- a notoriously expensive operation, which says nothing of the additional code complexity needed to do it properly.
- brendano 17y ago
  betweenness centrality also has a nice interpretation that might make some sense for this application. or so.
- jey 17y ago
  You can get the first eigenvector through power iteration, just take some random vector then repeatedly normalize it and multiply by the adjacency matrix. So no giant matrix inversion needed.
- frisco 17y ago
  Also, I should point out that his reasoning for betweenness over eigvector centrality was given in a link in the article: http://www.stoweboyd.com/message/its-betweenness-that-matters-not-your-eigenvalue-the-dark-ma.html http://www.stoweboyd.com/message/its-betweenness-that-matter...

Tichy 17y ago

If it becomes more common, we might see GitHub being gamed or spammed by people trying to create artificial networks.