{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:29:20Z","timestamp":1725550160955},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540290094"},{"type":"electronic","value":"9783540319436"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11557265_9","type":"book-chapter","created":{"date-parts":[[2005,10,1]],"date-time":"2005-10-01T05:23:14Z","timestamp":1128144194000},"page":"28-37","source":"Crossref","is-referenced-by-count":1,"title":["Computing Frequent Itemsets in Parallel Using Partial Support Trees"],"prefix":"10.1007","author":[{"given":"Dora","family":"Souliou","sequence":"first","affiliation":[]},{"given":"Aris","family":"Pagourtzis","sequence":"additional","affiliation":[]},{"given":"Nikolaos","family":"Drosinos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1145\/347090.347114","volume-title":"KDD 2000","author":"R. Agrawal","year":"2000","unstructured":"Agrawal, R., Aggarwal, C., Prasad, V.: Depth First Generation of Long Patterns. In: KDD 2000, pp. 108\u2013118. ACM, New York (2000)"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-540-30076-2_33","volume-title":"Data Warehousing and Knowledge Discovery","author":"S. Ahmed","year":"2004","unstructured":"Ahmed, S., Coenen, F., Leng, P.H.: A Tree Partitioning Method for Memory Management in Association Rule Mining. In: Kambayashi, Y., Mohania, M., W\u00f6\u00df, W. (eds.) DaWaK 2004. LNCS, vol.\u00a03181, pp. 331\u2013340. Springer, Heidelberg (2004)"},{"key":"9_CR3","unstructured":"Angiulli, F., Ianni, G., Palopoli, L.: On the complexity of inducing categorical and quantitative association rules. arXiv:cs.CC\/0111009\u00a01 (November 2001)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between Sets of Items in Large Databases. In: Proc. of ACM SIGMOD Conference on Management of Data, Washington DC (May 1993)","DOI":"10.1145\/170035.170072"},{"issue":"6","key":"9_CR5","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1109\/69.250074","volume":"5","author":"R. Agrawal","year":"1993","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Database mining: a performance perspective. IEEE Transactions on Knowledge and Data Engineering\u00a05(6), 914\u2013925 (1993); Special Issue on Learning and Discovery in Knowledge-Based Databases","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"9_CR6","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for mining association rules. In: Proc. VLDB 1994, pp. 487\u2013499 (1994)"},{"issue":"6","key":"9_CR7","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/69.553164","volume":"8","author":"R. Agrawal","year":"1996","unstructured":"Agrawal, R., Shafer, J.C.: Parallel Mining of Association Rules. IEEE Trans. Knowl. Data Eng.\u00a08(6), 962\u2013969 (1996)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Bayardo Jr., R.J., Agrawal, R.: Mining the Most Interesting Rules. In: Proc. of the Fifth ACM SIGKDD Int\u2019l Conf. on Knowledge Discovery and Data Mining, pp. 145\u2013154 (1999)","DOI":"10.1145\/312129.312219"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-45841-7_10","volume-title":"STACS 2002","author":"E. Boros","year":"2002","unstructured":"Boros, E., Gurvich, V., Khachiyan, L., Makino, K.: On the complexity of generating maximal frequent and minimal infrequent sets. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, p. 133. Springer, Heidelberg (2002)"},{"key":"9_CR10","series-title":"Lecture Notes in Artificial Intelligence","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":"Coenen, F., Goulbourne, G., Leng, P.: Computing Association Rules using Partial Totals. In: Siebes, A., De Raedt, L. (eds.) PKDD 2001. LNCS (LNAI), vol.\u00a02168, pp. 54\u201366. Springer, Heidelberg (2001)"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/B:DAMI.0000005257.93780.3b","volume":"8","author":"F. Coenen","year":"2004","unstructured":"Coenen, F., Goulbourne, G., Leng, P.: Tree Structures for Mining Association Rules. Data Mining and Knowledge Discovery\u00a08, 25\u201351 (2004)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0950-7051(00)00055-1","volume":"13","author":"G. Goulbourne","year":"2000","unstructured":"Goulbourne, G., Coenen, F., Leng, P.: Algorithms for Computing Association Rules using a Partial-Support Tree. Journal of Knowledge-Based Systems\u00a013, 141\u2013149 (2000)","journal-title":"Journal of Knowledge-Based Systems"},{"key":"9_CR13","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"},{"key":"9_CR14","unstructured":"Raymon, R.: Search Through Systematic Search Enumeration. In: Proc. 3rd Int,l Conf. on Principles of Knowledge Representation and Reasoning, pp. 539\u2013550"},{"key":"9_CR15","unstructured":"Savasere, A., Omiecinski, E., Navathe, S.: An Efficient Algorithm for Mining Association Rules in Large Databases. In: VLDB 1995, pp. 432\u2013444 (1995)"},{"key":"9_CR16","unstructured":"Toivonen, H.: Sampling Large Databses for Association Rules. In: VLDB 1996, pp. 1\u201312 (1996)"}],"container-title":["Lecture Notes in Computer Science","Recent Advances in Parallel Virtual Machine and Message Passing Interface"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11557265_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T00:36:48Z","timestamp":1552437408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11557265_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290094","9783540319436"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11557265_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}