Predicting Future Customers via Ensembling Gradually Expanded Trees

Predicting Future Customers via Ensembling Gradually Expanded Trees

Yang Yu, De-Chuan Zhan, Xu-Ying Liu, Ming Li, Zhi-Hua Zhou
Copyright: © 2007 |Pages: 10
DOI: 10.4018/jdwm.2007040102
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $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
Volume 20: 1 Issue (2024)
Volume 19: 6 Issues (2023)
Volume 18: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 17: 4 Issues (2021)
Volume 16: 4 Issues (2020)
Volume 15: 4 Issues (2019)
Volume 14: 4 Issues (2018)
Volume 13: 4 Issues (2017)
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