Skip to main content

A Practical Approach to the Shopping Path Clustering

  • Conference paper
  • First Online:
Current Approaches in Applied Artificial Intelligence (IEA/AIE 2015)

Abstract

This paper proposes a new clustering approach for customer shopping paths. The approach is based on the Apriori algorithm and LCS (Longest Common Subsequence) algorithms. We devised new similarity and performance measurements for the clustering. In this approach, we do not require data normalization for preprocessing, which leads to an easy and practical application and implementation of the proposed approach. The experiment results show that the proposed approach performs well compared with k-medoids clustering.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proceedings of the VLDB Conference, Santiago, Chile. Expanded version available as IBM Research Report RJ9839 (1994)

    Google Scholar 

  2. Hirschberg, D.S.: Algorithms for the Longest Common Subsequence Problem. Journal of ACM 24(4), 664–675 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  3. Larson, J.S., Bradlow, E.T., Fader, P.S.: An Exploratory Look at Supermarket Shopping Paths. J. of Research in Marketing 22, 359–414 (2005)

    Article  Google Scholar 

  4. Newman, A.J., Yu, D.K.C., Oulton, D.P.: New Insights into Retail Space and Format Planning from Customer-tracking Data. Journal of Retailing and Customer Service 9(5), 254–258 (2002)

    Article  Google Scholar 

  5. Shmueli, G., Patel, N.R., Bruce, P.C.: Data Mining for Business Intelligence. John Wiley & Sons, Inc. (2007)

    Google Scholar 

  6. Pandit, A., Talreja, J., Agarwal, M., Prasad, D., Baheti, S., Khalsa, G.: Intelligent Recommender System using Shopper’s Path and Purchase Analysis. In: Proceedings of International Conference on Computational Intelligence and Communication Networks, pp. 597–602 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Young S. Kwon .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Jung, IC., Alex Syaekhoni, M., Kwon, Y.S. (2015). A Practical Approach to the Shopping Path Clustering. In: Ali, M., Kwon, Y., Lee, CH., Kim, J., Kim, Y. (eds) Current Approaches in Applied Artificial Intelligence. IEA/AIE 2015. Lecture Notes in Computer Science(), vol 9101. Springer, Cham. https://doi.org/10.1007/978-3-319-19066-2_65

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19066-2_65

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19065-5

  • Online ISBN: 978-3-319-19066-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics