{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:39:23Z","timestamp":1725550763615},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292449"},{"type":"electronic","value":"9783540316657"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/11564126_66","type":"book-chapter","created":{"date-parts":[[2005,11,4]],"date-time":"2005-11-04T10:24:55Z","timestamp":1131099895000},"page":"625-633","source":"Crossref","is-referenced-by-count":2,"title":["Improvements in the Data Partitioning Approach for Frequent Itemsets Mining"],"prefix":"10.1007","author":[{"given":"Son N.","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria E.","family":"Orlowska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"66_CR1","first-page":"487","volume-title":"Proc. 20th Int. Conf. Very Large Data Bases","author":"R. Agrawal","year":"1994","unstructured":"Agrawal, R., Srikant, R.:  Fast algorithms for mining association rules. In: Proc. 20th Int. Conf. Very Large Data Bases, pp. 487\u2013499. Morgan Kaufmann, San Francisco (1994)"},{"unstructured":"Savasere, A., Omiecinski, E., Navathe, S.: An efficient algorithms for mining association rules in large database. In: Proc. 21th Int. Conf. Very Large Data Bases, Swizerland (1995)","key":"66_CR2"},{"unstructured":"Goethals, B.:  Survey on frequent pattern mining. University of Helsinki (2002)","key":"66_CR3"},{"unstructured":"Lin, J.L., Dunham, M.H.: Mining association rules: Anti-skew algorithms. In: Proc. 14th IEEE Int. Conf. on Data Engineering, Florida (1998)","key":"66_CR4"},{"doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in lagre database. In: Proc. 1993 ACM SIGMOD Int. Conf. on Management of Data (1993)","key":"66_CR5","DOI":"10.1145\/170035.170072"},{"doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Ullman, D.J., Tsur, S.: Dynamic Itemset Counting and implication rules for masket basket data. In: Proc. ACM SIGMOD 1997 Int. Conf. on Management of Data, pp. 255\u2013264 (1997)","key":"66_CR6","DOI":"10.1145\/253262.253325"},{"issue":"3","key":"66_CR7","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"M.J. Zaki","year":"2000","unstructured":"Zaki, M.J.:  Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering\u00a012(3), 372\u2013390 (2000)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"66_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J. Han","year":"2004","unstructured":"Han, J., Pei, J., Yin, Y., Mao, R.:  Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Mining and Knowledge Discovery\u00a08, 53\u201387 (2004)","journal-title":"Data Mining and Knowledge Discovery"},{"unstructured":"Mueller, A.: Fast sequential and parallel algorithm for association rules mining: A comparison. Technical Report CS-TR-3515, University of Maryland (1995)","key":"66_CR9"},{"unstructured":"Nguyen, S.N.: Data partitioning approach into selected data mining problems. PhD Confirmation report, The University of Queensland, Australia (2005)","key":"66_CR10"},{"unstructured":"Pudi, V., Haritsa, J.: ARMOR: Association rule mining based on Oracle. In: Workshop on Frequent Itemset Mining Implementations (FIMI 2003 in conjunction with ICDM 2003) (2003)","key":"66_CR11"},{"unstructured":"Zhu, T.: The Apriori algorithm implementation, \n                    \n                      http:\/\/www.cs.ualberta.ca\/~tszhu\/","key":"66_CR12"},{"issue":"2","key":"66_CR13","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/380995.381033","volume":"2","author":"R. Kohavi","year":"2000","unstructured":"Kohavi, R., Brodley, C., Frasca, B., Mason, L., Zheng, Z.: KDD-Cup 2000 organizers\u2019 report: Peeling the onion. SIGKDD Explorations\u00a02(2), 86\u201398 (2000)","journal-title":"SIGKDD Explorations"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Databases: PKDD 2005"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11564126_66","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:41:14Z","timestamp":1558287674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11564126_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292449","9783540316657"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11564126_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}