Ask HN: How would you pick successful YC applications?
Suppose you have been asked to pick 300 successful applications out of 6000 YC applications in 20 days. You realize that the usual rules [0] are tough to apply given the time constraints. How would you go about doing this?
[0] http://ycombinator.com/howtoapply.html
7 comments
[ 2.8 ms ] story [ 27.5 ms ] threadTrain a naive Bayesian classifier on 25% of the successful and non-successful applications to date. Run it on the last batch's applications. Observe if results look promising. If they do, run it against the 6,000 applications, splitting them into three groups based on how promising they looked. Group A gets the most attention, Group B gets middling attention, Group C gets attention as resources permit.
Alternatively, same deal but train with data from only the applications which went on to be successful YC companies.
There are any number of fairly obvious problems with this approach, but scarily, in many, many fields dumb algorithms beat smart people because dumb algorithms apply the meat-and-potatoes part of the classification successfully every single time. (e.g. Credit risk scoring roflstomps over experienced credit underwriters for making consumer credit decisions, partially because it is free at the margin and partially because if you think the intangibles like an applicant's character is more important than their credit history statistically speaking you are wrong.)
Now I'm pondering my mind on what criteria you're running the naive Bayesian classifier since most of the questions in the application form are text, so hard to compare I guess.
So in a quick first pass it's probably not too hard to weed out the no's which would take the applications down to a managable number.