{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T10:41:51Z","timestamp":1777372911915,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642413971","type":"print"},{"value":"9783642413988","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41398-8_20","type":"book-chapter","created":{"date-parts":[[2013,10,15]],"date-time":"2013-10-15T09:09:30Z","timestamp":1381828170000},"page":"223-236","source":"Crossref","is-referenced-by-count":10,"title":["Diversity-Driven Widening"],"prefix":"10.1007","author":[{"given":"Violeta N.","family":"Ivanova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael R.","family":"Berthold","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Akbar, Z., Ivanova, V.N., Berthold, M.R.: Parallel data mining revisited. Better, not faster. In: Hollm\u00e9n, J., Klawonn, F., Tucker, A. (eds.) IDA 2012. LNCS, vol.\u00a07619, pp. 23\u201334. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-34156-4_4"},{"key":"20_CR2","unstructured":"Akl, S.G.: Parallel real-time computation: Sometimes quantity means quality. Computing and Informatics\u00a021, 455\u2013487 (2002)"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Kumar, V.: Special Issue on High-performance Data Mining. Academic Press (2001)","DOI":"10.1006\/jpdc.2000.1690"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Kargupta, H., Chan, P.: Advances in Distributed and Parallel Knowledge Discovery. AAAI\/MIT Press (2000)","DOI":"10.1145\/347090.347533"},{"key":"20_CR5","unstructured":"Zaki, M.J., Ho, C.-T. (eds.): KDD 1999. LNCS (LNAI), vol.\u00a01759. Springer, Heidelberg (2000)"},{"issue":"2","key":"20_CR6","first-page":"123","volume":"11","author":"M.J. Zaki","year":"2002","unstructured":"Zaki, M.J., Pan, Y.: Introduction: Recent developments in parallel and distributed data mining. DPD\u00a011(2), 123\u2013127 (2002)","journal-title":"DPD"},{"key":"20_CR7","unstructured":"Shafer, J., Agrawal, R., Mehta, M.: Sprint: A scalable parallel classifier for data mining. In: VLDB, pp. 544\u2013555 (1996)"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Ho, C.-T., Agrawal, R.: Parallel classification for data mining on shared-memory multiprocessors. In: ICDE, pp. 198\u2013205 (1999)","DOI":"10.1109\/ICDE.1999.754925"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Darlington, J., Guo, Y.-K., Sutiwaraphun, J., To, H.W.: Parallel induction algorithms for data mining. In: Liu, X., Cohen, P., Berthold, M. (eds.) IDA 1997. LNCS, vol.\u00a01280, pp. 437\u2013445. Springer, Heidelberg (1997)","DOI":"10.1007\/BFb0052860"},{"issue":"3","key":"20_CR10","first-page":"237","volume":"3","author":"A. Srivastava","year":"1999","unstructured":"Srivastava, A., Han, E.-H., Kumar, V., Singh, V.: Parallel formulations of decision-tree classification algorithms. DMKD\u00a03(3), 237\u2013261 (1999)","journal-title":"DMKD"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Kufrin, R.: Decision trees on parallel processors. In: PPAI, pp. 279\u2013306 (1995)","DOI":"10.1016\/S0923-0459(97)80014-6"},{"issue":"4","key":"20_CR12","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/4434.806975","volume":"7","author":"M.J. Zaki","year":"1999","unstructured":"Zaki, M.J.: Parallel and distributed association mining: a survey. IEEE Concurrency\u00a07(4), 14\u201325 (1999)","journal-title":"IEEE Concurrency"},{"issue":"8","key":"20_CR13","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1109\/34.709614","volume":"20","author":"D. Judd","year":"1998","unstructured":"Judd, D., McKinley, P.K., Jain, A.K.: Large-scale parallel data clustering. TPAMI\u00a020(8), 871\u2013876 (1998)","journal-title":"TPAMI"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Dhillon, I., Modha, D.: A data-clustering algorithm on distributed memory multiprocessors. In: Large-scale Parallel KDD Systems Workshop, ACM SIGKDD, pp. 245\u2013260 (2000)","DOI":"10.1007\/3-540-46502-2_13"},{"key":"20_CR15","first-page":"1313","volume":"21","author":"C.F. Olson","year":"1995","unstructured":"Olson, C.F.: Parallel algorithms for hierarchical clustering. JPC\u00a021, 1313\u20131325 (1995)","journal-title":"JPC"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Garg, A., Mangla, A., Gupta, N., Bhatnagar, V.: PBIRCH: A scalable parallel clustering algorithm for incremental data. In: IDEAS, pp. 315\u2013316 (2006)","DOI":"10.1109\/IDEAS.2006.36"},{"issue":"1","key":"20_CR17","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J. Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM\u00a051(1), 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Chu, C.-T., Kim, S.K., Lin, Y.-A., Yu, Y.Y., Bradski, G.R., Ng, A.Y., Olukotun, K.: Map-reduce for machine learning on multicore. In: NIPS, pp. 281\u2013288 (2006)","DOI":"10.7551\/mitpress\/7503.003.0040"},{"key":"20_CR19","unstructured":"Ma, Z., Gu, L.: The limitation of MapReduce: A probing case and a lightweight solution. In: Intl. Conf. on Cloud Computing, GRIDs, and Virtualization, pp. 68\u201373 (2010)"},{"issue":"2","key":"20_CR20","first-page":"123","volume":"24","author":"L. Breiman","year":"1996","unstructured":"Breiman, L.: Bagging predictors. JML\u00a024(2), 123\u2013140 (1996)","journal-title":"JML"},{"key":"20_CR21","first-page":"28","volume":"5","author":"R.E. Schapire","year":"1990","unstructured":"Schapire, R.E.: The strength of weak learnability. JML\u00a05, 28\u201333 (1990)","journal-title":"JML"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Breiman, L.: Random forests. JML\u00a045(1), 5\u201332 (2001)","DOI":"10.1023\/A:1010933404324"},{"key":"20_CR23","unstructured":"Talia, D.: Parallelism in knowledge discovery techniques. In: Fagerholm, J., Haataja, J., J\u00e4rvinen, J., Lyly, M., R\u00e5back, P., Savolainen, V. (eds.) PARA 2002. LNCS, vol.\u00a02367, pp. 127\u2013136. Springer, Heidelberg (2002)"},{"key":"20_CR24","unstructured":"Shell, P., Rubio, J.A.H., Barro, G.Q.: Improving search through diversity. In: AAAI (1994)"},{"key":"20_CR25","unstructured":"Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. IJCAI, 607\u2013615 (1995)"},{"issue":"1-2","key":"20_CR26","first-page":"19","volume":"39","author":"A. Felner","year":"2003","unstructured":"Felner, A., Kraus, S., Korf, R.E.: KBFS: K-best-first search. AMAI\u00a039(1-2), 19\u201339 (2003)","journal-title":"AMAI"},{"issue":"3","key":"20_CR27","first-page":"454","volume":"49","author":"B. Berger","year":"1994","unstructured":"Berger, B., Rompel, J., Shor, P.W.: Efficient nc algorithms for set cover with applications to learning and geometry. JCSS\u00a049(3), 454\u2013477 (1994)","journal-title":"JCSS"},{"key":"20_CR28","doi-asserted-by":"crossref","unstructured":"Blelloch, G.E., Peng, R., Tangwongsan, K.: Linear-work greedy parallel approximate set cover and variants. In: SPAA, pp. 23\u201332 (2011)","DOI":"10.1145\/1989493.1989497"},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. In: STOC, pp. 38\u201349 (1973)","DOI":"10.1145\/800125.804034"},{"issue":"11","key":"20_CR30","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"Beasley, J.E.: Or-library: Distributing test problems by electronic mail. The Journal of the Operational Research Society\u00a041(11), 1069\u20131072 (1990)","journal-title":"The Journal of the Operational Research Society"}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Data Analysis XII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41398-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T10:02:15Z","timestamp":1688551335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41398-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642413971","9783642413988"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41398-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}