Mahendra N PATEL, S.M. SHAH, Suresh B. PATEL

An Adjacency matrix-based Multiple Fuzzy Frequent Itemsets mining (AMFFI) technique

Recently, discovering helpful information from a database consisting of transactions has been a critical research topic. Several frequent itemsets mining for association rule mining, algorithms that can only handle binary databases have proposed. Transactions using numerical values, on the other hand, are ubiquitous in real-world applications. Thus, with reference to the quantitative transactional database, several algorithms were developed and “fuzzy frequent itemsets” (FFI) were discovered. Most of them just consider the term having maximum cardinality. As a result, the number of fuzzy regions processed is equal to the number of original elements. Multiple fuzzy zones of an item, on the other hand, give a better result for making a correct decision. This study presents an AMFFI-miner (Adjacency matrix-based Multiple Fuzzy Frequent Itemsets) for discovering multiple FFIs out of a quantitative transactional database. An adjacency matrix and fuzzy-list structure were designed to find multiple FFIs by scanning database only once and generates less number of candidate itemsets. Join two nodes if its co-occurrence between two fuzzy linguistics terms satisfies minimum support threshold by finding the co-occurrence between two fuzzy linguistics terms directly from the adjacency matrix, thus reducing the number of nodes joining and speeding up discovering multiple FFI. Experiments carried out to compare the suggested method's performance to that of existing methodologies based on running time, memory utilization, and the number of nodes joining.

PDF

___

[1] R. Agrawal, S. Member, T. Imielinski, and A. Swami, “Database Mining: A Performance Perspective” IEEE Transactions on Knowledge and Data Engineering, vol. 5, no. 6, pp. 914–925, 1993.
[2] R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules” The International Conference on Very Large Data Bases, pp. 487-499, 1994.
[3] R. Agrawal and R. Srikant, “Mining Sequential Patterns” The International Conference on Data Engineering, pp. 3-14, 1995.
[4] M. Antonelli, P. Ducange, F. Marcelloni, and A. Segatori, “A novel associative classification model based on a fuzzy frequent pattern mining algorithm” Expert Syst. Appl., vol. 42, no. 4, pp. 2086–2097, 2015.
[5] K. Hu, Y. Lu, L. Zhou, and C. Shi, “LNAI 1711 - Integrating Classification and Association Rule Mining: A Concept Lattice Framework” The 7th International Workshop on New Directions in Rough Sets Data Mining, and Granular-Soft Computing, pp. 443–447, 1999.
[6] P. Berkhin, “A Survey of Clutering Data Mining Techniques” Grouping Multidimensional Data, pp. 25-71, 2006.
[7] J. Han and R. Mao, “Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach” Data Mining and Knowledge Discovery, vol. 8. no. 1, pp. 53–87, 2004.
[8] J. Friedman and L. A. Z. Fuzzy, “Similarity relations and fuzzy orderings” fuzzy sets Information and Control, vol. 8, pp. 338–353, 1965.
[9] T.-P. Hong, C.-S. Kuo, and S.-C. Chi, “Mining association rules from quantitative data” Intelligent Data Analysis, vol. 3, no. 5, pp. 363–376, 1999.
[10] Hong, Tzung-Pei, “An Effective Gradual Data-Reduction Strategy for Fuzzy Itemset Mining,” Int. J. Fuzzy Syst., vol. 15, no. 2, pp. 170-181, 2013.
[11] T.-P. Hong, C.-W. Lin, and A. T.-C. Lin, “The MFFP-tree fuzzy mining algorithm to discover complete linguistic frequent itemsets” Computational Intelligence, vol. 30, no. 1, pp. 145–166, 2014.
[12] J. C. W. Lin, T. P. Hong, and T. C. Lin, “A CMFFP-tree algorithm to mine complete multiple fuzzy frequent itemsets,” Appl. Soft Comput. J., vol. 28, pp. 431–439, 2015.
[13] J. C. W. Lin, T. P. Hong, T. C. Lin, and S. T. Pan, “An UBMFFP tree for mining multiple fuzzy frequent itemsets,” Int. J. Uncertainty, Fuzziness Knowlege-Based Syst., vol. 23, no. 6, pp. 861–879, 2015.
[14] J. C. W. Lin, T. Li, P. Fournier-Viger, and T. P. Hong, “A fast Algorithm for mining fuzzy frequent itemsets,” in Journal of Intelligent and Fuzzy Systems, vol. 29, no. 6, pp. 2373–2379, 2015.
[15] J. C. W. Lin, T. Li, P. Fournier-Viger, T. P. Hong, J. M. T. Wu, and J. Zhan, “Efficient Mining of Multiple Fuzzy Frequent Itemsets,” Int. J. Fuzzy Syst., vol. 19, no. 4, pp. 1032–1040, 2017.
[16] M. Delgado, N. Marín, D. Sánchez, and M. A. Vila, “Fuzzy association rules: General model and applications,” IEEE Trans. Fuzzy Syst., vol. 11, no. 2, pp. 214–225, 2003.
[17] T. P. Hong, C. S. Kuo, and S. L. Wang, “A fuzzy AprioriTid mining algorithm with reduced computational time,” Appl. Soft Comput. J., vol. 5, no. 1, pp. 1–10, 2004.
[18] T. P. Hong, C. W. Lin, and Y. L. Wu, “Incrementally fast updated frequent pattern trees,” Expert Syst. Appl., vol. 34, no. 4, pp. 2424– 2435, 2008.
[19] C. W. Lin, T. P. Hong, and W. H. Lu, “Linguistic data mining with fuzzy FP-trees,” Expert Syst. Appl., vol. 37, no. 6, pp. 4560–4567, 2010.
[20] W. H. L. Lin, Chun Wei, Tzung Pei Hong, “An efficient tree-based fuzzy data mining approach,” Int. J. Fuzzy Syst., vol. 12, no. 2, pp. 150–157, 2010.
[21] C. W. Lin and T. P. Hong, “Mining fuzzy frequent itemsets based on UBFFP trees,” J. Intell. Fuzzy Syst., vol. 27, no. 1, pp. 535–548, 2014.
[22] H. Li, Y. Zhang, M. Hai, and H. Hu, “Finding Fuzzy Close Frequent Itemsets from Databases,” Procedia Comput. Sci., vol. 139, pp. 242– 247, 2018.
[23] Lin, J. C. W., Wu, J. M. T., Djenouri, Y., Srivastava, G., & Hong, "Mining multiple fuzzy frequent patterns with compressed list structures" 2020 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), pp. 1-8, 2020
[24] S. Kar and M. M. J. Kabir, “Comparative analysis of mining fuzzy association rule using genetic algorithm” The International Conference on Electrical, Computer and Communication Engineering, pp. 1–5, 2019.
[25] D. K. Srivastava, B. Roychoudhury, and H. V. Samalia, “Fuzzy association rule mining for economic development indicators” Int. J. Intell. Enterp., vol. 6, no. 1, pp. 3–18, 2019.
[26] L. Wang, Q. Ma, and J. Meng, “Incremental fuzzy association rule mining for classification and regression,” IEEE Access, vol. 7, pp. 121095–121110, 2019.
[27] “Frequent Itemset Mining Dataset Repository” http://fimi.ua.ac.be/ data