{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:34:19Z","timestamp":1750221259116,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,5,2]],"date-time":"2018-05-02T00:00:00Z","timestamp":1525219200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,5,2]]},"DOI":"10.1145\/3230905.3230913","type":"proceedings-article","created":{"date-parts":[[2018,7,16]],"date-time":"2018-07-16T13:18:10Z","timestamp":1531747090000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Divide and Conquer"],"prefix":"10.1145","author":[{"given":"Lydia Nahla","family":"Driff","sequence":"first","affiliation":[{"name":"Artificial Intelligence Laboratory (LRIA), Department of Computer Science, USTHB university, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Habiba","family":"Drias","sequence":"additional","affiliation":[{"name":"Artificial Intelligence Laboratory (LRIA), Department of Computer Science, USTHB university, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,5,2]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Data Mining: Concepts and Techniques. Morgann Kaufmann series in Dara Management Systems","author":"Jiewai H.","year":"2011","unstructured":"H. Jiewai , K. Micheline and P. Jian . 2011 . Data Mining: Concepts and Techniques. Morgann Kaufmann series in Dara Management Systems H. Jiewai, K. Micheline and P. Jian. 2011. Data Mining: Concepts and Techniques. Morgann Kaufmann series in Dara Management Systems"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.553164"},{"key":"e_1_3_2_1_3_1","unstructured":"M. Boris. 2012. Prediction and decision making in health care using data mining. Kuwait chapter of arabian journal of business and management review 1.12: 126--136.  M. Boris. 2012. Prediction and decision making in health care using data mining. Kuwait chapter of arabian journal of business and management review 1.12: 126--136."},{"key":"e_1_3_2_1_4_1","unstructured":"R. Agrawal R. Srikant. 1994. Fast algorithms for mining association rules: Proceedings of 20th International Conference on Very Large Data Bases September 12-15 Santiago de Chile Chile   R. Agrawal R. Srikant. 1994. Fast algorithms for mining association rules: Proceedings of 20th International Conference on Very Large Data Bases September 12-15 Santiago de Chile Chile"},{"key":"e_1_3_2_1_5_1","first-page":"65","volume-title":"Editions Herm_es, 21 (1)","author":"Bastide Y.","unstructured":"Y. Bastide , R. Taouil , N. Pasquier , G. Stumme , L. Lakhal . 2002. Pascal: un algorithme d'extraction des motifs fr\u00e9quents. Techniques et Sciences Informatiques , Editions Herm_es, 21 (1) , pp. 65 -- 95 . Y. Bastide, R. Taouil, N. Pasquier, G.Stumme, L. Lakhal. 2002. Pascal: un algorithme d'extraction des motifs fr\u00e9quents. Techniques et Sciences Informatiques, Editions Herm_es, 21 (1), pp. 65--95."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/238355.238440"},{"key":"e_1_3_2_1_7_1","volume-title":"CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets. ACM SIGMOD workshop on research issues in data mining and knowledge discovery.","volume":"4","author":"Jian P.","unstructured":"P. Jian , J. Han , and R. Mao . 2000 . CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets. ACM SIGMOD workshop on research issues in data mining and knowledge discovery. Vol. 4 . No. 2. P. Jian, J. Han, and R. Mao. 2000. CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets. ACM SIGMOD workshop on research issues in data mining and knowledge discovery. Vol. 4. No. 2."},{"key":"e_1_3_2_1_8_1","unstructured":"D. Hanirex D. Kerana and D. Kaliyamurthie. 2015. KP An adaptive transaction reduction approach for mining frequent itemsets A comparative study on dengue virus type1. International Journal of Pharma and Bio Sciences 6.2.  D. Hanirex D. Kerana and D. Kaliyamurthie. 2015. KP An adaptive transaction reduction approach for mining frequent itemsets A comparative study on dengue virus type1. International Journal of Pharma and Bio Sciences 6.2."},{"key":"e_1_3_2_1_9_1","volume-title":"Federated Conference on. IEEE.","author":"Aalst Van Der","year":"2013","unstructured":"Van Der Aalst , Wil MP. 2013 . A general divide and conquer approach for process mining. Computer Science and Information Systems (FedCSIS) , Federated Conference on. IEEE. Van Der Aalst, Wil MP. 2013. A general divide and conquer approach for process mining. Computer Science and Information Systems (FedCSIS), Federated Conference on. IEEE."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223813"},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of the Eleventh International Conference on. IEEE","author":"Rakesh A.","year":"1995","unstructured":"A. Rakesh , and R. Srikant . 1995. Mining sequential patterns. Data Engineering , Proceedings of the Eleventh International Conference on. IEEE , 1995 . A. Rakesh, and R. Srikant. 1995. Mining sequential patterns. Data Engineering, Proceedings of the Eleventh International Conference on. IEEE, 1995."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"W. Yung-Hung etal 2014. On the computational complexity of the empirical mode decomposition algorithm. Physica A: Statistical Mechanics and its Applications 400: 159--167.  W. Yung-Hung et al. 2014. On the computational complexity of the empirical mode decomposition algorithm. Physica A: Statistical Mechanics and its Applications 400: 159--167.","DOI":"10.1016\/j.physa.2014.01.020"},{"key":"e_1_3_2_1_13_1","unstructured":"A. Rakesh etal 1996. Fast discovery of association rules. Advances in knowledge discovery and data mining 12.1: 307--328.   A. Rakesh et al. 1996. Fast discovery of association rules. Advances in knowledge discovery and data mining 12.1: 307--328."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"M. Al-Maolegi and B. Arkok. 2014. An improved apriori algorithm for association rules. arXiv preprint arXiv:1403.3948.  M. Al-Maolegi and B. Arkok. 2014. An improved apriori algorithm for association rules. arXiv preprint arXiv:1403.3948.","DOI":"10.5121\/ijnlc.2014.3103"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.4018\/IJSODIT.2016010104"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"K. Aggarwal C. Charu and J. Han. 2014. eds. Frequent pattern mining. Springer.   K. Aggarwal C. Charu and J. Han. 2014. eds. Frequent pattern mining. Springer.","DOI":"10.1007\/978-3-319-07821-2"},{"volume-title":"Proceedings of the 2002 SIAM international conference on data mining. Society for Industrial and Applied Mathematics.","author":"Zaki M. J.","key":"e_1_3_2_1_17_1","unstructured":"M. J. Zaki , and C. Hsiao . 2002. CHARM: An efficient algorithm for closed itemset mining . Proceedings of the 2002 SIAM international conference on data mining. Society for Industrial and Applied Mathematics. M. J. Zaki, and C. Hsiao. 2002. CHARM: An efficient algorithm for closed itemset mining. Proceedings of the 2002 SIAM international conference on data mining. Society for Industrial and Applied Mathematics."},{"key":"e_1_3_2_1_18_1","unstructured":"SINGULARITIES\n  : https:\/\/www.singularities.com\/blog\/2015\/08\/apriori-vs-fpgrowth-for-frequent-item-set-mining  SINGULARITIES: https:\/\/www.singularities.com\/blog\/2015\/08\/apriori-vs-fpgrowth-for-frequent-item-set-mining"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835839"},{"key":"e_1_3_2_1_21_1","unstructured":"P. Tanna and Dr Ghodasara. 2014. Foundation for Frequent Pattern Mining Algorithms Implementation. arXiv preprint arXiv:1402.1814.  P. Tanna and Dr Ghodasara. 2014. Foundation for Frequent Pattern Mining Algorithms Implementation. arXiv preprint arXiv:1402.1814."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.109"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2481244.2481246"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629175.1629198"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934664"},{"key":"e_1_3_2_1_27_1","volume-title":"Reading: Addison-Wesley.","author":"Croft W. B.","year":"2010","unstructured":"W. B. Croft , D. Metzler , and T. Strohman . 2010 . Search engines: Information retrieval in practice (Vol . 283). Reading: Addison-Wesley. W. B. Croft, D. Metzler, and T. Strohman. 2010. Search engines: Information retrieval in practice (Vol. 283). Reading: Addison-Wesley."},{"key":"e_1_3_2_1_28_1","unstructured":"UCI Machine Learning Repository: https:\/\/archive.ics.uci.edu\/ml\/datasets.html  UCI Machine Learning Repository: https:\/\/archive.ics.uci.edu\/ml\/datasets.html"}],"event":{"name":"LOPAL '18: Theory and Applications","acronym":"LOPAL '18","location":"Rabat Morocco"},"container-title":["Proceedings of the International Conference on Learning and Optimization Algorithms: Theory and Applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3230905.3230913","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3230905.3230913","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:08:14Z","timestamp":1750212494000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3230905.3230913"}},"subtitle":["Recursive Algorithm for frequent itemsets extraction"],"short-title":[],"issued":{"date-parts":[[2018,5,2]]},"references-count":28,"alternative-id":["10.1145\/3230905.3230913","10.1145\/3230905"],"URL":"https:\/\/doi.org\/10.1145\/3230905.3230913","relation":{},"subject":[],"published":{"date-parts":[[2018,5,2]]},"assertion":[{"value":"2018-05-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}