{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T10:41:52Z","timestamp":1777372912805,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642341557","type":"print"},{"value":"9783642341564","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34156-4_4","type":"book-chapter","created":{"date-parts":[[2012,10,20]],"date-time":"2012-10-20T04:50:18Z","timestamp":1350708618000},"page":"23-34","source":"Crossref","is-referenced-by-count":11,"title":["Parallel Data Mining Revisited. Better, Not Faster"],"prefix":"10.1007","author":[{"given":"Zaenal","family":"Akbar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Violeta N.","family":"Ivanova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael R.","family":"Berthold","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/800125.804034","volume-title":"Proceedings of the Fifth Annual ACM Symposium on Theory of Computing, STOC 1973","author":"D.S. Johnson","year":"1973","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. In: Proceedings of the Fifth Annual ACM Symposium on Theory of Computing, STOC 1973, pp. 38\u201349. ACM, New York (1973)"},{"issue":"11","key":"4_CR3","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"},{"key":"4_CR4","unstructured":"Breiman, L., Friedman, J., Olshen, R., Stone, C.: Classification and Regression Trees. Wadsworth and Brooks, Monterey (1984)"},{"issue":"1","key":"4_CR5","first-page":"81","volume":"1","author":"J.R. Quinlan","year":"1986","unstructured":"Quinlan, J.R.: Induction of Decision Trees. Machine Learning\u00a01(1), 81\u2013106 (1986)","journal-title":"Machine Learning"},{"key":"4_CR6","unstructured":"Quinlan, J.R.: C4.5: programs for machine learning. Morgan Kaufmann Publishers Inc., San Francisco (1993)"},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L. Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Machine Learning\u00a045(1), 5\u201332 (2001)","journal-title":"Machine Learning"},{"key":"4_CR8","unstructured":"Quinlan, J.R., Cameron-Jones, R.M.: Oversearching and layered search in empirical learning. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence, vol.\u00a02, pp. 1019\u20131024 (1995)"},{"key":"4_CR9","unstructured":"Murthy, S., Salzberg, S.: Lookahead and pathology in decision tree induction. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence, vol.\u00a02, pp. 1025\u20131031 (1995)"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Iba, W., Langley, P.: Induction of one-level decision trees. In: Proceedings of the Ninth International Workshop on Machine Learning, pp. 233\u2013240 (1992)","DOI":"10.1016\/B978-1-55860-247-2.50035-8"},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1994.1001","volume":"16","author":"U. Sarkar","year":"1994","unstructured":"Sarkar, U., Chakrabarti, P., Ghose, S., Desarkar, S.: Improving Greedy Algorithms by Lookahead-Search. Journal of Algorithms\u00a016(1), 1\u201323 (1994)","journal-title":"Journal of Algorithms"},{"key":"4_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-540-39592-8_63","volume-title":"Foundations of Intelligent Systems","author":"T. Elomaa","year":"2003","unstructured":"Elomaa, T., Malinen, T.: On Lookahead Heuristics in Decision Tree Learning. In: Zhong, N., Ra\u015b, Z.W., Tsumoto, S., Suzuki, E. (eds.) ISMIS 2003. LNCS (LNAI), vol.\u00a02871, pp. 445\u2013453. Springer, Heidelberg (2003)"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/1015330.1015373","volume-title":"Twenty-First International Conference on Machine Learning, ICML 2004","author":"S. Esmeir","year":"2004","unstructured":"Esmeir, S., Markovitch, S.: Lookahead-based algorithms for anytime induction of decision trees. In: Twenty-First International Conference on Machine Learning, ICML 2004, pp. 33\u201340. ACM Press, New York (2004)"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/177424.178029","volume-title":"Proceedings of the Tenth Annual Symposium on Computational Geometry, SCG 1994","author":"H. Br\u00f6nnimann","year":"1994","unstructured":"Br\u00f6nnimann, H., Goodrich, M.T.: Almost optimal set covers in finite vc-dimension (preliminary version). In: Proceedings of the Tenth Annual Symposium on Computational Geometry, SCG 1994, pp. 293\u2013302. ACM, New York (1994)"},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1016\/S0022-0000(05)80068-6","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. Journal of Computer and System Sciences\u00a049(3), 454\u2013477 (1994)","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR16","first-page":"23","volume-title":"Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2011","author":"G.E. Blelloch","year":"2011","unstructured":"Blelloch, G.E., Peng, R., Tangwongsan, K.: Linear-work greedy parallel approximate set cover and variants. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2011, pp. 23\u201332. ACM, New York (2011)"}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Data Analysis XI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34156-4_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:46:27Z","timestamp":1620132387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34156-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341557","9783642341564"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34156-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}