{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:44:58Z","timestamp":1758271498251},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408079"},{"type":"electronic","value":"9783540452287"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45228-7_37","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T01:00:12Z","timestamp":1294362012000},"page":"371-380","source":"Crossref","is-referenced-by-count":19,"title":["Non-recursive Generation of Frequent K-itemsets from Frequent Pattern Tree Representations"],"prefix":"10.1007","author":[{"given":"Mohammad","family":"El-Hajj","sequence":"first","affiliation":[]},{"given":"Osmar R.","family":"Za\u00efane","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, R., Aggarwal, C., Prasad, V.: A tree projection algorithm for generation of frequent itemsets. Parallel and distributed Computing (2000)","DOI":"10.1006\/jpdc.2000.1693"},{"key":"37_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. 1994 Int. Conf. Very Large Data Bases, Santiago, Chile, pp. 487\u2013499 (September 1994)"},{"key":"37_CR3","unstructured":"IBM. Almaden. Quest synthetic data generation code, \n                    \n                      http:\/\/www.almaden.ibm.com\/cs\/quest\/syndata.html"},{"key":"37_CR4","unstructured":"Borgelt, C.: Apriori implementation, \n                    \n                      http:\/\/fuzzy.cs.unimagdeburg.de\/~borgelt\/apriori\/apriori.html"},{"issue":"3","key":"37_CR5","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/69.846289","volume":"12","author":"E.-H. Han","year":"2000","unstructured":"Han, E.-H., Karypis, G., Kumar, V.: Scalable parallel data mining for association rule. Transactions on Knowledge and data engineering\u00a012(3), 337\u2013352 (2000)","journal-title":"Transactions on Knowledge and data engineering"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: ACM-SIGMOD, Dallas (2000)","DOI":"10.1145\/342009.335372"},{"key":"37_CR7","unstructured":"Huang, H., Wu, X., Relue, R.: Association analysis with one scan of databases. In: IEEE International Conference on Data Mining, pp. 629\u2013636 (December 2002)"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Liu, J., Pan, Y., Wang, K., Han, J.: Mining frequent item sets by oppotunistic projection. In: Eight ACM SIGKDD Internationa Conf. on Knowledge Discovery and Data Mining, Edmonton, Alberta, pp. 229\u2013238 (August 2002)","DOI":"10.1145\/775047.775081"}],"container-title":["Lecture Notes in Computer Science","Data Warehousing and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45228-7_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:32:25Z","timestamp":1558294345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45228-7_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408079","9783540452287"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45228-7_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}