The Power of Sampling and Stacking for the PaKDD-2007 Cross-Selling Problem

The Power of Sampling and Stacking for the PaKDD-2007 Cross-Selling Problem

Paulo J.L. Adeodato (NeuroTech Ltd. and Federal University of Pernambuco, Brazil), Germano C. Vasconcelos (NeuroTech Ltd. and Federal University of Pernambuco, Brazil), Adrian L. Arnaud (NeuroTech Ltd. and Federal University of Pernambuco, Brazil), Rodrigo C.L.V. Cunha (NeuroTech Ltd. and Federal University of Pernambuco, Brazil), Domingos S.M.P. Monteiro (NeuroTech Ltd. and Federal University of Pernambuco, Brazil) and Rosalvo F.O. Neto (NeuroTech Ltd. and Federal University of Pernambuco, Brazil)
Copyright: © 2008 |Pages: 10
DOI: 10.4018/jdwm.2008040104
OnDemand PDF Download:
$37.50

Abstract

This article presents an efficient solution for the PAKDD-2007 Competition cross-selling problem. The solution is based on a thorough approach which involves the creation of new input variables, efficient data preparation and transformation, adequate data sampling strategy and a combination of two of the most robust modeling techniques. Due to the complexity imposed by the very small amount of examples in the target class, the approach for model robustness was to produce the median score of the 11 models developed with an adapted version of the 11-fold cross-validation process and the use of a combination of two robust techniques via stacking, the MLP neural network and the n-tuple classifier. Despite the problem complexity, the performance on the prediction data set (unlabeled samples), measured through KS2 and ROC curves was shown to be very effective and finished as the first runner-up solution of the competition.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 13: 4 Issues (2017): 2 Released, 2 Forthcoming
Volume 12: 4 Issues (2016)
Volume 11: 4 Issues (2015)
Volume 10: 4 Issues (2014)
Volume 9: 4 Issues (2013)
Volume 8: 4 Issues (2012)
Volume 7: 4 Issues (2011)
Volume 6: 4 Issues (2010)
Volume 5: 4 Issues (2009)
Volume 4: 4 Issues (2008)
Volume 3: 4 Issues (2007)
Volume 2: 4 Issues (2006)
Volume 1: 4 Issues (2005)
View Complete Journal Contents Listing