Abstract
For several applications, association rule mining produces an extremely large number of rules. Analyzing a large number of rules can be very time-consuming for users. Therefore, eliminating irrelevant association rules is necessary. This paper addresses this problem by proposing an efficient approach based on the concept of meta association rules. The algorithm first discovers dependencies between association rules called meta association rules. Then, these dependencies are used to eliminate association rules that can be replaced by a more general rule. Because the set of meta-rules can be very large, a bee swarm optimization approach is applied to quickly extract the strongest meta-rules. The approach has been applied on a synthetic dataset and compared with a state-of-the-art algorithm. Results are promising in terms of number of rules found and their quality.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Agrawal, R., Imieliński, T., Swami, A: Mining association rules between sets of items in large databases. In: ACM SIGMOD Record, vol. 22, pp. 207–216. ACM (1993)
Berrado, A., Runger, G.C.: Using metarules to organize and group discovered association rules. Data Min. Knowl. Discov. 14(3), 409–431 (2007)
Dimitrijević, M., Bošnjak, Z.: Discovering interesting association rules in the web log usage data. Interdiscip. J. Inf. Knowl. Manag. 5, 191–207 (2010)
Djenouri, Y., Drias, H., Habbas, Z., Chemchem, A.: Organizing association rules with meta-rules using knowledge clustering. In: 2013 11th International Symposium on Programming and Systems (ISPS), pp. 109–115. IEEE (2013)
Djenouri, Y., Belhadi, A., Belkebir, R.: Bees swarm optimization guided by data mining techniques for document information retrieval. Expert. Syst. Appl. 94, 126–136 (2018)
Djenouri, Y., Belhadi, A., Fournier-Viger, P.: Extracting useful knowledge from event logs: a frequent itemset mining approach. Knowl.-Based Syst. 139, 132–148 (2018)
Djenouri, Y., Belhadi, A., Fournier-Viger, P., Lin, J.C.W.: Fast and effective cluster-based information retrieval using frequent closed itemsets. Inf. Sci. 453, 154–167 (2018)
Djenouri, Y., Comuzzi, M., Djenouri, D.: SS-FIM: single scan for frequent itemsets mining in transactional databases. In: Kim, J., Shim, K., Cao, L., Lee, J.-G., Lin, X., Moon, Y.-S. (eds.) PAKDD 2017. LNCS (LNAI), vol. 10235, pp. 644–654. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-57529-2_50
Djenouri, Y., Drias, H., Bendjoudi, A.: Pruning irrelevant association rules using knowledge mining. Int. J. Bus. Intell. Data Min. 9(2), 112–144 (2014)
Djenouri, Y., Drias, H., Habbas, Z.: Bees swarm optimisation using multiple strategies for association rule mining. Int. J. Bio-Inspired Comput. 6(4), 239–249 (2014)
Djenouri, Y., Drias, H., Habbas, Z.: Hybrid intelligent method for association rules mining using multiple strategies. Int. J. Appl. Metaheuristic Comput. (IJAMC) 5(1), 46–64 (2014)
Djenouri, Y., Gheraibia, Y., Mehdi, M., Bendjoudi, A., Nouali-Taboudjemat, N.: An efficient measure for evaluating association rules. In: 2014 6th International Conference of Soft Computing and Pattern Recognition (SoCPaR), pp. 406–410. IEEE (2014)
Djenouri, Y., Habbas, Z., Djenouri, D.: Data mining-based decomposition for solving the MAXSAT problem: toward a new approach. IEEE Intell. Syst. 32(4), 48–58 (2017)
Djenouri, Y., Habbas, Z., Djenouri, D., Comuzzi, M.: Diversification heuristics in bees swarm optimization for association rules mining. In: Kang, U., Lim, E.-P., Yu, J.X., Moon, Y.-S. (eds.) PAKDD 2017. LNCS (LNAI), vol. 10526, pp. 68–78. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-67274-8_7
Djenouri, Y., Habbas,, Z., Djenouri, D., Fournier-Viger, P.: Bee swarm optimization for solving the MAXSAT problem using prior knowledge. Soft Comput. pp. 1–18 (2017)
Fernandes, L.A.F., García, A.C.B.: Association rule visualization and pruning through response-style data organization and clustering. In: Pavón, J., Duque-Méndez, N.D., Fuentes-Fernández, R. (eds.) IBERAMIA 2012. LNCS (LNAI), vol. 7637, pp. 71–80. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-34654-5_8
Gheraibia, Y., Moussaoui, A., Djenouri, Y., Kabir, S., Yin, P.Y.: Penguins search optimisation algorithm for association rules mining. J. Comput. Inf. Technol. 24(2), 165–179 (2016)
Gheraibia, Y., Moussaoui, A., Djenouri, Y., Kabir, S., Yin, P.-Y., Mazouzi, S.: Penguin search optimisation algorithm for finding optimal spaced seeds. Int. J. Softw. Sci. Comput. Intell. (IJSSCI) 7(2), 85–99 (2015)
Hämäläinen, W.: StatAapriori: an efficient algorithm for searching statistically significant association rules. Knowl. Inf. Syst. 23(3), 373–399 (2010)
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: ACM SIGMOD Record, vol. 29, pp. 1–12. ACM (2000)
Klemettinen, M., Mannila, H., Ronkainen, P., Toivonen, H., Verkamo, A.I.: Finding interesting rules from large sets of discovered association rules. In: Proceedings of the Third International Conference on Information and Knowledge Management, pp. 401–407. ACM (1994)
Liu, B., Hsu, W., Ma, Y.: Pruning and summarizing the discovered associations. In: Proceedings of the fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 125–134. ACM (1999)
Liu, B., Hsu, W., Wang, K., Chen, S.: Visually aided exploration of interesting association rules. In: Zhong, N., Zhou, L. (eds.) PAKDD 1999. LNCS (LNAI), vol. 1574, pp. 380–389. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48912-6_52
Mansingh, G., Osei-Bryson, K.-M., Reichgelt, H.: Using ontologies to facilitate post-processing of association rules by domain experts. Inf. Sci. 181(3), 419–434 (2011)
Marinica, C., Guillet, F.: Knowledge-based interactive postmining of association rules using ontologies. IEEE Trans. Knowl. Data Eng. 22(6), 784–797 (2010)
Ng, R.T., Lakshmanan, V.S., Han, J., Pang, A.: Exploratory mining and pruning optimizations of constrained associations rules. In: ACM SIGMOD Record, vol. 27, pp. 13–24. ACM (1998)
Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Intelligent structuring and reducing of association rules with formal concept analysis. In: Baader, F., Brewka, G., Eiter, T. (eds.) KI 2001. LNCS (LNAI), vol. 2174, pp. 335–350. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45422-5_24
Watanabe, T.: An improvement of fuzzy association rules mining algorithm based on redundacy of rules. In: 2010 2nd International Symposium on Aware Computing (ISAC), pp. 68–73. IEEE (2010)
Zaki, M.J.: Generating non-redundant association rules. In: Proceedings of the sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 34–43. ACM (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Djenouri, Y., Belhadi, A., Fournier-Viger, P., Lin, J.CW. (2018). Discovering Strong Meta Association Rules Using Bees Swarm Optimization. In: Ganji, M., Rashidi, L., Fung, B., Wang, C. (eds) Trends and Applications in Knowledge Discovery and Data Mining. PAKDD 2018. Lecture Notes in Computer Science(), vol 11154. Springer, Cham. https://doi.org/10.1007/978-3-030-04503-6_21
Download citation
DOI: https://doi.org/10.1007/978-3-030-04503-6_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-04502-9
Online ISBN: 978-3-030-04503-6
eBook Packages: Computer ScienceComputer Science (R0)