Mining Shoppers Data Streams to Predict Customers Loyalty

V. Nikulin, Tian-Hsiang Huang, Jian-De Lu
{"title":"Mining Shoppers Data Streams to Predict Customers Loyalty","authors":"V. Nikulin, Tian-Hsiang Huang, Jian-De Lu","doi":"10.1109/ISKE.2015.28","DOIUrl":null,"url":null,"abstract":"For a consumer brand, the most valuable customers are those who return after this purchase. Therefore, we want to know if it is possible to predict which shoppers will buy a new item with enough purchase history. Fortunately, while dealing with Big Data and with data streams in particular, it is a common practice to summarize or aggregate customers' transaction history to the periods of few months. As an outcome, we compress the given huge volume of data, and transfer the data stream to the standard rectangular format. Consequently, we can explore a variety of practically or theoretically motivated tasks. For example, we can rank the given field of customers in accordance to their loyalty or intension to repurchase in the near future. This objective has very important practical application. It leads to preferential treatment of the right customers. We tested our model (with competitive results) online during Kaggle-based Acquire Valued Shoppers Challenge in 2014.","PeriodicalId":312629,"journal":{"name":"2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISKE.2015.28","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

For a consumer brand, the most valuable customers are those who return after this purchase. Therefore, we want to know if it is possible to predict which shoppers will buy a new item with enough purchase history. Fortunately, while dealing with Big Data and with data streams in particular, it is a common practice to summarize or aggregate customers' transaction history to the periods of few months. As an outcome, we compress the given huge volume of data, and transfer the data stream to the standard rectangular format. Consequently, we can explore a variety of practically or theoretically motivated tasks. For example, we can rank the given field of customers in accordance to their loyalty or intension to repurchase in the near future. This objective has very important practical application. It leads to preferential treatment of the right customers. We tested our model (with competitive results) online during Kaggle-based Acquire Valued Shoppers Challenge in 2014.
挖掘购物者数据流预测顾客忠诚度
对于一个消费品牌来说,最有价值的客户是那些在购买后回来的人。因此,我们想知道是否有可能预测哪些购物者会购买具有足够购买历史记录的新商品。幸运的是,在处理大数据,特别是处理数据流时,将客户的交易历史汇总到几个月的周期是一种常见的做法。因此,我们对给定的海量数据进行压缩,并将数据流转换为标准的矩形格式。因此,我们可以探索各种实际或理论上的动机任务。例如,我们可以根据客户的忠诚度或在不久的将来再次购买的意向对给定的客户字段进行排名。这一目标具有非常重要的实际应用。它导致了对合适客户的优惠待遇。2014年,我们在基于kaggle的“获取有价值购物者挑战赛”中在线测试了我们的模型(结果很有竞争力)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信