Mining the Local Dependency Itemset in a Products Network

Many studies have been conducted on market basket analysis such as association rules and dependent patterns. These studies mainly focus on mining all significant patterns or patterns directly associated with a given item in a dataset. The problem that has not been addressed is how to mine patterns associated with a given item from the local view. This problem becomes very meaningful when the market basket dataset is huge. To address this problem, in this study, first, a new idea called “local dependency itemset” is put forward, which refers to patterns associated with the given item. Second, a framework of mining the local dependency itemset is presented. The framework has two steps, which are executed iteratively. One is expanding the local dependency itemset that initially consists of only the given item; the other is updating the local products network. Third, this framework is implemented by three different dependence indicators and a typical local community detection algorithm. The experimental results confirm that the local dependency itemset is meaningful.

[1]  Hui Xiong,et al.  TAPER: a two-step approach for all-strong-pairs correlation query in large databases , 2006, IEEE Transactions on Knowledge and Data Engineering.

[2]  Sirish L. Shah,et al.  Discovering Association Rules of Mode-Dependent Alarms From Alarm and Event Logs , 2018, IEEE Transactions on Control Systems Technology.

[3]  Unil Yun,et al.  Mining high utility itemsets based on the time decaying model , 2016, Intell. Data Anal..

[4]  Francesco Bonchi,et al.  Pushing Constraints to Detect Local Patterns , 2004, Local Pattern Detection.

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

[6]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Kaushik Dutta,et al.  Apriori Rule--Based In-App Ad Selection Online Algorithm for Improving Supply-Side Platform Revenues , 2017, ACM Trans. Manag. Inf. Syst..

[8]  DuivesteijnWouter,et al.  Exceptional Model Mining , 2016 .

[9]  A. Clauset.  Finding local community structure in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Heungmo Ryang,et al.  Indexed list-based high utility pattern mining with utility upper-bound reduction and pattern combination techniques , 2017, Knowledge and Information Systems.

[11]  Z WangJames,et al.  Exploring local community structures in large networks , 2008 .

[12]  Luc De Raedt,et al.  Itemset mining: A constraint programming perspective , 2011, Artif. Intell..

[13]  Ramakrishnan Srikant,et al.  Mining Association Rules with Item Constraints , 1997, KDD.

[14]  Daniel T. Larose,et al.  Discovering Knowledge in Data: An Introduction to Data Mining , 2005 .

[15]  James P. Bagrow.  Evaluating local community methods in networks , 2007, 0706.3880.

[16]  Mengchi Liu,et al.  Mining high utility itemsets without candidate generation , 2012, CIKM.

[17]  Heungmo Ryang,et al.  High utility pattern mining over data streams with sliding window technique , 2016, Expert Syst. Appl..

[18]  Hamido Fujita,et al.  An efficient algorithm for mining high utility patterns from incremental databases with one database scan , 2017, Knowl. Based Syst..

[19]  HanJiawei,et al.  Exploratory mining and pruning optimizations of constrained associations rules , 1998 .

[20]  Kun Guo,et al.  Data mining for the online retail industry: A case study of RFM model-based customer segmentation using data mining , 2012 .

[21]  Carson Kai-Sang Leung.  Frequent Itemset Mining with Constraints , 2009, Encyclopedia of Database Systems.

[22]  Xindong Wu,et al.  Efficient mining of both positive and negative association rules , 2004, TOIS.

[23]  C. Mauri.  Card Loyalty. A New Emerging Issue in Grocery Retailing , 2001 .

[24]  Rajeev Motwani,et al.  Beyond Market Baskets: Generalizing Association Rules to Dependence Rules , 1998, Data Mining and Knowledge Discovery.

[25]  Philippe Fournier-Viger,et al.  A survey of itemset mining , 2017, WIREs Data Mining Knowl. Discov..

[26]  Vincent S. Tseng,et al.  Mining Top-K Association Rules , 2012, Canadian Conference on AI.

[27]  Michael Hahsler,et al.  Visualizing association rules in hierarchical groups , 2016, Journal of Business Economics.

[28]  Jiawei Han,et al.  CoMine: efficient mining of correlated patterns , 2003, Third IEEE International Conference on Data Mining.

[29]  Francisco Herrera,et al.  A New Multiobjective Evolutionary Algorithm for Mining a Reduced Set of Interesting Positive and Negative Quantitative Association Rules , 2014, IEEE Transactions on Evolutionary Computation.

[30]  Wouter Duivesteijn,et al.  Exceptional Model Mining , 2008, Data Mining and Knowledge Discovery.

[31]  Vincent S. Tseng,et al.  FHM: Faster High-Utility Itemset Mining Using Estimated Utility Co-occurrence Pruning , 2014, ISMIS.

[32]  Howard J. Hamilton,et al.  Interestingness measures for data mining: A survey , 2006, CSUR.

[33]  Feng Luo,et al.  Exploring Local Community Structures in Large Networks , 2006, 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI 2006 Main Conference Proceedings)(WI'06).

[34]  Zhifeng Hao,et al.  Local Community Detection Using Link Similarity , 2012, Journal of Computer Science and Technology.

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

[36]  Mohammad Teshnehlab,et al.  negFIN: An efficient algorithm for fast mining frequent itemsets , 2018, Expert Syst. Appl..

[37]  Jerry Chun-Wei Lin,et al.  A Survey of High Utility Itemset Mining , 2019, Studies in Big Data.

[38]  Pang-Ning Tan,et al.  Interestingness Measures for Association Patterns : A Perspective , 2000, KDD 2000.

[39]  Qiang Ding,et al.  PARM—An Efficient Algorithm to Mine Association Rules From Spatial Data , 2008, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[40]  Yanchi Liu,et al.  Utilizing advances in correlation analysis for community structure detection , 2017, Expert Syst. Appl..

[41]  Wenjian Luo,et al.  Mining Dependent Items , 2018, 2018 1st International Conference on Data Intelligence and Security (ICDIS).

[42]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[43]  Joseph L. Hellerstein,et al.  Mining mutually dependent patterns , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[44]  Nitesh V. Chawla,et al.  Market basket analysis with networks , 2011, Social Network Analysis and Mining.

[45]  Johannes Fürnkranz,et al.  From Local to Global Patterns: Evaluation Issues in Rule Learning Algorithms , 2004, Local Pattern Detection.

[46]  Unil Yun,et al.  Efficient High Utility Pattern Mining for Establishing Manufacturing Plans With Sliding Window Control , 2017, IEEE Transactions on Industrial Electronics.

[47]  Tamir Tassa,et al.  Secure Mining of Association Rules in Horizontally Distributed Databases , 2011, IEEE Transactions on Knowledge and Data Engineering.

[48]  Philip S. Yu,et al.  Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases , 2013, IEEE Transactions on Knowledge and Data Engineering.

[49]  Lian Duan,et al.  Paradoxical Correlation Pattern Mining , 2018, IEEE Transactions on Knowledge and Data Engineering.

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

[51]  Ming-Syan Chen,et al.  On the mining of substitution rules for statistically dependent items , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[52]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[53]  Unil Yun,et al.  Efficient mining of high utility pattern with considering of rarity and length , 2015, Applied Intelligence.

[54]  Yanchi Liu,et al.  Community detection in graphs through correlation , 2014, KDD.

[55]  Rajeev Motwani,et al.  Beyond market baskets: generalizing association rules to correlations , 1997, SIGMOD '97.

[56]  Hamido Fujita,et al.  Damped window based high average utility pattern mining over data streams , 2017, Knowl. Based Syst..

[57]  Laks V. S. Lakshmanan,et al.  Efficient dynamic mining of constrained frequent sets , 2003, TODS.

[58]  Laks V. S. Lakshmanan,et al.  Mining frequent itemsets with convertible constraints , 2001, Proceedings 17th International Conference on Data Engineering.

[59]  Ying Liu,et al.  A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets , 2005, PAKDD.

[60]  Xianchao Zhang,et al.  Extracting Local Community Structure from Local Cores , 2011, DASFAA Workshops.

[61]  Jilles Vreeken,et al.  Interesting Patterns , 2014, Frequent Pattern Mining.

[62]  David J. Hand,et al.  Pattern Detection and Discovery , 2002, Pattern Detection and Discovery.

[63]  Heikki Mannila,et al.  Local and Global Methods in Data Mining: Basic Techniques and Open Problems , 2002, ICALP.

[64]  A. Knobbe,et al.  Supervised descriptive local pattern mining with complex target concepts , 2016 .