Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Exploring the prediction of variety-seeking behavior
Li J., Zhao J., Mao M., Zhao X., Zou J.  DSIT 2019 (Proceedings of the 2nd International Conference on Data Science and Information Technology, Seoul, South Korea, Jul 19-21, 2019)59-63.2019.Type:Proceedings
Date Reviewed: Oct 23 2019

Modern marketing applies data analytics to determine measures that influence a customer’s future purchase decisions based on past behavior. One aspect of this behavior is that customers like to vary their purchases over time by choosing alternative products or shops. This paper aims to improve our understanding of variety-seeking behavior via a data analytics framework that determines the important features influencing purchase decisions and predicts the likelihood of future variation.

The methodology is not just based on data about past consumption, but also demographic data (from loyalty cards) and environmental data (time of purchase and current weather conditions). From this, the preprocessing step selects an appropriate feature set and prepares a dataset that is suitable for machine learning. Part of the dataset is used to train four standard machine learning algorithms, whose results are then combined by an ensemble learning method to a joint model.

The experiments performed on a large dataset of Chinese university students who buy meals in several canteens with their student cards (apparently data privacy considerations do not play a role) are particularly interesting. The results demonstrate that past consumption and environment are the most important features, and considering a past consumption record of only seven days gives the best results. While the achieved 67 percent precision for behavior prediction is not overly impressive, more features will be investigated to yield more accurate models.

Reviewer:  Wolfgang Schreiner Review #: CR146740 (2002-0037)
Bookmark and Share
  Featured Reviewer  
 
Combinatorial Algorithms (G.2.1 ... )
 
 
Decision Support (H.4.2 ... )
 
 
Symbolic and Algebraic Manipulation (I.1 )
 
Would you recommend this review?
yes
no
Other reviews under "Combinatorial Algorithms": Date
The complexity of combinatorial problems with succinct input representation
Wagner K. (ed) Acta Informatica 23(3): 325-356, 1986. Type: Article
Dec 1 1988
An optimal algorithm for parallel selection
Akl S. Information Processing Letters 19(1): 47-50, 1984. Type: Article
Nov 1 1985
A performance guarantee for the greedy set-partitioning algorithm
E G. J., Langston M. Acta Informatica 21(4): 409-415, 1984. Type: Article
May 1 1985
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy