Skip to main content

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 285))

Abstract

Market Basket Analysis often involves applying the de facto association rule mining method on massive sales transaction data. In this paper, we argue that association rule mining is not always the most suitable method for analysing big market-basket data. This is because the data matrix to be used for association rule mining is usually large and sparse, resulting in sluggish generation of many trivial rules with little insight. To address this problem, we summarise a real-world sales transaction data set into time series format. We then use time series clustering to discover commonly purchased items that are useful for pricing or formulating cross-selling strategies. We show that this approach uses a data set that is substantially smaller than the data to be used for association analysis. In addition, it reveals significant patterns and insights that are otherwise hard to uncover when using association analysis.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. Proceedings of the International Conference on Very Large Data Bases. pp. 487–499. (1994)

    Google Scholar 

  2. Baralis, E., Cagliero, L., Cerquitelli, T., Garza, P.: Generalized association rule mining with constraints. Information Sciences. Vol. (194). pp. 68-84. (2012)

    Google Scholar 

  3. Basel, A.M., Amer F.A., and Mohammed Z. Z.: A new sampling technique for association rule mining. Journal of Information Science. Vol. 35. pp. 358–376. (2009)

    Google Scholar 

  4. Blattberg, R.C., Kim, B-D., Neslin, S.A.: Database Marketing, Analyzing and Managing Customers. Series: International Series in Quantitative Marketing. Vol. 18. (2008)

    Google Scholar 

  5. Chen, Y.L., Tang, K., Shen, R.J., Hu, Y.H.: Market basket analysis in a multiple store environment, Decision Support Systems. Vol. 40(2). pp. 339–354. (2005)

    Google Scholar 

  6. Creighton, C., Hanash S.: Mining gene expression databases for association rules. Bioinformatics. Vol. 19 (1), pp.79–86. (2003)

    Google Scholar 

  7. Cunningham, S.J., Frank, E.: Market basket analysis of library circulation data. Proceedings of 6th International Conference on Neural Information Processing. pp.825–830. (1999)

    Google Scholar 

  8. Gutierrez, N.: Demystifying Market Basket Analysis. DM Review Special Report. (2006)

    Google Scholar 

  9. Luís C.: A scalable algorithm for the market basket analysis. Journal of Retailing and Consumer Services. Vol. 14(6). pp. 400–407. (2007)

    Google Scholar 

  10. MacQueen, J. B.: Some Methods for classification and Analysis of Multivariate Observations. Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability 1. University of California Press. pp. 281–297. (1967)

    Google Scholar 

  11. Mafruz, Z.A., David, T., Kate, S.: Redundant association rules reduction techniques. International Journal Business Intelligent Data Mining. Vol. 2 (1). pp. 29–63. (2007)

    Google Scholar 

  12. Matteo, A. R., Eli, A.U.: Efficient Discovery of Association Rules and Frequent Itemsets through Sampling with Tight Performance Guarantees. Proceedings of European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD) 2012. pp. 25–41. (2012)

    Google Scholar 

  13. Stéphane, L., Olivier, T., Elie, P.: Association rule interestingness: measure and statistical validation. Quality measures in data mining. Springer. (2006)

    Google Scholar 

  14. Tan, S.C.: Simplifying and improving swarm-based clustering. In Proceedings of IEEE Congress on Evolutionary Computation. pp. 1–8. (2012)

    Google Scholar 

  15. Tan, S.C., Ting, K.M., Teng, S.W.: A general stochastic clustering method for automatic cluster discovery. Pattern Recognition. Vol. 44 (10). pp. 2786–2799. (2011)

    Google Scholar 

  16. Xiaozhe, W., Kate A.S., Rob, H., Damminda, A.:A Scalable Method for Time Series Clustering. Technical Report. Monash University. (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Swee Chuan Tan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media Singapore

About this paper

Cite this paper

Tan, S.C., Lau, J.P.S. (2014). Time Series Clustering: A Superior Alternative for Market Basket Analysis. In: Herawan, T., Deris, M., Abawajy, J. (eds) Proceedings of the First International Conference on Advanced Data and Information Engineering (DaEng-2013). Lecture Notes in Electrical Engineering, vol 285. Springer, Singapore. https://doi.org/10.1007/978-981-4585-18-7_28

Download citation

  • DOI: https://doi.org/10.1007/978-981-4585-18-7_28

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-4585-17-0

  • Online ISBN: 978-981-4585-18-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics