{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:02:48Z","timestamp":1725494568074},"publisher-location":"Boston, MA","reference-count":14,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387741604"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-74161-1_23","type":"book-chapter","created":{"date-parts":[[2007,11,9]],"date-time":"2007-11-09T05:50:57Z","timestamp":1194587457000},"page":"213-220","source":"Crossref","is-referenced-by-count":0,"title":["A fast parallel algorithm for frequent itemsets mining"],"prefix":"10.1007","author":[{"given":"Dora","family":"Souliou","sequence":"first","affiliation":[]},{"given":"Aris","family":"Pagourtzis","sequence":"additional","affiliation":[]},{"given":"Panayiotis","family":"Tsanakas","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"S. Ahmed, F. Coenen, and P.H. Leng: A Tree Partitioning Method for Memory Management in Association Rule Mining. In Proc. of Data Warehousing and Knowledge Discovery, 6th International Conference (DaWaK 2004), Lecture Notes in Computer Science 3181, pp. 331\u2013340, Springer-Verlag 2004.","DOI":"10.1007\/978-3-540-30076-2_33"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, and A. Swami. Mining Association Rules between Sets of Items in Large Databases. In Proc. of the 1993 ACM SIGMOD Conference on Management of Data, Washington DC, pp. 207\u2013216 1993.","DOI":"10.1145\/170035.170072"},{"key":"23_CR3","unstructured":"R. Agrawal and R. Srikant. Fast Algorithms for mining association rules. In Proc. VLDB\u201994, pp. 487\u2013499 1994."},{"issue":"6","key":"23_CR4","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/69.553164","volume":"8","author":"R. Agrawal","year":"1996","unstructured":"R. Agrawal and J.C. Shafer. Parallel Mining of Association Rules. IEEE Transactions on Knowledge and Data Engineering 8(6), pp. 962\u2013969, 1996.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"R. J. Bayardo, Jr. and R. Agrawal. Mining the Most Interesting Rules. In Proc. of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 145\u2013154, 1999.","DOI":"10.1145\/312129.312219"},{"key":"23_CR6","series-title":"Lecture Notes in AI","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-44794-6_5","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"F. Coenen","year":"2001","unstructured":"F. Coenen, G. Goulbourne, and P. Leng. Computing Association Rules using Partial Totals. In L. De Raedt and A. Siebes eds, Principles of Data Mining and Knowledge Discovery (Proceedings of the 5th European Conference, PKDD 2001, Freiburg), Lecture Notes in AI 2168, Springer-Verlag, Berlin, Heidelberg: pp. 54\u201366 2001."},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/B:DAMI.0000005257.93780.3b","volume":"8","author":"F. Coenen","year":"2004","unstructured":"F. Coenen, G. Goulbourne, and P. Leng. Tree Structures for Mining Association Rules. Data Mining and Knowledge Discovery, pp. 25\u201351, 8 2004","journal-title":"Data Mining and Knowledge Discovery"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0950-7051(00)00055-1","volume":"13","author":"G. Goulbourne","year":"2000","unstructured":"G. Goulbourne, F. Coenen, and P. Leng. Algorithms for Computing Association Rules using a Partial-Support Tree. Journal of Knowledge-Based Systems pp. 141\u2013149, 13 2000.","journal-title":"Journal of Knowledge-Based Systems"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"F. Coenen, P. Leng, and S. Ahmed. T-Trees, Vertical Partitioning and Distributed Association Rule Mining. In Proc. of the 3rd IEEE International Conference on Data Mining pp. 513\u2013516, ICDM 2003.","DOI":"10.1109\/ICDM.2003.1250965"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"F. Coenen, P. Leng, A. Pagourtzis, W. Rytter, D. Souliou. Improved Methods for Extracting Frequent Itemsets from Interim-Support Trees. In Proc. of AI 2005.","DOI":"10.1007\/978-1-84628-226-3_20"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J. Han","year":"2004","unstructured":"J. Han, J. Pei, Y. Yin, and R. Mao. Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach. Data Mining and Knowledge Discovery, pp. 53\u201387, 8 2004.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"23_CR12","unstructured":"R. Raymon. Search Through Systematic Search Enumeration. In Proc. of the 3rd International Conference on Principles of Knowledge Representation and Reasoning, pp. 539\u2013550 1992."},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"D. Souliou, A. Pagourtzis, N. Drosinos, P. Tsanakas. Computing Frequent Itemsets in Parallel Using Partial Support Trees, in Proceedings of 12th European PVM\/MPI Conference (Euro PVM\/MPI 2005), Sorrento (Naples), Italy, Lecture Notes in Computer Science 3666, pp. 28\u201337, Springer-Verlag 2005","DOI":"10.1007\/11557265_9"},{"key":"23_CR14","unstructured":"Osmar R. Zaine Mohammad El-Hajj Paul Lu. Fast Parallel Association Rule Mining without Candidate Generation. In Proc. of ICDM 2001."}],"container-title":["IFIP The International Federation for Information Processing","Artificial Intelligence and Innovations 2007: from Theory to Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74161-1_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,29]],"date-time":"2021-04-29T04:24:30Z","timestamp":1619670270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-74161-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387741604"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74161-1_23","relation":{},"subject":[]}}