Predicting Future Customers via Ensembling Gradually Expanded Trees

Predicting Future Customers via Ensembling Gradually Expanded Trees

Yang Yu (National Laboratory for Novel Software Technology, China), De-Chuan Zhan (National Laboratory for Novel Software Technology, China), Xu-Ying Liu (National Laboratory for Novel Software Technology, China), Ming Li (National Laboratory for Novel Software Technology, China) and Zhi-Hua Zhou (National Laboratory for Novel Software Technology, China)
Copyright: © 2007 |Pages: 10
DOI: 10.4018/jdwm.2007040102
OnDemand PDF Download:
$37.50

Abstract

Our LAMDAer team has won the 10th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD) 2006 Data Mining Competition (open category) grand champion. This report presents our solution to the PAKDD 2006 Data Mining Competition. Following a brief description of the task, we discuss the difficulties of the task and explain the motivation of our solution. Then, we propose the Gradually Expanded Tree Ensemble (GetEnsemble) method, which handles the difficulties via ensembling expanded trees. We evaluated the proposed method and several other methods using AUC, and found the proposed method beats others in this task. Besides, we show how to obtain cues on which kind of second generation (2G) customers are likely to become third generation (3G) users with the proposed method.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 13: 4 Issues (2017): Forthcoming, Available for Pre-Order
Volume 12: 4 Issues (2016): 2 Released, 2 Forthcoming
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