Re-Mining Item Associations: Methodology and a Case Study in Apparel Retailing

Association mining is the conventional data mining technique for analyzing market basket data and it reveals the positive and negative associations between items. While being an integral part of transaction data, pricing and time information have not been integrated into market basket analysis in earlier studies. This paper proposes a new approach to mine price, time and domain related attributes through re-mining of association mining results. The underlying factors behind positive and negative relationships can be characterized and described through this second data mining stage. The applicability of the methodology is demonstrated through the analysis of data coming from a large apparel retail chain, and its algorithmic complexity is analyzed in comparison to the existing techniques.

[1]  William Nick Street,et al.  An intelligent system for customer targeting: a data mining approach , 2004, Decis. Support Syst..

[2]  Takashi Washio,et al.  An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data , 2000, PKDD.

[3]  Padhraic Smyth,et al.  From Data Mining to Knowledge Discovery: An Overview , 1996, Advances in Knowledge Discovery and Data Mining.

[4]  Jiawei Han,et al.  Data Mining: Concepts and Techniques , 2000 .

[5]  Ee-Peng Lim,et al.  On strategies for imbalanced text classification using SVM: A comparative study , 2009, Decis. Support Syst..

[6]  Ayhan Demiriz,et al.  Analyzing Price Data to Determine Positive and Negative Product Associations , 2009, ICONIP.

[7]  Ayhan Demiriz,et al.  Enhancing Product Recommender Systems on Sparse Binary Data , 2004, Data Mining and Knowledge Discovery.

[8]  Robert Meersman,et al.  On the Complexity of Mining Quantitative Association Rules , 1998, Data Mining and Knowledge Discovery.

[9]  Laks V. S. Lakshmanan,et al.  Exploratory mining and pruning optimizations of constrained associations rules , 1998, SIGMOD '98.

[10]  George Karypis,et al.  An efficient algorithm for discovering frequent subgraphs , 2004, IEEE Transactions on Knowledge and Data Engineering.

[11]  Heikki Mannila,et al.  Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.

[12]  Ramakrishnan Srikant,et al.  Mining quantitative association rules in large relational tables , 1996, SIGMOD '96.

[13]  Ayhan Demiriz,et al.  Re-mining Positive and Negative Association Mining Results , 2010, ICDM.

[14]  Sudha Ram,et al.  Proceedings of the 1997 ACM SIGMOD international conference on Management of data , 1997, ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems.

[15]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[16]  Shamkant B. Navathe,et al.  Mining for strong negative associations in a large database of customer transactions , 1998, Proceedings 14th International Conference on Data Engineering.

[17]  Osmar R. Zaïane,et al.  An associative classifier based on positive and negative rules , 2004, DMKD '04.

[18]  Petra Perner,et al.  Advances in Data Mining , 2002, Lecture Notes in Computer Science.

[19]  J. Ross Quinlan,et al.  Induction of Decision Trees , 1986, Machine Learning.

[20]  Huimin Zhao,et al.  A multi-objective genetic programming approach to developing Pareto optimal decision trees , 2007, Decis. Support Syst..

[21]  Harumi A. Kuno,et al.  Using SAS for Mining Indirect Associations in Data , 2001 .

[22]  Geert Wets,et al.  Building an Association Rules Framework to Improve Product Assortment Decisions , 2004, Data Mining and Knowledge Discovery.

[23]  Bo K. Wong,et al.  Neural network applications in business: A review and analysis of the literature (1988-1995) , 1997, Decis. Support Syst..

[24]  J. Friedman.  Stochastic gradient boosting , 2002 .

[25]  Christos Faloutsos,et al.  Quantifiable data mining using ratio rules , 2000, The VLDB Journal.

[26]  Yehuda Lindell,et al.  A Statistical Theory for Quantitative Association Rules , 1999, KDD '99.

[27]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[28]  Luigi Palopoli,et al.  On the complexity of inducing categorical and quantitative association rules , 2001, Theor. Comput. Sci..

[29]  Yiyu Yao,et al.  Explanation-Oriented Association Mining Using a Combination of Unsupervised and Supervised Learning Algorithms , 2003, Canadian Conference on AI.

[30]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[31]  Heikki Mannila,et al.  Verkamo: Fast Discovery of Association Rules , 1996, KDD 1996.

[32]  Das Amrita,et al.  Mining Association Rules between Sets of Items in Large Databases , 2013 .

[33]  Ayhan Demiriz,et al.  A Framework for Visualizing Association Mining Results , 2006, ISCIS.