{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:54:24Z","timestamp":1740099264588,"version":"3.37.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030045029"},{"type":"electronic","value":"9783030045036"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04503-6_21","type":"book-chapter","created":{"date-parts":[[2018,12,11]],"date-time":"2018-12-11T00:38:10Z","timestamp":1544488690000},"page":"195-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Discovering Strong Meta Association Rules Using Bees Swarm Optimization"],"prefix":"10.1007","author":[{"given":"Youcef","family":"Djenouri","sequence":"first","affiliation":[]},{"given":"Asma","family":"Belhadi","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Fournier-Viger","sequence":"additional","affiliation":[]},{"given":"Jerry Chun-Wei","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,21]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A: Mining association rules between sets of items in large databases. In: ACM SIGMOD Record, vol. 22, pp. 207\u2013216. ACM (1993)","DOI":"10.1145\/170035.170072"},{"issue":"3","key":"21_CR2","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10618-006-0062-6","volume":"14","author":"A Berrado","year":"2007","unstructured":"Berrado, A., Runger, G.C.: Using metarules to organize and group discovered association rules. Data Min. Knowl. Discov. 14(3), 409\u2013431 (2007)","journal-title":"Data Min. Knowl. Discov."},{"key":"21_CR3","first-page":"191","volume":"5","author":"M Dimitrijevi\u0107","year":"2010","unstructured":"Dimitrijevi\u0107, M., Bo\u0161njak, Z.: Discovering interesting association rules in the web log usage data. Interdiscip. J. Inf. Knowl. Manag. 5, 191\u2013207 (2010)","journal-title":"Interdiscip. J. Inf. Knowl. Manag."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"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\u2013115. IEEE (2013)","DOI":"10.1109\/ISPS.2013.6581502"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.eswa.2017.10.042","volume":"94","author":"Y Djenouri","year":"2018","unstructured":"Djenouri, Y., Belhadi, A., Belkebir, R.: Bees swarm optimization guided by data mining techniques for document information retrieval. Expert. Syst. Appl. 94, 126\u2013136 (2018)","journal-title":"Expert. Syst. Appl."},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.knosys.2017.10.016","volume":"139","author":"Y Djenouri","year":"2018","unstructured":"Djenouri, Y., Belhadi, A., Fournier-Viger, P.: Extracting useful knowledge from event logs: a frequent itemset mining approach. Knowl.-Based Syst. 139, 132\u2013148 (2018)","journal-title":"Knowl.-Based Syst."},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.ins.2018.04.008","volume":"453","author":"Y Djenouri","year":"2018","unstructured":"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\u2013167 (2018)","journal-title":"Inf. Sci."},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1007\/978-3-319-57529-2_50","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Y Djenouri","year":"2017","unstructured":"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\u2013654. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-57529-2_50"},{"issue":"2","key":"21_CR9","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1504\/IJBIDM.2014.065075","volume":"9","author":"Y Djenouri","year":"2014","unstructured":"Djenouri, Y., Drias, H., Bendjoudi, A.: Pruning irrelevant association rules using knowledge mining. Int. J. Bus. Intell. Data Min. 9(2), 112\u2013144 (2014)","journal-title":"Int. J. Bus. Intell. Data Min."},{"issue":"4","key":"21_CR10","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1504\/IJBIC.2014.064990","volume":"6","author":"Y Djenouri","year":"2014","unstructured":"Djenouri, Y., Drias, H., Habbas, Z.: Bees swarm optimisation using multiple strategies for association rule mining. Int. J. Bio-Inspired Comput. 6(4), 239\u2013249 (2014)","journal-title":"Int. J. Bio-Inspired Comput."},{"issue":"1","key":"21_CR11","doi-asserted-by":"publisher","first-page":"46","DOI":"10.4018\/ijamc.2014010103","volume":"5","author":"Y Djenouri","year":"2014","unstructured":"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\u201364 (2014)","journal-title":"Int. J. Appl. Metaheuristic Comput. (IJAMC)"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"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\u2013410. IEEE (2014)","DOI":"10.1109\/SOCPAR.2014.7008041"},{"issue":"4","key":"21_CR13","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/MIS.2017.3121546","volume":"32","author":"Y Djenouri","year":"2017","unstructured":"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\u201358 (2017)","journal-title":"IEEE Intell. Syst."},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-319-67274-8_7","volume-title":"Trends and Applications in Knowledge Discovery and Data Mining","author":"Y Djenouri","year":"2017","unstructured":"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\u201378. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-67274-8_7"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Djenouri, Y., Habbas,, Z., Djenouri, D., Fournier-Viger, P.: Bee swarm optimization for solving the MAXSAT problem using prior knowledge. Soft Comput. pp. 1\u201318 (2017)","DOI":"10.1007\/s00500-017-2956-1"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-34654-5_8","volume-title":"Advances in Artificial Intelligence \u2013 IBERAMIA 2012","author":"LAF Fernandes","year":"2012","unstructured":"Fernandes, L.A.F., Garc\u00eda, A.C.B.: Association rule visualization and pruning through response-style data organization and clustering. In: Pav\u00f3n, J., Duque-M\u00e9ndez, N.D., Fuentes-Fern\u00e1ndez, R. (eds.) IBERAMIA 2012. LNCS (LNAI), vol. 7637, pp. 71\u201380. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-34654-5_8"},{"issue":"2","key":"21_CR17","doi-asserted-by":"publisher","first-page":"165","DOI":"10.20532\/cit.2016.1002745","volume":"24","author":"Y Gheraibia","year":"2016","unstructured":"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\u2013179 (2016)","journal-title":"J. Comput. Inf. Technol."},{"issue":"2","key":"21_CR18","doi-asserted-by":"publisher","first-page":"85","DOI":"10.4018\/IJSSCI.2015040105","volume":"7","author":"Y Gheraibia","year":"2015","unstructured":"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\u201399 (2015)","journal-title":"Int. J. Softw. Sci. Comput. Intell. (IJSSCI)"},{"issue":"3","key":"21_CR19","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s10115-009-0229-8","volume":"23","author":"W H\u00e4m\u00e4l\u00e4inen","year":"2010","unstructured":"H\u00e4m\u00e4l\u00e4inen, W.: StatAapriori: an efficient algorithm for searching statistically significant association rules. Knowl. Inf. Syst. 23(3), 373\u2013399 (2010)","journal-title":"Knowl. Inf. Syst."},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: ACM SIGMOD Record, vol. 29, pp. 1\u201312. ACM (2000)","DOI":"10.1145\/342009.335372"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"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\u2013407. ACM (1994)","DOI":"10.1145\/191246.191314"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"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\u2013134. ACM (1999)","DOI":"10.1145\/312129.312216"},{"key":"21_CR23","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/3-540-48912-6_52","volume-title":"Methodologies for Knowledge Discovery and Data Mining","author":"B Liu","year":"1999","unstructured":"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\u2013389. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-48912-6_52"},{"issue":"3","key":"21_CR24","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.ins.2010.09.027","volume":"181","author":"G Mansingh","year":"2011","unstructured":"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\u2013434 (2011)","journal-title":"Inf. Sci."},{"issue":"6","key":"21_CR25","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1109\/TKDE.2010.29","volume":"22","author":"C Marinica","year":"2010","unstructured":"Marinica, C., Guillet, F.: Knowledge-based interactive postmining of association rules using ontologies. IEEE Trans. Knowl. Data Eng. 22(6), 784\u2013797 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"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\u201324. ACM (1998)","DOI":"10.1145\/276304.276307"},{"key":"21_CR27","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/3-540-45422-5_24","volume-title":"KI 2001: Advances in Artificial Intelligence","author":"G Stumme","year":"2001","unstructured":"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\u2013350. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-45422-5_24"},{"key":"21_CR28","doi-asserted-by":"crossref","unstructured":"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\u201373. IEEE (2010)","DOI":"10.1109\/ISAC.2010.5670457"},{"key":"21_CR29","doi-asserted-by":"crossref","unstructured":"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\u201343. ACM (2000)","DOI":"10.1145\/347090.347101"}],"container-title":["Lecture Notes in Computer Science","Trends and Applications in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04503-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,12,11]],"date-time":"2018-12-11T00:48:54Z","timestamp":1544489334000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-04503-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030045029","9783030045036"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04503-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/mamsap.it.deakin.edu.au\/pakdd18\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}