An efficient approach for mining association rules from high utility itemsets

Expert Systems with Applications - Tập 42 - Trang 5754-5778 - 2015
Jayakrushna Sahoo1, Ashok Kumar Das2, A. Goswami1
1Department of Mathematics, Indian Institute of Technology, Kharagpur 721 302, India
2Center for Security, Theory and Algorithmic Research, International Institute of Information Technology, Hyderabad 500 032, India

Tài liệu tham khảo

Agrawal, 1994, Fast algorithms for mining association rules in large databases, Vol. 1215, 487 Ahmed, 2009, Efficient tree structures for high utility pattern mining in incremental databases, IEEE Transactions on Knowledge and Data Engineering, 21, 1708, 10.1109/TKDE.2009.46 Ahmed, 2011, Huc-prune: An efficient candidate pruning technique tomine high utility patterns, Applied Intelligence, 34, 181, 10.1007/s10489-009-0188-5 Alonso, 2012, Cooperation between expert knowledge and data mining discovered knowledge: Lessons learned, Expert Systems with Applications, 39, 7524, 10.1016/j.eswa.2012.01.133 Balcázar, 2013, Formal and computational properties of the confidence boost of association rules, ACM Transactions on Knowledge Discovery from Data, 7, 19:1, 10.1145/2541268.2541272 Barber, 2001, Parametric algorithms for mining share frequent itemsets, Journal of Intelligent Information Systems, 16, 277, 10.1023/A:1011276003319 Barber, 2003, Extracting share frequent itemsets with infrequent subsets, Data Mining and Knowledge Discovery, 7, 153, 10.1023/A:1022419032620 Cai, 1998, Mining association rules with weighted items, 68 Carter, 1997, Share based measures for itemsets, Vol. 1263, 14 Chan, 2003, Mining high utility itemsets, 19 Cheng, 2008, Effective elimination of redundant association rules, Data Mining and Knowledge Discovery, 16, 221, 10.1007/s10618-007-0084-8 Chen, 2007, A profit-based business model for evaluating rule interestingness, Vol. 4509, 296 FIMI, (2003). Fimi: The frequent itemset mining dataset repository. Accessed on February 2012. <<http://fimi.cs.helsinki.fi/data/>. Fournier-Viger, P., Gomariz, A., Soltani, A., & Gueniche, T. (2014). SPMF: Open-source data mining library. Available at <http://www.philippe-fournier-viger.com/spmf/>. Accessed on August 2014. Fournier-Viger, 2012, Mining top-k association rules, Vol. 7310, 61 Fournier-Viger, 2014, Novel concise representations of high utility itemsets using generator patterns, Vol. 8933, 30 Fournier-Viger, 2014, FHM: Faster high-utility itemset mining using estimated utility co-occurrence pruning, Vol. 8502, 83 Geng, 2006, Interestingness measures for data mining: A survey, ACM Computing Surveys, 38, 9, 10.1145/1132960.1132963 Han, 2000, Mining frequent patterns without candidate generation, SIGMOD Record, 29, 1, 10.1145/335191.335372 Hilderman, 1998, Mining association rules from market basket data using share measures and characterized itemsets, International Journal on Artificial Intelligence Tools, 07, 189, 10.1142/S0218213098000111 Huynh-Thi-Le, 2015, An efficient and effective algorithm for mining top-rank-k frequent patterns, Expert Systems with Applications, 42, 156, 10.1016/j.eswa.2014.07.045 Kryszkiewicz, 1998, Representative association rules, Vol. 1394, 198 Lan, 2014, An efficient projection-based indexing approach for mining high utility itemsets, Knowledge and Information Systems, 38, 85, 10.1007/s10115-012-0492-y Lee, 2013, Utility-based association rule mining: A marketing solution for cross-selling, Expert Systems with Applications, 40, 2715, 10.1016/j.eswa.2012.11.021 Lin, 2011, An effective tree structure for mining high utility itemsets, Expert Systems with Applications, 38, 7419, 10.1016/j.eswa.2010.12.082 Liu, 2005, A fast high utility itemsets mining algorithm, 90 Liu, 2012, Mining high utility itemsets without candidate generation, 55 Li, 2008, Isolated items discarding strategy for discovering high utility itemsets, Data & Knowledge Engineering, 64, 198, 10.1016/j.datak.2007.06.009 Luna, 2014, Reducing gaps in quantitative association rules: A genetic programming free-parameter algorithm, Integrated Computer-Aided Engineering, 21, 321, 10.3233/ICA-140467 Luna, 2012, Design and behavior study of a grammar-guided genetic programming algorithm for mining association rules, Knowledge and Information Systems, 32, 53, 10.1007/s10115-011-0419-z Mata, J., Alvarez, J., & Riquelme, J. (2001). Mining numeric association rules via evolutionary algorithm. In Proceedings of the 5th international conference on artificial neural networks and genetic algorithms (ICANNGA’01) (pp. 264–267). Mishra, 2014, A secure user anonymity-preserving biometric-based multi-server authenticated key agreement scheme using smart cards, Expert Systems with Applications, 41, 8129, 10.1016/j.eswa.2014.07.004 Park, 1995, An effective hash-based algorithm for mining association rules, SIGMOD Record, 24, 175, 10.1145/568271.223813 Pasquier, 1999, Efficient mining of association rules using closed itemset lattices, Information Systems, 24, 25, 10.1016/S0306-4379(99)00003-4 Pasquier, 2005, Generating a condensed representation for association rules, Journal of Intelligent Information Systems, 24, 29, 10.1007/s10844-005-0266-z Pears, 2013, Weighted association rule mining via a graph based connectivity model, Information Sciences, 218, 61, 10.1016/j.ins.2012.07.001 Pei, 2001, H-mine: Hyper-structure mining of frequent patterns in large databases, 441 Pisharath, J., Liu, Y., Liao, W.K., Choudhary, A., Memik, G., & Parhi, J. (2005). Nu-minebench version 2.0 dataset and technical report. Available at <http://cucis.ece.northwestern.edu/projects/DMS/MineBench.html>. Accessed on June 2013. Ramkumar, G.D., Ramkumar, S., & Shalom, T. (1998). Weighted association rules: Model and algorithm. In Proceedings of fourth ACM international conference on knowledge discovery and data mining (pp. 661–666). Sadik, 2008, Premises reduction of rule based expert systems using association rules technique, International Journal of Soft Computing, 3, 195 Sahoo, 2014, An effective association rule mining scheme using a new generic basis, Knowledge and Information Systems, 1 Salleb-Aouissi, 2007, Quantminer: A genetic algorithm for mining quantitative association rules, 1035 Shie, 2010, Online mining of temporal maximal utility itemsets from data streams, 1622 Shie, 2012, Efficient algorithms for mining maximal high utility itemsets from data streams with different models, Expert Systems with Applications, 39, 12947, 10.1016/j.eswa.2012.05.035 Shie, 2013, Mining interesting user behavior patterns in mobile commerce environments, Applied Intelligence, 38, 418, 10.1007/s10489-012-0379-3 Song, 2014, Mining high utility itemsets by dynamically pruning the tree structure, Applied Intelligence, 40, 29, 10.1007/s10489-013-0443-7 Szathmary, L., Napoli, A., & Kuznetsov, S. (2007). Zart: A multifunctional itemset mining algorithm. In Proceedings of the fifth international conference on concept lattices and their applications (CLA’07) (pp. 26–37). Szathmary, L., Valtchev, P., Napoli, A., & Godin, R., et al. (2008). An efficient hybrid algorithm for mining frequent closures and generators. In: 6th International conference on concept lattices and their applications (CLA’08) (pp. 47–58). Szathmary, 2009, Efficient vertical mining of frequent closures and generators, 393 Tao, 2003, Weighted association rule mining using weighted support and significance framework, 661 Tseng, 2013, Efficient algorithms for mining high utility itemsets from transactional databases, IEEE Transactions on Knowledge and Data Engineering, 25, 1772, 10.1109/TKDE.2012.59 Tseng, 2010, Up-growth: An efficient algorithm for high utility itemset mining, 253 Wang, 2000, Efficient mining of weighted association rules (war), 270 Wang, 2002, Profit mining: From patterns to actions, Vol. 2287, 70 Webb, 2006, Discovering significant rules, 434 Wu, 2011, Efficient mining of a concise and lossless representation of high utility itemsets, 824 Wu, 2014, Efficient algorithms for mining the concise and lossless representation of closed+ high utility itemsets, IEEE Transactions on Knowledge and Data Engineering, 99, 1 Xu, 2011, Reliable representations for association rules, Data & Knowledge Engineering, 70, 555, 10.1016/j.datak.2011.02.003 Yahia, 2009, A new generic basis of “factual” and “implicative” association rules, Intelligent Data Analysis, 13, 633, 10.3233/IDA-2009-0384 Yan, 2006, Incorporating pageview weight into an association-rule-based web recommendation system, 577 Yan, 2005, Armga: Identifying interesting association rules with genetic algorithms, Applied Artificial Intelligence, 19, 677, 10.1080/08839510590967316 Yao, H., Hamilton, H.J., & Butz, C.J. (2004). A foundational approach to mining itemset utilities from databases. In Proceedings of the fourth SIAM international conference on data mining (Vol. 4, pp. 215–221). Yao, 2006, A unified framework for utility-based measures for mining itemsets, 28 Yun, 2007, Efficient mining of weighted interesting patterns with a strong weight and/or support affinity, Information Sciences, 177, 3477, 10.1016/j.ins.2007.03.018 Yun, 2014, High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates, Expert Systems with Applications, 41, 3861, 10.1016/j.eswa.2013.11.038 Zaki, 2004, Mining non-redundant association rules, Data Mining and Knowledge Discovery, 9, 223, 10.1023/B:DAMI.0000040429.96086.c7 Zhang, 2004, On the discovery of significant statistical quantitative rules, 374