Ranking Potential Customers Based on Group-Ensemble

Ranking Potential Customers Based on Group-Ensemble

Zhi-Zhuo Zhang (South China University of Technology, China), Qiong Chen (South China University of Technology, China), Shang-Fu Ke (South China University of Technology, China), Yi-Jun Wu (South China University of Technology, China), Fei Qi (South China University of Technology, China) and Ying-Peng Zhang (South China University of Technology, China)
Copyright: © 2008 |Pages: 11
DOI: 10.4018/jdwm.2008040109
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

Ranking potential customers has become an effective tool for company decision makers to design marketing strategies. The task of PAKDD competition 2007 is a cross-selling problem between credit card and home loan, which can also be treated as a ranking potential customers problem. This article proposes a 3-level ranking model, namely Group-Ensemble, to handle such kinds of problems. In our model, Bagging, RankBoost and Expending Regression Tree are applied to solve crucial data mining problems like data imbalance, missing value and time-variant distribution. The article verifies the model with data provided by PAKDD Competition 2007 and shows that Group-Ensemble can make selling strategy much more efficient.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
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