Oscillation Heuristics for the Two-group Classification Problem

• Autores: Ognian Asparouhou, Paul A. Rubin
• Localización: Journal of classification, ISSN 0176-4268, Vol. 21, Nº 2, 2004, págs. 255-277
• Idioma: inglés
• DOI: 10.1007/s00357-004-0019-7
• Texto completo no disponible (Saber más ...)
• Resumen

  • We propose a new nonparametric family of oscillation heuristics for improving linear classifiers in the two-group discriminant problem. The heuristics are motivated by the intuition that the classification accuracy of a separating hyperplane can be improved through small perturbations to its slope and position, accomplished by substituting training observations near the hyperplane for those used to generate it. In an extensive simulation study, using data generated from multivariate normal distributions under a variety of conditions, the oscillation heuristics consistently improve upon the classical linear and logistic discriminant functions, as well as two published linear programming-based heuristics and a linear Support Vector Machine. Added to any of the methods above, they approach, and frequently attain, the best possible accuracy on the training samples, as determined by a mixed-integer programming (MIP) model, at a much smaller computational cost. They also improve expected accuracy on the overall populations when the populations overlap significantly and the heuristics are trained with large samples, at least in situations where the data conditions do not explicitly favor a particular classifier.