{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T15:59:24Z","timestamp":1775318364165,"version":"3.50.1"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319575285","type":"print"},{"value":"9783319575292","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-57529-2_50","type":"book-chapter","created":{"date-parts":[[2017,4,22]],"date-time":"2017-04-22T12:28:36Z","timestamp":1492864116000},"page":"644-654","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["SS-FIM: Single Scan for Frequent Itemsets Mining in Transactional Databases"],"prefix":"10.1007","author":[{"given":"Youcef","family":"Djenouri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Comuzzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Djamel","family":"Djenouri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,23]]},"reference":[{"key":"50_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: ACM SIGMOD Record, vol. 22, no. 2, pp. 207\u2013216. ACM, June 1993","DOI":"10.1145\/170036.170072"},{"key":"50_CR2","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: ACM SIGMOD Record, vol. 29, no. 2, pp. 1\u201312. ACM, May 2000","DOI":"10.1145\/335191.335372"},{"key":"50_CR3","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Ullman, J.D., Tsur, S.: Dynamic itemset counting and implication rules for market basket data. In: ACM SIGMOD Record, vol. 26, no. 2, pp. 255\u2013264. ACM, June 1997","DOI":"10.1145\/253262.253325"},{"key":"50_CR4","unstructured":"Mueller, A.: Fast sequential and parallel algorithms for association rule mining: a comparison. Technical report CS-TR-3515, University of Maryland, College Park, August 1995"},{"key":"50_CR5","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In: Third International Conference Knowledge Discovery and Data Mining (1997)","DOI":"10.1007\/978-1-4615-5669-5_1"},{"key":"50_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-28320-8_11","volume-title":"New Frontiers in Applied Data Mining","author":"K Amphawan","year":"2012","unstructured":"Amphawan, K., Lenca, P., Surarerks, A.: Efficient mining top-k regular-frequent itemset using compressed tidsets. In: Cao, L., Huang, J.Z., Bailey, J., Koh, Y.S., Luo, J. (eds.) PAKDD 2011. LNCS (LNAI), vol. 7104, pp. 124\u2013135. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-28320-8_11"},{"key":"50_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/978-3-540-68125-0_61","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"CK-S Leung","year":"2008","unstructured":"Leung, C.K.-S., Mateo, M.A.F., Brajczuk, D.A.: A tree-based approach for frequent pattern mining from uncertain data. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 653\u2013661. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-68125-0_61"},{"issue":"1","key":"50_CR8","first-page":"3","volume":"3","author":"L Cerf","year":"2009","unstructured":"Cerf, L., Besson, J., Robardet, C., Boulicaut, J.F.: Closed patterns meet n-ary relations. ACM Trans. Knowl. Discov. Data (TKDD) 3(1), 3 (2009)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"issue":"10","key":"50_CR9","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1109\/TKDE.2005.166","volume":"17","author":"G Grahne","year":"2005","unstructured":"Grahne, G., Zhu, J.: Fast algorithms for frequent itemset mining using FP-trees. IEEE Trans. Knowl. Data Eng. 17(10), 1347\u20131362 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"6","key":"50_CR10","first-page":"437","volume":"2","author":"C Borgelt","year":"2012","unstructured":"Borgelt, C.: Frequent itemset mining. Wiley Interdisc. Rev.: Data Min. Knowl. Discov. 2(6), 437\u2013456 (2012)","journal-title":"Wiley Interdisc. Rev.: Data Min. Knowl. Discov."},{"issue":"4","key":"50_CR11","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1007\/s11227-014-1366-8","volume":"71","author":"Y Djenouri","year":"2015","unstructured":"Djenouri, Y., Bendjoudi, A., Mehdi, M., Nouali-Taboudjemat, N., Habbas, Z.: GPU-based bees swarm optimization for association rules mining. J. Supercomput. 71(4), 1318\u20131344 (2015)","journal-title":"J. Supercomput."},{"issue":"4","key":"50_CR12","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":"2","key":"50_CR13","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. CIT J. Comput. Inf. Technol. 24(2), 165\u2013179 (2016)","journal-title":"CIT J. Comput. Inf. Technol."},{"issue":"3","key":"50_CR14","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s10115-015-0859-y","volume":"47","author":"JM Luna","year":"2016","unstructured":"Luna, J.M., Pechenizkiy, M., Ventura, S.: Mining exceptional relationships with grammar-guided genetic programming. Knowl. Inf. Syst. 47(3), 571\u2013594 (2016)","journal-title":"Knowl. Inf. Syst."},{"key":"50_CR15","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1142\/9789812709066_0006","volume":"11","author":"M Hegland","year":"2005","unstructured":"Hegland, M.: The apriori algorithm tutorial. Math. Comput. imaging Sci. Inf. Process. 11, 209\u2013262 (2005)","journal-title":"Math. Comput. imaging Sci. Inf. Process."},{"key":"50_CR16","unstructured":"Guvenir, H.A., Uysal, I.: Bilkent university function approximation repository (2000). http:\/\/funapp.CS.bilkent.edu.tr\/DataSets. Accessed 12 Mar 2012"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57529-2_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:44:28Z","timestamp":1709822668000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-57529-2_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319575285","9783319575292"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57529-2_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"23 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Jeju","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/pakdd2017.snu.ac.kr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}