The 2009 GitHub Contest is winding to a close – less than 48 hours until the deadline to get your submissions in. If you haven’t pushed the source code for your entry yet (which is a lot of you), please remember to do so soon. You know what’s on the line:
I would also like to write up an overview of the entries. If you would like to be featured, please add a description of what you’ve done and any further reading on your approaches to your README and send me an email (scott at github) – even if you didn’t get very high in the rankings. Unfortunately the dataset I put out there wasn’t perfect – most people found a good percentage of my removed results by adding the parents of forked repositories, which by itself gave people a big boost. However, I’m not interested in writing that type of GitHub specific stuff up – I want to know the rest of the algorithm – the parts that would be useful to any dataset or website trying to do something similar. Please let me know about what you’ve done, what you tried, what worked well – I would like to share it with everyone and point to your code.
A great example of a project that is both fantastically open and describes most of what they are doing this way is Jeremy Barnes entry – it is really an amazing writeup on one of the best performing entries out there.
Good luck in the home stretch, everybody!