{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:40:30Z","timestamp":1725565230998},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220640"},{"type":"electronic","value":"9783540247753"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24775-3_12","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T23:48:20Z","timestamp":1284162500000},"page":"96-105","source":"Crossref","is-referenced-by-count":2,"title":["ParaDualMiner: An Efficient Parallel Implementation of the DualMiner Algorithm"],"prefix":"10.1007","author":[{"given":"Roger M. H.","family":"Ting","sequence":"first","affiliation":[]},{"given":"James","family":"Bailey","sequence":"additional","affiliation":[]},{"given":"Kotagiri","family":"Ramamohanarao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","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. On Knowledge And Data Engineering\u00a08, 962\u2013969 (1996)","journal-title":"IEEE Trans. On Knowledge And Data Engineering"},{"key":"12_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proceedings of VLDB 1994, pp. 487\u2013499 (1994)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bayardo, R., Agrawal, R., Gunopulos, D.: Constraint-based rule mining in large, dense databases. In: Proceedings of ICDE 1999, pp. 188\u2013197 (1999)","DOI":"10.1109\/ICDE.1999.754924"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Bucila, C., Gehrke, J., Kifer, D., White, W.: Dualminer: a dual-pruning algorithm for itemsets with constraints. In: Proceedings of ACM SIGKDD 2002, pp. 42\u201351 (2002)","DOI":"10.1145\/775047.775054"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Burdick, D., Calimlim, M., Gehrke, J.: Mafia: A maximal frequent itemset algorithm for transactional databases. In: Proceedings of ICDE 2001, pp. 443\u2013452 (2001)","DOI":"10.1109\/ICDE.2001.914857"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Eager, D.L., Lazowska, E.D., Zahorjan, J.: A comparison of receiver-initiated and sender-initiated adaptive load sharing. In: Proceedings of ACM SIGMETRICS 1985, pp. 1\u20133 (1985)","DOI":"10.1145\/317786.317802"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Han, E.H., Karypis, G., Kumar, V.: Scalable parallel data mining for association rules. In: Proceedings of SIGMOD 1997, pp. 277\u2013288 (1997)","DOI":"10.1145\/253260.253330"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Ng, R.T., Lakshmanan, L.V., Han, J., Pang, A.: Exploratory mining and pruning optimizations of constrained association rules. In: Proceedings of SIGMOD 1998, pp. 13\u201324 (1998)","DOI":"10.1145\/276304.276307"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Orlando, S., Palmerini, P., Perego, R., Silvestri, F.: Adaptive and resource-aware mining of frequent sets. In: Proceedings of ICDM 2002, p. 338 (2002)","DOI":"10.1109\/ICDM.2002.1183921"},{"key":"12_CR10","unstructured":"Pei, J., Han, J., Lakshmanan, L.: Mining frequent item sets with convertible constraints. In: Proceedings of ICDE 2001, pp. 433\u2013442 (2001)"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Sanders, P.: A detailed analysis of random polling dynamic load balancing. In: Proceedings of ISPAN 1994, pp. 382\u2013389 (1994)","DOI":"10.1109\/ISPAN.1994.367176"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","first-page":"39","volume-title":"Algorithms and Computations","author":"P. Sanders","year":"1999","unstructured":"Sanders, P.: Asynchronous random polling dynamic load balancing. In: Aggarwal, A.K., Pandu Rangan, C. (eds.) ISAAC 1999. LNCS, vol.\u00a01741, p. 39. Springer, Heidelberg (1999)"},{"key":"12_CR13","unstructured":"Raedt, L.D., Kramer, S.: The levelwise version space algorithm and its application to molecular fragment finding. In: Proceedings of IJCAI 2001, pp. 853\u20138622 (2001)"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Zaiane, O., El-Hajj, M., Lu, P.: Fast parallel association rule mining without candidacy generation. In: Proceedings of ICDM 2001, pp. 665\u2013668 (2001)","DOI":"10.1109\/ICDM.2001.989600"},{"issue":"2","key":"12_CR15","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1006\/jpdc.1997.1339","volume":"43","author":"M. Zaki","year":"1997","unstructured":"Zaki, M., Li, W., Parthasarathy, S.: Customized dynamic load balancing for a network of workstations. Journal of Parallel and Distributed Computing\u00a043(2), 156\u2013162 (1997)","journal-title":"Journal of Parallel and Distributed Computing"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24775-3_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:56:24Z","timestamp":1605761784000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24775-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220640","9783540247753"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24775-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}