<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Algorithmic recruitment with GitHub</title>
	<atom:link href="http://www.hackdiary.com/2010/02/10/algorithmic-recruitment-with-github/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.hackdiary.com/2010/02/10/algorithmic-recruitment-with-github/</link>
	<description></description>
	<lastBuildDate>Fri, 19 Feb 2010 13:50:20 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
	<item>
		<title>By: Jim Lindstrom</title>
		<link>http://www.hackdiary.com/2010/02/10/algorithmic-recruitment-with-github/comment-page-1/#comment-8763</link>
		<dc:creator>Jim Lindstrom</dc:creator>
		<pubDate>Fri, 19 Feb 2010 13:50:20 +0000</pubDate>
		<guid isPermaLink="false">http://www.hackdiary.com/?p=209#comment-8763</guid>
		<description>I had trouble getting the java portion of this running so I adapted it to run all in ruby, using the igraph library.  If anyone&#039;s interested I&#039;ll put it up here briefly:

http://www.columbia.edu/~jbl2132/graph_jbl.rb

I also ran it for New York.  If you&#039;re interested, let me know (jim at researchmob dot com).</description>
		<content:encoded><![CDATA[<p>I had trouble getting the java portion of this running so I adapted it to run all in ruby, using the igraph library.  If anyone&#8217;s interested I&#8217;ll put it up here briefly:</p>
<p><a href="http://www.columbia.edu/~jbl2132/graph_jbl.rb" rel="nofollow">http://www.columbia.edu/~jbl2132/graph_jbl.rb</a></p>
<p>I also ran it for New York.  If you&#8217;re interested, let me know (jim at researchmob dot com).</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: In The Know v1.07 Five Links To Expand Your HR View &#124; HR Examiner with John Sumser</title>
		<link>http://www.hackdiary.com/2010/02/10/algorithmic-recruitment-with-github/comment-page-1/#comment-8762</link>
		<dc:creator>In The Know v1.07 Five Links To Expand Your HR View &#124; HR Examiner with John Sumser</dc:creator>
		<pubDate>Fri, 19 Feb 2010 02:43:09 +0000</pubDate>
		<guid isPermaLink="false">http://www.hackdiary.com/?p=209#comment-8762</guid>
		<description>[...] Algorithmic recruitment with GitHub Future talent markets will include demonstrations of skills and social network analysis. This piece (from a geek, not an HR player) shows the beginnings of that process. GitHub is a website where coders can leave examples of their work. The author steps through the use of an algorithm to find the right talent. [...]</description>
		<content:encoded><![CDATA[<p>[...] Algorithmic recruitment with GitHub Future talent markets will include demonstrations of skills and social network analysis. This piece (from a geek, not an HR player) shows the beginnings of that process. GitHub is a website where coders can leave examples of their work. The author steps through the use of an algorithm to find the right talent. [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Recruiting smart people &#124; s-anand.net</title>
		<link>http://www.hackdiary.com/2010/02/10/algorithmic-recruitment-with-github/comment-page-1/#comment-8757</link>
		<dc:creator>Recruiting smart people &#124; s-anand.net</dc:creator>
		<pubDate>Sun, 14 Feb 2010 18:31:01 +0000</pubDate>
		<guid isPermaLink="false">http://www.hackdiary.com/?p=209#comment-8757</guid>
		<description>[...] Biddulph talks about Algorithmic recruitment with Github. The premise is that smart programmers are at the centre of the social networks in their respective [...]</description>
		<content:encoded><![CDATA[<p>[...] Biddulph talks about Algorithmic recruitment with Github. The premise is that smart programmers are at the centre of the social networks in their respective [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Matt Biddulph</title>
		<link>http://www.hackdiary.com/2010/02/10/algorithmic-recruitment-with-github/comment-page-1/#comment-8756</link>
		<dc:creator>Matt Biddulph</dc:creator>
		<pubDate>Sun, 14 Feb 2010 10:49:23 +0000</pubDate>
		<guid isPermaLink="false">http://www.hackdiary.com/?p=209#comment-8756</guid>
		<description>Jilles, nice to see someone from Nokia drop by. I hope nobody thinks that by calculating this highly biased metric I&#039;m dismissing anyone who doesn&#039;t score well in it. Of course there are all sorts of reasons why people don&#039;t have code on github that don&#039;t make them bad engineers. 

As an aside: you may not contribute to OSS but you care enough to write interesting stuff at jillesvangurp.com, another good indicator of interesting people (that the metric in this post also ignores).</description>
		<content:encoded><![CDATA[<p>Jilles, nice to see someone from Nokia drop by. I hope nobody thinks that by calculating this highly biased metric I&#8217;m dismissing anyone who doesn&#8217;t score well in it. Of course there are all sorts of reasons why people don&#8217;t have code on github that don&#8217;t make them bad engineers. </p>
<p>As an aside: you may not contribute to OSS but you care enough to write interesting stuff at jillesvangurp.com, another good indicator of interesting people (that the metric in this post also ignores).</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jilles van Gurp</title>
		<link>http://www.hackdiary.com/2010/02/10/algorithmic-recruitment-with-github/comment-page-1/#comment-8755</link>
		<dc:creator>Jilles van Gurp</dc:creator>
		<pubDate>Sun, 14 Feb 2010 10:40:49 +0000</pubDate>
		<guid isPermaLink="false">http://www.hackdiary.com/?p=209#comment-8755</guid>
		<description>Hey Matt, this is a great way of scouting out new talent for on our floor :-). Only thing is, many developers (me included) actually don&#039;t commit that much code to OSS projects. I don&#039;t code much outside of work. My way of staying sane, I need my downtime after a long day of programming on the job. 

And working for Nokia, makes on the job contributions kind of a grey area , since it is not up to me to decide on what are technically and legally Nokia owned IPR contributions to outside projects.

Does that make me a bad engineer?

You might want to check out ohloh.net. They don&#039;t seem to have a geographic feature but there are a lot of nice statistics about what people do on which projects.</description>
		<content:encoded><![CDATA[<p>Hey Matt, this is a great way of scouting out new talent for on our floor :-). Only thing is, many developers (me included) actually don&#8217;t commit that much code to OSS projects. I don&#8217;t code much outside of work. My way of staying sane, I need my downtime after a long day of programming on the job. </p>
<p>And working for Nokia, makes on the job contributions kind of a grey area , since it is not up to me to decide on what are technically and legally Nokia owned IPR contributions to outside projects.</p>
<p>Does that make me a bad engineer?</p>
<p>You might want to check out ohloh.net. They don&#8217;t seem to have a geographic feature but there are a lot of nice statistics about what people do on which projects.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tonći Galić</title>
		<link>http://www.hackdiary.com/2010/02/10/algorithmic-recruitment-with-github/comment-page-1/#comment-8753</link>
		<dc:creator>Tonći Galić</dc:creator>
		<pubDate>Wed, 10 Feb 2010 23:10:34 +0000</pubDate>
		<guid isPermaLink="false">http://www.hackdiary.com/?p=209#comment-8753</guid>
		<description>Many connections doesn&#039;t mean one produces quality code, but it&#039;s sure a nice approach to finding interesting people. I&#039;ll have a look at it, perhaps it could be applied to twitter and other SNs?

Thanx for sharing :)</description>
		<content:encoded><![CDATA[<p>Many connections doesn&#8217;t mean one produces quality code, but it&#8217;s sure a nice approach to finding interesting people. I&#8217;ll have a look at it, perhaps it could be applied to twitter and other SNs?</p>
<p>Thanx for sharing :)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Eric</title>
		<link>http://www.hackdiary.com/2010/02/10/algorithmic-recruitment-with-github/comment-page-1/#comment-8750</link>
		<dc:creator>Eric</dc:creator>
		<pubDate>Wed, 10 Feb 2010 18:58:45 +0000</pubDate>
		<guid isPermaLink="false">http://www.hackdiary.com/?p=209#comment-8750</guid>
		<description>Berlin is the shittiest city i&#039;ve ever lived in. I hope you fail in fooling people to move here.</description>
		<content:encoded><![CDATA[<p>Berlin is the shittiest city i&#8217;ve ever lived in. I hope you fail in fooling people to move here.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Charles</title>
		<link>http://www.hackdiary.com/2010/02/10/algorithmic-recruitment-with-github/comment-page-1/#comment-8749</link>
		<dc:creator>Charles</dc:creator>
		<pubDate>Wed, 10 Feb 2010 18:47:37 +0000</pubDate>
		<guid isPermaLink="false">http://www.hackdiary.com/?p=209#comment-8749</guid>
		<description>Not all people doing interesting, secret stuff aren&#039;t checking it into Github (in fact, anyone doing secret stuff DEFINITELY wouldn&#039;t).  Bad source dataset to start from!</description>
		<content:encoded><![CDATA[<p>Not all people doing interesting, secret stuff aren&#8217;t checking it into Github (in fact, anyone doing secret stuff DEFINITELY wouldn&#8217;t).  Bad source dataset to start from!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Daniel Haran</title>
		<link>http://www.hackdiary.com/2010/02/10/algorithmic-recruitment-with-github/comment-page-1/#comment-8747</link>
		<dc:creator>Daniel Haran</dc:creator>
		<pubDate>Wed, 10 Feb 2010 18:16:48 +0000</pubDate>
		<guid isPermaLink="false">http://www.hackdiary.com/?p=209#comment-8747</guid>
		<description>Betweenness is a great metric for finding the people that will know who&#039;s available. Some &quot;PeopleRank&quot; like algorithm would be more likely to find those people that have deep expertise without being very social.

I&#039;d love to see results for my city (Montreal, QC) for Rails.</description>
		<content:encoded><![CDATA[<p>Betweenness is a great metric for finding the people that will know who&#8217;s available. Some &#8220;PeopleRank&#8221; like algorithm would be more likely to find those people that have deep expertise without being very social.</p>
<p>I&#8217;d love to see results for my city (Montreal, QC) for Rails.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tom</title>
		<link>http://www.hackdiary.com/2010/02/10/algorithmic-recruitment-with-github/comment-page-1/#comment-8746</link>
		<dc:creator>Tom</dc:creator>
		<pubDate>Wed, 10 Feb 2010 18:12:09 +0000</pubDate>
		<guid isPermaLink="false">http://www.hackdiary.com/?p=209#comment-8746</guid>
		<description>I read out your list (of things to love) and Christi here thought that I said &quot;curry versed&quot;. Clearly the Haskell books I leave lying around haven&#039;t gone unnoticed.

I would definitely be interested in seeing you adapt this method to include (a) people on Github and Dopplr who already travel to Berlin a lot and (b) people who actively contribute on github, not just people who are well connected.

But I get that contributing is harder to measure, and that you probably don&#039;t have a github-dopplr username mapping just sitting around, even with all your connections ;)</description>
		<content:encoded><![CDATA[<p>I read out your list (of things to love) and Christi here thought that I said &#8220;curry versed&#8221;. Clearly the Haskell books I leave lying around haven&#8217;t gone unnoticed.</p>
<p>I would definitely be interested in seeing you adapt this method to include (a) people on Github and Dopplr who already travel to Berlin a lot and (b) people who actively contribute on github, not just people who are well connected.</p>
<p>But I get that contributing is harder to measure, and that you probably don&#8217;t have a github-dopplr username mapping just sitting around, even with all your connections ;)</p>
]]></content:encoded>
	</item>
</channel>
</rss>
