Using a Predictive Rating System for Computer Programmers to Optimise Recruitment: Using Ratings to Optimise Programmer Recruitment

Using a Predictive Rating System for Computer Programmers to Optimise Recruitment: Using Ratings to Optimise Programmer Recruitment

Paul J. Bracewell (DOT loves data, Wellington, New Zealand), Ankit K. Patel (DOT loves data, Wellington, New Zealand), Evan J. Blackie (DOT loves data, Wellington, New Zealand) and Chris Boys (Umano, Sydney, Australia)
Copyright: © 2017 |Pages: 14
DOI: 10.4018/JCIT.2017070101
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

Using a quantitative assessment system, the number of resumes reviewed to identify a suitable developer was reduced to 3.5% with a successful recruitment decision made in 10 working days of posting the job advertisement. This paper summarises the methodology for developing that rating system. The depth and quality of an available talent pool is a function of demand, which is demonstrated by comparing globally-scaled individual performance metrics. Public code repositories are accessed and the code quality assessed algorithmically. The performance score combines accuracy, timeliness and difficulty from a series of challenges. These three attributes form a meaningful predictive measure of performance by using a non-linear optimisation routine. Bootstrapping is used to validate the approach. This process randomly omitted a scored performance observation per coder in order to calculate the performance score from the retained scores. There was a strong relationship (r = 0.70) between the predicted 1-omitted-performance score with the actual omitted score highlighting the predictive power.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 19: 4 Issues (2017)
Volume 18: 4 Issues (2016)
Volume 17: 4 Issues (2015)
Volume 16: 4 Issues (2014)
Volume 15: 4 Issues (2013)
Volume 14: 4 Issues (2012)
Volume 13: 4 Issues (2011)
Volume 12: 4 Issues (2010)
Volume 11: 4 Issues (2009)
Volume 10: 4 Issues (2008)
Volume 9: 4 Issues (2007)
Volume 8: 4 Issues (2006)
Volume 7: 4 Issues (2005)
Volume 6: 1 Issue (2004)
Volume 5: 1 Issue (2003)
Volume 4: 1 Issue (2002)
Volume 3: 1 Issue (2001)
Volume 2: 1 Issue (2000)
Volume 1: 1 Issue (1999)
View Complete Journal Contents Listing