Purchase Signatures of Retail Customers

  • Clement Gautrais
  • René Quiniou
  • Peggy Cellier
  • Thomas Guyet
  • Alexandre Termier
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10234)


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.


Reconstruction Error Periodic Pattern Jaccard Similarity Individual Customer Personalized Marketing 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 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. 2.
    Agrawal, R., Srikant, R.: Mining sequential patterns. In: Proceedings of 11th International Conference on Data Engineering, pp. 3–14 (1995)Google Scholar
  3. 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)CrossRefGoogle Scholar
  4. 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. 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)CrossRefGoogle Scholar
  6. 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. 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. 8.
    Mannila, H., Toivonen, H., Verkamo, A.I.: Discovery of frequent episodes in event sequences. Data Min. Knowl. Disc. 1(3), 259–289 (1997)CrossRefGoogle Scholar
  9. 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. 10.
    Bingham, E.: Finding segmentations of sequences. In: Inductive Databases and Constraint-Based Data Mining, pp. 177–197 (2010)Google Scholar
  11. 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. 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. 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)CrossRefGoogle Scholar
  14. 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. 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. 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)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Clement Gautrais
    • 1
  • René Quiniou
    • 2
  • Peggy Cellier
    • 3
  • Thomas Guyet
    • 4
  • Alexandre Termier
    • 1
  1. 1.University of Rennes 1, IRISARennesFrance
  2. 2.Inria Rennes, IRISARennesFrance
  3. 3.INSA Rennes, IRISARennesFrance
  4. 4.Agrocampus Ouest, IRISARennesFrance

Personalised recommendations