{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:03:25Z","timestamp":1742972605203,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030031916"},{"type":"electronic","value":"9783030031923"}],"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-03192-3_10","type":"book-chapter","created":{"date-parts":[[2018,10,26]],"date-time":"2018-10-26T03:06:48Z","timestamp":1540523208000},"page":"127-144","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Higher Performance IPPC+ Tree for Parallel Incremental Frequent Itemsets Mining"],"prefix":"10.1007","author":[{"given":"Van Quoc Phuong","family":"Huynh","sequence":"first","affiliation":[]},{"given":"Josef","family":"K\u00fcng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,27]]},"reference":[{"key":"10_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of 20th International Conference on VLDB, pp. 487\u2013499 (1994)"},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent itemsets without candidate generation. ACM SIGMOD Rec. 29(2), 1\u201312 (2000)","journal-title":"ACM SIGMOD Rec."},{"issue":"10","key":"10_CR3","doi-asserted-by":"publisher","first-page":"4505","DOI":"10.1016\/j.eswa.2014.01.025","volume":"41","author":"Z-H Deng","year":"2014","unstructured":"Deng, Z.-H., Lv, S.-L.: Fast mining frequent itemsets using nodesets. Expert Syst. Appl. 41(10), 4505\u20134512 (2014)","journal-title":"Expert Syst. Appl."},{"issue":"13","key":"10_CR4","doi-asserted-by":"publisher","first-page":"5424","DOI":"10.1016\/j.eswa.2015.03.004","volume":"42","author":"Z-H Deng","year":"2015","unstructured":"Deng, Z.-H., Lv, S.-L.: PrePost+: an efficient N-lists-based algorithm for mining frequent itemsets via children-parent equivalence pruning. Expert Syst. Appl. 42(13), 5424\u20135432 (2015)","journal-title":"Expert Syst. Appl."},{"key":"10_CR5","unstructured":"Market-Basket Synthetic Data Generator. https:\/\/synthdatagen.codeplex.com\/"},{"key":"10_CR6","unstructured":"Frequent Itemset Mining Dataset Repository: Kosarak, online news portal click-stream data. http:\/\/fimi.ua.ac.be\/data\/kosarak.dat.gz"},{"key":"10_CR7","unstructured":"Savasere, A., Omiecinski, E., Navathe, S.: An efficient algorithm for mining association rules in large databases. In: VLDB, pp. 432\u2013443 (1995)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/3-540-44801-2_8","volume-title":"Data Warehousing and Knowledge Discovery","author":"R Perego","year":"2001","unstructured":"Perego, R., Orlando, S., Palmerini, P.: Enhancing the Apriori algorithm for frequent set counting. In: Kambayashi, Y., Winiwarter, W., Arikawa, M. (eds.) DaWaK 2001. LNCS, vol. 2114, pp. 71\u201382. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44801-2_8"},{"issue":"5","key":"10_CR9","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1109\/69.634757","volume":"9","author":"JS Park","year":"1997","unstructured":"Park, J.S., Chen, M.S., Yu, P.S.: Using a hash-based method with transaction trimming and database scan reduction for mining association rules. IEEE Trans. Knowl. Data Eng. 9(5), 813\u2013825 (1997)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"10_CR10","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki, M.J.: Scalable algorithms for association mining. IEEE Trans. Knowl. Data Eng. 12(3), 372\u2013390 (2000)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"10","key":"10_CR11","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. Trans. Knowl. Data Eng. 17(10), 1347\u20131362 (2005)","journal-title":"Trans. Knowl. Data Eng."},{"issue":"3","key":"10_CR12","first-page":"249","volume":"9","author":"G Liu","year":"2004","unstructured":"Liu, G., Lu, H., Lou, W., Xu, Y., Yu, J.X.: Efficient mining of frequent itemsets using ascending frequency ordered prefix-tree. DMKD J. 9(3), 249\u2013274 (2004)","journal-title":"DMKD J."},{"issue":"2","key":"10_CR13","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/335191.335376","volume":"29","author":"Pradeep Shenoy","year":"2000","unstructured":"Shenoy, P., Haritsa, J.R., Sudarshan, S.: Turbo-charging vertical mining of large databases. In: 2000 SIGMOD, pp. 22\u201333 (2000)","journal-title":"ACM SIGMOD Record"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Gouda, K.: Fast vertical mining using diffsets. In: 9th SIGKDD, pp. 326\u2013335 (2003)","DOI":"10.1145\/956750.956788"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-319-64468-4_35","volume-title":"Database and Expert Systems Applications","author":"VQP Huynh","year":"2017","unstructured":"Huynh, V.Q.P., K\u00fcng, J., Dang, T.K.: Incremental frequent itemsets mining with IPPC tree. In: Benslimane, D., Damiani, E., Grosky, W.I., Hameurlain, A., Sheth, A., Wagner, R.R. (eds.) DEXA 2017. LNCS, vol. 10438, pp. 463\u2013477. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-64468-4_35"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-319-70004-5_9","volume-title":"Future Data and Security Engineering","author":"VQP Huynh","year":"2017","unstructured":"Huynh, V.Q.P., K\u00fcng, J., J\u00e4ger, M., Dang, T.K.: IFIN+: a parallel incremental frequent itemsets mining in shared-memory environment. In: Dang, T.K., Wagner, R., K\u00fcng, J., Thoai, N., Takizawa, M., Neuhold, E.J. (eds.) FDSE 2017. LNCS, vol. 10646, pp. 121\u2013138. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70004-5_9"}],"container-title":["Lecture Notes in Computer Science","Future Data and Security Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03192-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:06:56Z","timestamp":1709824016000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-03192-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030031916","9783030031923"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03192-3_10","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":"27 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FDSE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Future Data and Security Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ho Chi Minh City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","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":"28 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fdse2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cse.hcmut.edu.vn\/fdse2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}