Abstract
Interesting patterns are very much needed in mining of significant association rules which play a big role in knowledge discovery. Frequency based pattern mining techniques such as support often lead to the generation of huge number of patterns including the uninteresting ones with high dissociation. Though dissociation is used to distinguish between two patterns having equal support, but if both of support and dissociation are same then it becomes very difficult to distinguish them. To overcome these types of problem we have introduced a new method of pattern mining based on the concept of item influence. How many other distinct items have been appeared with an item throughout the dataset is referred to its item influence (ii). The proposed method includes three consecutive steps such as- (1) measurement of item influence for all of the items present in the database, (2) calculation of transaction influence (ti) for all of the transactions present in the database using item influence and (3) measurement of influential weights (iw) for all of the generated itemsets. Pruning is done based on the minimum threshold value corresponding to influential weights. Experimental analysis shows the effectiveness of the method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Agarwal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large datasets. In: Proceedings ACM SIGMOD 1993, pp 207–216
Chee CH, Jaafar J, Aziz IA, Hasan MH, Yeoh W (2018) Algorithms for frequent itemset mining: a literature review. In: Artificial Intelligence Review, pp 1–19
Pal S, Bagchi A (2005) Association against dissociation: some pragmatic consideration for frequent Itemset generation under fixed and variable thresholds. ACM SIGKDD Explor 7(2):151–159
Datta S, Bose S (2015) Mining and ranking association rules in support, confidence, correlation and dissociation framework. In: Proceedings of FICTA, AISC, vol 404, Durgapur, India, pp 141–152
Datta S, Bose S (2015) Discovering association rules partially devoid of dissociation by weighted confidence. In: Proceedings of IEEE ReTIS, Kolkata, India, pp 138–143
Datta S, Mali K (2017) Trust: a new objective measure for symmetric association rule mining in account of dissociation and null transaction. In: Proceedings of IEEE ICoAC, Chennai, India, pp 151–156
Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proceeddings ACM SIGMOD, Dallas, USA, pp 1–12
Wu JM-T, Zhan J, Chobe S (2018) Mining association rules for low-frequency itemsets. PLoS ONE 13(7):e0198066
Vo B, Coenen F, Le B (2013) A new method for mining frequent weighted itemsets based on WIT-trees. Expert Syst Appl 40:1256–1264
Datta S, Bose S (2015) Frequent pattern generation in association rule mining using weighted support. In: proceedings of IEEE C3IT, Hooghly, India, pp 1–5
Datta S, Chakraborty S, Mali K, Banerjee S, Roy K, Chatterjee S, Chakraborty M, Bhattacharjee S (2017) Optimal usages of pessimistic association rules in cost effective decision making. In: Proceedings of IEEE Optronix, Kolkata, India, pp 1–5
Li YC, Yeh JS, Chang CC (2008) Isolated items discarding strategy for discovering high utility itemsets. Data Knowl Eng 64:198–217
Bui H, Vo B, Nguyen H, Nguyen-Hoang TA, Hong TP (2018) A weighted N-list- based method for mining frequent weighted itemsets. Expert Syst Appl 96:388–405
Lee G, Yun U, Ryu KH (2017) Mining frequent weighted itemsets without storing transaction IDs and generating candidates. Int J Uncertain, Fuzziness Knowl-Based Syst 25(1):111–144
Annapoorna V, Rama Krishna Murty M, Hari Priyanka JSVS, Chittineni S (2018) Comparative analysis of frequent pattern mining for large data using FP-tree and CP-tree methods. In: Proceedings of the 6th FICTA, AISC, vol 701, pp 59–67, Bhubaneswar, India
Preti G, Lissandrini M, Mottin D, Velegrakis Y (2018) Beyond frequencies: graph pattern mining in multi-weighted graphs. In: Proceedings of the 21st EDBT, pp 169–180
Tang L, Zhang L, Luo P, Wang M (2012) Incorporating occupancy into frequent pattern mining for high quality pattern recommendation. In: Proceedings of the 21st ACM CIKM 2012, Hawaii, USA, pp 75–84
Gan W, Lin JC-W, Fournier-Viger P, Chao H-C, Tseng VS, Yu PS (2018) A survey of utility-oriented pattern mining. arXiv preprint arXiv:1805.10511
Schaus P, Aoga JOR, Guns T (2017) CoverSize: a global constraint for frequency-based itemset mining. In: Proceedings of the international conference on principles and practice of constraint programming, LNCS, vol 10416, pp 529–546
Cheung Y-L, Fu AW-C (2004) Mining frequent itemsets without support threshold: with or without item constraints. In: IEEE TKDE, vol 16, no 9
Acknowledgement
This research was partially supported by the DST PURSE II program, Kalyani University, West Bengal, India.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Datta, S., Mali, K., Ghosh, S., Singh, R., Das, S. (2020). Interesting Pattern Mining Using Item Influence. In: Satapathy, S.C., Raju, K.S., Shyamala, K., Krishna, D.R., Favorskaya, M.N. (eds) Advances in Decision Sciences, Image Processing, Security and Computer Vision. ICETE 2019. Learning and Analytics in Intelligent Systems, vol 3. Springer, Cham. https://doi.org/10.1007/978-3-030-24322-7_53
Download citation
DOI: https://doi.org/10.1007/978-3-030-24322-7_53
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-24321-0
Online ISBN: 978-3-030-24322-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)