Developing a text classifier with constrained development and execution time
Ivan Budiselić, Goran Delač, Klemo Vladimir · 2014
The aim of this paper is to show that an accurate and efficient text classifier for relatively simple problem domains can be created in only a few hours of development time. The motivating example discussed in the paper is a recent HackerRank competition problem that tasked competitors with creating a classifier for questions from the popular question and answer platform StackExchange. The paper describes the key components of one solution to this problem, and briefly overviews the naive Bayes classifier that is the basis of the solution. The discussion is focused on feature selection and example representation which were the key challenges to be addressed during the development of this classifier. We also analyze the effect of the number of features on accuracy, training and classification time and the size of the resulting classifier and the representation of the training examples which were all important characteristics for the competition. The described classifier achieved slightly over 89% accuracy on the hidden question set, while the winning submission achieved around 92%.