{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T10:00:11Z","timestamp":1725703211949},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642340437"},{"type":"electronic","value":"9783642340444"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-34044-4_7","type":"book-chapter","created":{"date-parts":[[2012,10,4]],"date-time":"2012-10-04T02:20:04Z","timestamp":1349317204000},"page":"120-133","source":"Crossref","is-referenced-by-count":0,"title":["FP-Growth in Discovery of Customer Patterns"],"prefix":"10.1007","author":[{"given":"Jerzy","family":"Korczak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Skrzypczak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Bereta, M.: Data Mining z wykorzystaniem programu RapidMiner, czerwiec, (2010), \n                  \n                    http:\/\/michalbereta.pl\/dydaktyka\/ZSI\/Lab%20Data%20Mining%201.pdf\n                  \n                  \n                , czerwiec (2010), \n                  \n                    http:\/\/michalbereta.pl\/dydaktyka\/ZSI\/Lab%20Data%20Mining%202.pdf"},{"key":"7_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-39804-2_8","volume-title":"Knowledge Discovery in Databases: PKDD 2003","author":"F. Bonchi","year":"2003","unstructured":"Bonchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: ExAnte: Anticipated Data Reduction in Constrained Pattern Mining. In: Lavra\u010d, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS (LNAI), vol.\u00a02838, pp. 59\u201370. Springer, Heidelberg (2003)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Borgelt, C.: Keeping Things Simple: Finding Frequent Item Sets by Recursive Elimination. In: Borgelt, C. (ed.) Workshop Open Source Data Mining Software (OSDM 2005), Chicago, pp. 66\u201370. ACM Press (2005)","DOI":"10.1145\/1133905.1133914"},{"key":"7_CR4","unstructured":"Gyor\u00f6di, C., Gyor\u00f6di, R., Cofeey, T., Holban, S.: Mining Association Rules using Dynamic FP-trees. In: Proceedings of The Irish Signal and Systems Conference, pp. 76\u201382. University of Limerick (2003)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidature Generation. In: Proc. of the 200 ACM SIGMOD Int. Conf. on Management of Data, Dallas, pp. 1\u201312 (2000)","DOI":"10.1145\/335191.335372"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Han, J., Yin, Y., Mao, R.: Mining Frequent Patterns without Candidat Generation: A Frequent-Pattern Tree Approach. In: Data Mining and Knowledge Discovery, vol.\u00a08, pp. 53\u201382. Kluwer Academic Publ. (2004)","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"key":"7_CR7","unstructured":"Hand, D., Mannila, H., Smyth, P.: Eksploracja danych. Wydawnictwo Naukowo-Techniczne WNT, Warszawa (2005)"},{"issue":"1","key":"7_CR8","first-page":"71","volume":"32","author":"S. Kotsiantis","year":"2006","unstructured":"Kotsiantis, S., Kanellopoulos, D.: Association Rules Mining: A Recent Overview. Proc. GESTS Internat. Trans. on Computer Science and Eng.\u00a032(1), 71\u201382 (2006)","journal-title":"Proc. GESTS Internat. Trans. on Computer Science and Eng."},{"key":"7_CR9","unstructured":"Morzy, T.: Eksploracja danych (2010), \n                  \n                    http:\/\/www.portalwiedzy.pan.pl\/images\/stories\/pliki\/publikacje\/nauka\/2007\/03\/N_307_06_Morzy.pdf"},{"key":"7_CR10","unstructured":"Paszty\u0142a, A.: Analiza koszykowa danych transakcyjnych \u2013 cele i metody (2010), \n                  \n                    http:\/\/www.statsoft.pl\/pdf\/artykuly\/basket.pdf"},{"key":"7_CR11","unstructured":"R\u00e1cz, B.: NONORDFP: An FP-Growth Variation without Rebuilding the FP-Tree. In: 2nd Int\u2019l Workshop on Frequent Itemset Mining Implementations FIMI (2004)"},{"key":"7_CR12","unstructured":"RapidMiner 4.3. User Guide. Operator Reference. Developer Tutorial (2010), \n                  \n                    http:\/\/docs.huihoo.com\/rapidminer\/rapidminer-4.3-tutorial.pdf"},{"key":"7_CR13","unstructured":"Skrzypczak, P.: Modelowanie wzorc\u00f3w zachowa\u0144 klient\u00f3w Delikates\u00f3w Alma przy wykorzystaniu regu\u0142 asocjacyjnych, Master Thesis, Uniwersytet Ekonomiczny, Wroc\u0142aw (2010)"},{"key":"7_CR14","unstructured":"Zaki, M., Parthasarathy, S., Ogihara, M., Li, W.: New Algorithms for Fast Discovery of Association Rules. In: Proc. 3rd Int. Conf. on Knowledge Discovery and Data Mining (KDD 1997), pp. 283\u2013296. AAAI Press (1997)"}],"container-title":["Lecture Notes in Business Information Processing","Data-Driven Process Discovery and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34044-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T03:34:52Z","timestamp":1557286492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34044-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642340437","9783642340444"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34044-4_7","relation":{},"ISSN":["1865-1348","1865-1356"],"issn-type":[{"type":"print","value":"1865-1348"},{"type":"electronic","value":"1865-1356"}],"subject":[],"published":{"date-parts":[[2012]]}}}