ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Decision Support Systems
Volume 40, Issue 2, August 2005, Pages 339-354
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (837 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.dss.2004.04.009    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2004 Elsevier B.V. All rights reserved.

Market basket analysis in a multiple store environment

Yen-Liang Chena, Kwei TangCorresponding Author Contact Information, b, Corresponding Author Contact Information, E-mail The Corresponding Author, Ren-Jie Shena and Ya-Han Hua

a Department of Information Management, National Central University, Chung-Li, 320, Taiwan, ROC b Krannert Graduate School of Management, Purdue University, West Lafayette, IN 47907, USA

Received 1 December 2003; 
Revised 5 April 2004; 
accepted 5 April 2004. 
Available online 2 June 2004.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Market basket analysis (also known as association-rule mining) is a useful method of discovering customer purchasing patterns by extracting associations or co-occurrences from stores' transactional databases. Because the information obtained from the analysis can be used in forming marketing, sales, service, and operation strategies, it has drawn increased research interest. The existing methods, however, may fail to discover important purchasing patterns in a multi-store environment, because of an implicit assumption that products under consideration are on shelf all the time across all stores. In this paper, we propose a new method to overcome this weakness. Our empirical evaluation shows that the proposed method is computationally efficient, and that it has advantage over the traditional method when stores are diverse in size, product mix changes rapidly over time, and larger numbers of stores and periods are considered.

Author Keywords: Association rules; Data mining; Store chain; Algorithm

Article Outline

1. Introduction
2. Problem definition
3. Algorithm
3.1. The PT table
3.2. The TS table
3.3. Relative-frequent itemset
3.4. Candidate itemsets
3.5. The store-chain association rules
3.6. Complexity analysis
4. Performance evaluation
4.1. Data generation
4.2. Performance measures
4.3. Simulation results
5. Conclusion
Acknowledgements
Appendix A
References
Vitae












Decision Support Systems
Volume 40, Issue 2, August 2005, Pages 339-354
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.