Skip to main content

Purchase Signatures of Retail Customers

  • Conference paper
  • First Online:
Advances in Knowledge Discovery and Data Mining (PAKDD 2017)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10234))

Included in the following conference series:

Abstract

In the retail context, there is an increasing need for understanding individual customer behavior in order to personalize marketing actions. We propose the novel concept of customer signature, that identifies a set of important products that the customer refills regularly. Both the set of products and the refilling time periods give new insights on the customer behavior. Our approach is inspired by methods from the domain of sequence segmentation, thus benefiting from efficient exact and approximate algorithms. Experiments on a real massive retail dataset show the interest of the signatures for understanding individual customers.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    For the sake of simplicity, we focus here on a bitmap representation. To cope with memory consumption, a more efficient representation method, such as the dynamic bit vector (DBV) architecture, could be used [13].

References

  1. Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of 17th International Conference on Management of Data, pp. 207–216 (1993)

    Google Scholar 

  2. Agrawal, R., Srikant, R.: Mining sequential patterns. In: Proceedings of 11th International Conference on Data Engineering, pp. 3–14 (1995)

    Google Scholar 

  3. Tseng, V.S., Shie, B.-E., Wu, C.-W., Yu, P.S.: Efficient algorithms for mining high utility itemsets from transactional databases. Trans. Knowl. Data Eng. 25(8), 1772–1786 (2013)

    Article  Google Scholar 

  4. MiguĂ©is, V.L., Camanho, A.S., FalcĂ£o e Cunha, J.: Mining customer loyalty card programs: the improvement of service levels enabled by innovative segmentation and promotions design. In: Exploring Services Science, pp. 83–97 (2011)

    Google Scholar 

  5. MiguĂ©is, V.L., Camanho, A.S., FalcĂ£o e Cunha, J.: Customer data mining for lifestyle segmentation. Expert Syst. Appl. 39(10), 9359–9366 (2012)

    Article  Google Scholar 

  6. Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMOD International Conference on Management of Data, pp. 1–12 (2000)

    Google Scholar 

  7. Cueva, P.L., Bertaux, A., Termier, A., Méhaut, J., Santana, M.: Debugging embedded multimedia application traces through periodic pattern mining. In: Proceedings of 12th International Conference on Embedded Software, pp. 13–22 (2012)

    Google Scholar 

  8. Mannila, H., Toivonen, H., Verkamo, A.I.: Discovery of frequent episodes in event sequences. Data Min. Knowl. Disc. 1(3), 259–289 (1997)

    Article  Google Scholar 

  9. Casas-Garriga, G.: Discovering unbounded episodes in sequential data. In: Proceedings 7th European Conference on Principles and Practice of Knowledge Discovery in Database, pp. 83–94 (2003)

    Google Scholar 

  10. Bingham, E.: Finding segmentations of sequences. In: Inductive Databases and Constraint-Based Data Mining, pp. 177–197 (2010)

    Google Scholar 

  11. Terzi, E., Tsaparas, P.: Efficient algorithms for sequence segmentation. In: Proceedings of SIAM Conference on Data Mining, pp. 314–325 (2006)

    Google Scholar 

  12. Ayres, J., Flannick, J., Gehrke, J., Yiu, T.: Sequential pattern mining using a bitmap representation. In: Proceedings 8th Conference on Knowledge Discovery and Data mining, pp. 429–435 (2002)

    Google Scholar 

  13. Vo, B., Hong, T.-P., Le, B.: DBV-miner: a dynamic bit-vector approach for fast mining frequent closed itemsets. Expert Syst. Appl. 39(8), 7196–7206 (2012)

    Article  Google Scholar 

  14. Han, J., Wang, J., Lu, Y., Tzvetkov, P.: Mining top-k frequent closed patterns without minimum support. In: Proceedings of International Conference on Data Mining (ICDM), pp. 211–218 (2002)

    Google Scholar 

  15. Ma, S., Hellerstein, J.L.: Mining partially periodic event patterns with unknown periods. In: Proceedings of 17th International Conference on Data Engineering, pp. 205–214 (2001)

    Google Scholar 

  16. Tibshirani, R., Walther, G., Hastie, T.: Estimating the number of clusters in a data set via the gap statistic. J. Roy. Stat. Soc.: Ser. B (Stat. Methodol.) 63(2), 411–423 (2001)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Clement Gautrais .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Gautrais, C., Quiniou, R., Cellier, P., Guyet, T., Termier, A. (2017). Purchase Signatures of Retail Customers. In: Kim, J., Shim, K., Cao, L., Lee, JG., Lin, X., Moon, YS. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2017. Lecture Notes in Computer Science(), vol 10234. Springer, Cham. https://doi.org/10.1007/978-3-319-57454-7_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-57454-7_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-57453-0

  • Online ISBN: 978-3-319-57454-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics