Family profile mining in retailing

作者:

Highlights:

• We propose a family profiling algorithm based on unlabeled transaction data.

• We employ the positive and unlabeled learning technique to tag customers.

• Our algorithm can achieve a higher recall rate than its benchmarks.

• The inferred family profiles can enhance the product recommendation performance.

摘要

In the era of personalized marketing, the ability to leverage data analysis to recommend tailored products is a key competitive advantage for retailers. Family profiles are an essential aspect of customer information to boost the performance of knowledge-based recommendations. This study integrates positive and unlabeled learning and feature selection techniques to design a novel and flexible family profiling algorithm that tags target customers based on unlabeled transaction data. The empirical evaluation shows that our algorithm outperforms other algorithms in terms of the recall rate of families of the target tag. The knowledge of inferred family profiles also enhances the product recommendation performance. Our algorithm can help retailers efficiently target customers based on family profiles for better marketing performance.

论文关键词:Family profiles,Database marketing,Positive and unlabeled (PU) learning,Feature selection,Unlabeled learning

论文评审过程:Received 9 July 2018, Revised 29 January 2019, Accepted 29 January 2019, Available online 1 February 2019, Version of Record 25 February 2019.

论文官网地址:https://doi.org/10.1016/j.dss.2019.01.007