Skip to main content

A Non-Sequential Representation of Sequential Data for Churn Prediction.

Eastwood, M. and Gabrys, B., 2009. A Non-Sequential Representation of Sequential Data for Churn Prediction. In: Knowledge-Based and Intelligent Information and Engineering Systems: 13th International Conference, KES 2009, Santiago, Chile, September 28-30, 2009, Proceedings, Part I. Heidelberg: Springer, 209-218.

Full text available as:

NN_CHURN_FULL.PDF - Accepted Version


Official URL:

DOI: 10.1007/978-3-642-04595-0_26


We investigate the length of event sequence giving best predictions when using a continuous HMM approach to churn prediction from sequential data. Motivated by observations that predictions based on only the few most recent events seem to be the most accurate, a non-sequential dataset is constructed from customer event histories by averaging features of the last few events. A simple K-nearest neighbor algorithm on this dataset is found to give significantly improved performance. It is quite intuitive to think that most people will react only to events in the fairly recent past. Events related to telecommunications occurring months or years ago are unlikely to have a large impact on a customer’s future behaviour, and these results bear this out. Methods that deal with sequential data also tend to be much more complex than those dealing with simple nontemporal data, giving an added benefit to expressing the recent information in a non-sequential manner.

Item Type:Book Section
Series Name:Lecture Notes in Computer Science
Number of Pages:381
Group:Faculty of Science & Technology
ID Code:9965
Deposited By: Professor Bogdan Gabrys LEFT
Deposited On:12 Jun 2009 00:06
Last Modified:14 Mar 2022 13:22


Downloads per month over past year

More statistics for this item...
Repository Staff Only -