{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T12:26:55Z","timestamp":1725884815809},"publisher-location":"Singapore","reference-count":10,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811033247"},{"type":"electronic","value":"9789811033254"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-981-10-3325-4_3","type":"book-chapter","created":{"date-parts":[[2017,4,12]],"date-time":"2017-04-12T10:24:18Z","timestamp":1491992658000},"page":"21-29","source":"Crossref","is-referenced-by-count":0,"title":["FP-Growth Implementation Using Tries for Association Rule Mining"],"prefix":"10.1007","author":[{"given":"Manu","family":"Goel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kanu","family":"Goel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,13]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, R., Srikant, R.: Mining sequential patterns. In: ICDE 1995, Taipei, Taiwan, pp. 3\u201314, March 1995","DOI":"10.1109\/ICDE.1995.380415"},{"issue":"3","key":"3_CR2","doi-asserted-by":"crossref","first-page":"155","DOI":"10.14257\/ijhit.2014.7.3.16","volume":"7","author":"W Taktak","year":"2014","unstructured":"Taktak, W., Slimani, Y.: MS-FP-Growth: a multi-support version of FP-Growth agorithm. Int. J. Hybrid Inf. Technol. 7(3), 155\u2013166 (2014)","journal-title":"Int. J. Hybrid Inf. Technol."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Hipp, J., G\u00fcntzer, U., Nakhaeizadeh, G.: Algorithms for Association Rule Mining-A General Survey and Comparison. University of Tubingen, Tubingen (2000)","DOI":"10.1145\/360402.360421"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Borgelt, C.: An implementation of the FP-Growth algorithm. In: Proceedings of the 1st International Workshop on Open Source Data Mining: Frequent Pattern Mining Implementations, pp. 1\u20135. ACM (2005)","DOI":"10.1145\/1133905.1133907"},{"issue":"6","key":"3_CR5","first-page":"400","volume":"1","author":"BS Kumar","year":"2010","unstructured":"Kumar, B.S., Rukmani, K.V.: Implementation of web usage mining using APRIORI and FP growth algorithms. Int. J. Adv. Netw. Appl. 1(6), 400\u2013404 (2010)","journal-title":"Int. J. Adv. Netw. Appl."},{"key":"3_CR6","unstructured":"R\u00e1cz, B.: nonordfp: an FP-Growth variation without rebuilding the FP-Tree. In: 2nd International Workshop on Frequent Itemset Mining Implementations, FIMI (2004)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Li, H., Wang, Y., Zhang, D., Zhang, M., Chang, E.Y.: Pfp: parallel FP-Growth for query recommendation In: Proceedings of the ACM Conference on Recommender Systems, pp. 107\u2013114. ACM (2008)","DOI":"10.1145\/1454008.1454027"},{"issue":"2","key":"3_CR8","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1145\/380995.381002","volume":"2","author":"J Han","year":"2000","unstructured":"Han, J., Pei, J.: Mining frequent patterns by pattern-growth: methodology and implications. ACM SIGKDD Explor. Newsl. 2(2), 14\u201320 (2000)","journal-title":"ACM SIGKDD Explor. Newsl."},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-540-28651-6_23","volume-title":"Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2004","author":"HC Tjioe","year":"2004","unstructured":"Tjioe, H.C., Taniar, D.: A framework for mining association rules in data warehouses. In: Yang, Z.R., Yin, H., Everson, R.M. (eds.) IDEAL 2004. LNCS, vol. 3177, pp. 159\u2013165. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-28651-6_23"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.1007\/3-540-48311-X_204","volume-title":"Euro-Par\u201999 Parallel Processing","author":"P Becuzzi","year":"1999","unstructured":"Becuzzi, P., Coppola, M., Vanneschi, M.: Mining of association rules in very large databases: a structured parallel approach. In: Amestoy, P., Berger, P., Dayd\u00e9, M., Ruiz, D., Duff, I., Frayss\u00e9, V., Giraud, L. (eds.) Euro-Par 1999. LNCS, vol. 1685, pp. 1441\u20131450. Springer, Heidelberg (1999). doi: 10.1007\/3-540-48311-X_204"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of Sixth International Conference on Soft Computing for Problem Solving"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-3325-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T20:19:35Z","timestamp":1569010775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-3325-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9789811033247","9789811033254"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-3325-4_3","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2017]]}}}