{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T18:00:38Z","timestamp":1772820038254,"version":"3.50.1"},"reference-count":137,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,1,13]],"date-time":"2012-01-13T00:00:00Z","timestamp":1326412800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Prog Artif Intell"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s13748-011-0004-4","type":"journal-article","created":{"date-parts":[[2012,1,16]],"date-time":"2012-01-16T12:18:19Z","timestamp":1326716299000},"page":"71-87","source":"Crossref","is-referenced-by-count":28,"title":["Scaling up data mining algorithms: review and taxonomy"],"prefix":"10.1007","volume":"1","author":[{"given":"Nicol\u00e1s","family":"Garc\u00eda-Pedrajas","sequence":"first","affiliation":[]},{"given":"Aida","family":"de Haro-Garc\u00eda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,1,13]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","first-page":"1362","DOI":"10.1006\/jpdc.2002.1851","volume":"62","author":"E. Alba","year":"2002","unstructured":"Alba E., Nebro A.J., Troya J.M.: Heterogeneous computing and parallel genetic algorithms. J. Parallel Distrib. Comput. 62, 1362\u20131385 (2002)","journal-title":"J. Parallel Distrib. Comput."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Aldinucci, M., Ruggieri, S., Torquati, M.: Porting decision tree algorithms to multicore using fastflow. In: Balc\u00e1zar, J.L. Bonchi, F., Gionis, A., Sebag, M. (eds.) Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases ECML PKDD, Lecture Notes in Computer Science, vol. 6321, pp. 7\u201323 (2010)","DOI":"10.1007\/978-3-642-15880-3_7"},{"key":"4_CR3","unstructured":"Anderson, P.G., Arney, J.S., Inverso, S.A., Kunkle, D.R., Lebo, T., Merrigan, C.: Good halftone masks via genetic algorithms. In: Proceedings of the 2003 Western New York Image Processing Workshop (2003)"},{"key":"4_CR4","volume-title":"Clustering for data reduction: A divide and conquer approach","author":"N.O. Andrews","year":"2007","unstructured":"Andrews N.O., Fox E.A.: Clustering for data reduction: A divide and conquer approach. Technical Report, Virginia Tech (2007)"},{"key":"4_CR5","unstructured":"Aronis, J., Provost, F.: Increasing the efficiency of data mining algorithms with breadth-first marker propagation. In: Proceedings of the Third International Conference on Knowledge Discovery and Data Mining, pp. 119\u2013122. AAAI Press, Menlo Park (1997)"},{"issue":"9","key":"4_CR6","doi-asserted-by":"crossref","first-page":"994","DOI":"10.1016\/j.jpdc.2005.03.011","volume":"65","author":"D.A. Bader","year":"2005","unstructured":"Bader D.A., Cong G.: A fast, parallel spanning tree algorithm for symmetric multiprocessors (smps). J. Parallel Distrib. Comput. 65(9), 994\u20131006 (2005)","journal-title":"J. Parallel Distrib. Comput."},{"key":"4_CR7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1080\/15501320601067881","volume":"3","author":"L. Barolli","year":"2007","unstructured":"Barolli L., Ikeda M., de Marco G., Durresi A., Koyama A., Iwashige J.: A search space reduction algorithm for improving the performance of a ga-based qos routing method in ad-hoc networks. Int. J. Distrib. Sens. Netw. 3, 41\u201357 (2007)","journal-title":"Int. J. Distrib. Sens. Netw."},{"issue":"1\/2","key":"4_CR8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1023\/A:1007515423169","volume":"36","author":"E. Bauer","year":"1999","unstructured":"Bauer E., Kohavi R.: An empirical comparison of voting classification algorithms: Bagging, boosting, and variants. Mach. Learn. 36(1\/2), 105\u2013142 (1999)","journal-title":"Mach. Learn."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Bengtsson, T., Bickel, P., Li, B.: Curse-of-dimensionality revisited: Collapse of the particle filter in very large scale systems. In: Probability and Statistics: Essays in Honor of David A. Freedman, IMS Collections, vol. 2, pp. 316\u2013334. Institute of Mathematical Statistics (2008)","DOI":"10.1214\/193940307000000518"},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0196-6774(80)90004-8","volume":"1","author":"J.L. Bentley","year":"1980","unstructured":"Bentley J.L.: Parallel algorithm for constructing minimum spanning trees. J. Algorithms 1, 51\u201359 (1980)","journal-title":"J. Algorithms"},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"1254","DOI":"10.1057\/palgrave.jors.2601635","volume":"54","author":"J. Berger","year":"2003","unstructured":"Berger J., Barkaoui M.: A new hybrid genetic algorithm for the capacitated vehicle routing problem. J. Oper. Res. Soc. 54, 1254\u20131262 (2003)","journal-title":"J. Oper. Res. Soc."},{"key":"4_CR12","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1093\/nar\/28.1.235","volume":"28","author":"H.M. Berman","year":"2000","unstructured":"Berman H.M., Westbrook J., Feng Z., Gilliland G., Bhat T.N., Weissig H., Shindyalov I., Bourne P.E.: The protein data bank. Nucleic Acids Res. 28, 235\u2013242 (2000)","journal-title":"Nucleic Acids Res."},{"key":"4_CR13","first-page":"1367","volume":"10","author":"M. Boull\u00e9","year":"2009","unstructured":"Boull\u00e9 M.: A parameter-free classification method for large scale learning. J. Mach. Learn. Res. 10, 1367\u20131385 (2009)","journal-title":"J. Mach. Learn. Res."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Brain, D., Webb, G.I.: The need for low bias algorithms in classification learning from large data sets. In: Proceedings of the 16th European Conference Principles of Data Mining and Knowledge Discovery (PKDD\u20192002), Lecture Notes in Artificial Intelligence, vol. 2431, pp. 62\u201373. Springer Verlag, New York (2002)","DOI":"10.1007\/3-540-45681-3_6"},{"issue":"1\u20132","key":"4_CR15","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1023\/A:1007563306331","volume":"36","author":"L. Breiman","year":"1999","unstructured":"Breiman L.: Pasting small votes for classification in large databases and on-line. Mach. Learn. 36(1\u20132), 85\u2013103 (1999)","journal-title":"Mach. Learn."},{"key":"4_CR16","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1016\/j.sbi.2004.05.007","volume":"14","author":"M.R. Brent","year":"2004","unstructured":"Brent M.R., Guig\u00f3 R.: Recent advances in gene structure prediction. Curr. Opin. Struct. Biol. 14, 264\u2013272 (2004)","journal-title":"Curr. Opin. Struct. Biol."},{"issue":"2","key":"4_CR17","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1109\/72.125874","volume":"3","author":"F.Z. Brill","year":"1992","unstructured":"Brill F.Z., Brown D.E., Martin W.N.: Fast genetic selection of features for neural networks classifiers. IEEE Trans. Neural Netw. 3(2), 324\u2013334 (1992)","journal-title":"IEEE Trans. Neural Netw."},{"key":"4_CR18","unstructured":"Brugger, S.T., Kelley, M., Sumikawa, K., Wakumoto, S.: Data mining for security information: A survey. In: Proceedings of the 8th Association for Computing Machinery Conference on Computer and Communications Security (2001)"},{"issue":"7","key":"4_CR19","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1016\/j.patrec.2004.09.043","volume":"26","author":"J.R. Cano","year":"2005","unstructured":"Cano J.R., Herrera F., Lozano M.: Stratification for scaling up evolutionary prototype selection. Pattern Recognit. Lett. 26(7), 953\u2013963 (2005)","journal-title":"Pattern Recognit. Lett."},{"key":"4_CR20","first-page":"141","volume":"10","author":"E. Cant\u00fa-Paz","year":"1997","unstructured":"Cant\u00fa-Paz E.: A survey of parallel genetic algorithms. Calc. Paralleles 10, 141\u2013171 (1997)","journal-title":"Calc. Paralleles"},{"key":"4_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4369-5","volume-title":"Efficient and Accurate Parallel Genetic Algorithms","author":"E. Cant\u00fa-Paz","year":"2001","unstructured":"Cant\u00fa-Paz E.: Efficient and Accurate Parallel Genetic Algorithms. Kluwer Academic Publisher, Dordrecht (2001)"},{"key":"4_CR22","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/S0893-6080(03)00020-0","volume":"16","author":"E. Cant\u00fa-Paz","year":"2003","unstructured":"Cant\u00fa-Paz E., Kamath C.: Evolving neural networks to identify bent-double galaxies in the first survey. Neural Netw. 16, 507\u2013517 (2003)","journal-title":"Neural Netw."},{"key":"4_CR23","unstructured":"Chang, E.Y., Zhu, K., Wang, H., Bai, H., Li, J., Qiu, Z.: Psvm: Parallelizing support vector machines on distributed computers. In: Advances in Neural Information Processing Systems vol. 20, pp. 329\u2013340 (2007)"},{"key":"4_CR24","first-page":"2855","volume":"11","author":"F. Chang","year":"2010","unstructured":"Chang F., Guo C.Y., Lin X.R., Lu C.J.: Tree decomposition for large-scale SVM problems. J. Mach. Learn. Res. 11, 2855\u20132892 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"4_CR25","unstructured":"Chattratichat, J., Darlington, J., Ghanem, M., Guo, Y., H\u00fcning, H., K\u00f6hler, M., Sutiwaraphun, J., To, H.W., Yang, D.: Large scale data mining: challenges and responses. In: Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining, pp. 143\u2013146 (1997)"},{"key":"4_CR26","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1613\/jair.953","volume":"16","author":"N.V. Chawla","year":"2002","unstructured":"Chawla N.V., Bowyer K.W., Hall L.O., Kegelmeyer W.P.: SMOTE: Synthetic minority over-sampling technique. J. Artif. Intell. Res. 16, 321\u2013357 (2002)","journal-title":"J. Artif. Intell. Res."},{"key":"4_CR27","first-page":"421","volume":"5","author":"N.W. Chawla","year":"2004","unstructured":"Chawla N.W., Hall L.O., Bowyer K.W., Kegelmeyer W.P.: Learning ensembles from bites: A scalable and accurate approach. J. Mach. Learn. Res. 5, 421\u2013451 (2004)","journal-title":"J. Mach. Learn. Res."},{"key":"4_CR28","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1162\/089976602753633402","volume":"14","author":"R. Collobert","year":"2002","unstructured":"Collobert R., Bengio S., Bengio Y.: A parallel mixture of SVMs for very large scale problems. Neural Comput. 14, 1105\u20131114 (2002)","journal-title":"Neural Comput."},{"key":"4_CR29","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.ijar.2003.07.010","volume":"34","author":"O. Cord\u00f3n","year":"2003","unstructured":"Cord\u00f3n O., Herrera-Viedma E., L\u00f3pez-Pujalte C., Luque M., Zarco C.: A review on the application of evolutionary computation to information retrieval. Int. J. Approx. Reason. 34, 241\u2013264 (2003)","journal-title":"Int. J. Approx. Reason."},{"issue":"1\u20132","key":"4_CR30","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0004-3702(00)00004-7","volume":"118","author":"M. Craven","year":"2000","unstructured":"Craven M., DiPasquoa D., Freitagb D., McCalluma A., Mitchella T., Nigama K., Slatterya S.: Learning to construct knowledge bases from the world wide web. Artif. Intell. 118(1\u20132), 69\u2013113 (2000)","journal-title":"Artif. Intell."},{"issue":"1","key":"4_CR31","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0167-739X(93)90024-J","volume":"9","author":"J. Cui","year":"1993","unstructured":"Cui J., Fogarty T.C., Gammack J.G.: Searching databases using parallel genetic algorithms on a transputer computing surface. Future Gener. Comput. Syst. 9(1), 33\u201340 (1993)","journal-title":"Future Gener. Comput. Syst."},{"issue":"1","key":"4_CR32","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1145\/1629175.1629198","volume":"53","author":"J. Dean","year":"2010","unstructured":"Dean J., Ghemawat S.: Mapreduce: A flexible data processing tool. Commun. ACM 53(1), 72\u201377 (2010)","journal-title":"Commun. ACM"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"de Haro-Garc\u00eda, A., Garc\u00eda-Pedrajas, N.: Scaling up feature selection by means of pseudoensembles of feature selectors. IEEE Trans. Pattern Anal. Mach. Intell. (2011) (submitted)","DOI":"10.1007\/978-3-642-13025-0_68"},{"key":"4_CR34","unstructured":"de Haro-Garc\u00eda, A., Kuncheva, L., Garc\u00eda-Pedrajas, N.: Random splitting for cascade feature selection. Technical Report, University or C\u00f3rdoba (2011)"},{"issue":"3","key":"4_CR35","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/s10618-008-0121-2","volume":"18","author":"A. Haro-Garc\u00eda de","year":"2009","unstructured":"de Haro-Garc\u00eda A., Pedrajas N.G.: A divide-and-conquer recursive approach for scaling up instance selection algorithms. Data Min. Knowl. Discov. 18(3), 392\u2013418 (2009)","journal-title":"Data Min. Knowl. Discov."},{"issue":"2","key":"4_CR36","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1021\/ci950106r","volume":"36","author":"C.A. Carpio del","year":"1996","unstructured":"del Carpio C.A.: A parallel genetic algorithm for polypeptide three dimensional structure prediction. a transputer implementation. J. Chem. Inf. Comput. Sci. 36(2), 258\u2013269 (1996)","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"4_CR37","doi-asserted-by":"crossref","unstructured":"Dementiev, R., Sanders, P., Schultes, D.: Engineering an eternal memory minimum spanning tree algorithm. In: Proceedings of the Third IFIP International Conference on Theoretical Computer Science (TCS\u201904), pp. 195\u2013208 (2004)","DOI":"10.1007\/1-4020-8141-3_17"},{"key":"4_CR38","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s12293-010-0048-1","volume":"2","author":"J. Derrac","year":"2010","unstructured":"Derrac J., Garc\u00eda S., Herrera F.: Stratified prototype selection based on a steady-state memetic algorithm: a study of scalability. Memet. Comput. 2, 183\u2013189 (2010)","journal-title":"Memet. Comput."},{"key":"4_CR39","unstructured":"Domingos, P., Hulten, G.: A general method for scaling up machine learning algorithms and its application to clustering. In: Proceedings of the Eighteenth International Conference on Machine Learning, pp. 106\u2013113. Morgan Kaufmann (2001)"},{"key":"4_CR40","doi-asserted-by":"crossref","unstructured":"Domingos, P., Hulten, G.: Learning from infinite data in finite time. In: Proceedings of Advances in Neural Information Systems, vol. 14, pp. 673\u2013680. Vancouver, Canada (2001)","DOI":"10.7551\/mitpress\/1120.003.0091"},{"issue":"4","key":"4_CR41","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1198\/1061860032544","volume":"12","author":"P. Domingos","year":"2003","unstructured":"Domingos P., Hulten G.: A general framework for mining massive data streams. J. Comput. Graph. Stat. 12(4), 945\u2013949 (2003)","journal-title":"J. Comput. Graph. Stat."},{"key":"4_CR42","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1016\/j.parco.2005.01.001","volume":"31","author":"Z. Du","year":"2005","unstructured":"Du Z., Lin F.: A novel approach for hierarchical clustering. Parallel Comput. 31, 523\u2013527 (2005)","journal-title":"Parallel Comput."},{"key":"4_CR43","doi-asserted-by":"crossref","unstructured":"Eggermont, J., Kok, J.N., Kosters, W.A.: Genetic programming for data classification: Refining the search space. In: Proceedings of the 2004 ACM symposium on Applied computing. ACM Press, New York (2004)","DOI":"10.1145\/967900.968104"},{"key":"4_CR44","doi-asserted-by":"crossref","unstructured":"Eitrich, T., Lang, B.: Data mining with parallel support vector machines for classification. In: Yakhno, T., Neuhold, E. (eds.) Proceedings of the Fourth Biennial International Conference on Advances in Information Systems, Lectures Notes in Computer Science, vol. 4243, pp. 197\u2013206 (2006)","DOI":"10.1007\/11890393_21"},{"key":"4_CR45","doi-asserted-by":"crossref","unstructured":"Fan, W., Stolfo, S., Zhang, J.: The application of Adaboost for distributed, scalable and on-line learning. In: Proceedings of the Fifth ACD SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 362\u2013366. San Diego, CA, USA (1999)","DOI":"10.1145\/312129.312283"},{"issue":"8","key":"4_CR46","doi-asserted-by":"crossref","first-page":"904","DOI":"10.1109\/TMI.2002.803126","volume":"21","author":"Y. Fan","year":"2002","unstructured":"Fan Y., Jiang T., Evans D.J.: Volumetric segmentation of brain images using parallel genetic algorithms. IEEE Trans. Med. Imaging 21(8), 904\u2013909 (2002)","journal-title":"IEEE Trans. Med. Imaging"},{"issue":"3, 4","key":"4_CR47","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1080\/09540099308915705","volume":"5","author":"J. Fletcher","year":"1993","unstructured":"Fletcher J., Obradovic Z.: Combining prior symbolic knowledge and constructive neural networks. Connect. Sci. 5(3, 4), 365\u2013375 (1993)","journal-title":"Connect. Sci."},{"key":"4_CR48","doi-asserted-by":"crossref","unstructured":"Flores, J.J., Rodr\u00edguez, H., Graff, M.: Reducing the search space in evolutive design of arima and ann models for time series prediction. In: Proceedings of the 9th Mexican International Conference on Artificial Intelligence, Lecture Notes in Computer Science, vol. 6438, pp. 325\u2013336 (2010)","DOI":"10.1007\/978-3-642-16773-7_28"},{"key":"4_CR49","unstructured":"Freitas, A.A.: A Survey of Parallel Data Mining. In: Arner, H.F., Mackin, N. (eds.) Proceedings of the 2nd International Conference on the Practical Applications of Knowledge Discovery and Data Mining, pp. 287\u2013300. The Practical Application Company (1998)"},{"key":"4_CR50","doi-asserted-by":"crossref","first-page":"2693","DOI":"10.1016\/j.patcog.2008.02.006","volume":"41","author":"S. Garc\u00eda","year":"2008","unstructured":"Garc\u00eda S., Cano J.R., Herrera F.: A memetic algorithm for evolutionary prototype selection: A scaling up approach. Pattern Recognit. 41, 2693\u20132709 (2008)","journal-title":"Pattern Recognit."},{"key":"4_CR51","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1016\/j.artint.2010.01.001","volume":"174","author":"C. Garc\u00eda-Osorio","year":"2010","unstructured":"Garc\u00eda-Osorio C., de Haro-Garc\u00eda A., Garc\u00eda-Pedrajas N.: Democratic instance selection: a linear complexity instance selection algorithm based on classifier ensemble concepts. Artif. Intell. 174, 410\u2013441 (2010)","journal-title":"Artif. Intell."},{"key":"4_CR52","doi-asserted-by":"crossref","first-page":"1741","DOI":"10.1016\/j.patcog.2008.12.023","volume":"42","author":"N. Garc\u00eda-Pedrajas","year":"2009","unstructured":"Garc\u00eda-Pedrajas N.: Supervised projection approach for boosting classifiers. Pattern Recognit. 42, 1741\u20131760 (2009)","journal-title":"Pattern Recognit."},{"key":"4_CR53","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s10994-009-5161-3","volume":"78","author":"N. Garc\u00eda-Pedrajas","year":"2010","unstructured":"Garc\u00eda-Pedrajas N., del Castillo J.A.R., Ortiz-Boyer D.: A cooperative coevolutionary algorithm for instance selection for instance-based learning. Mach. Learn. 78, 381\u2013420 (2010)","journal-title":"Mach. Learn."},{"issue":"3","key":"4_CR54","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1109\/TNN.2003.810618","volume":"14","author":"N. Garc\u00eda-Pedrajas","year":"2003","unstructured":"Garc\u00eda-Pedrajas N., Herv\u00e1s-Mart\u00ednez C., Mu\u00f1oz-P\u00e9rez J.: Covnet: A cooperative coevolutionary model for evolving artificial neural networks. IEEE Trans. Neural Netw. 14(3), 575\u2013596 (2003)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"3","key":"4_CR55","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1109\/TEVC.2005.844158","volume":"9","author":"N. Garc\u00eda-Pedrajas","year":"2005","unstructured":"Garc\u00eda-Pedrajas N., Herv\u00e1s-Mart\u00ednez C., Ortiz-Boyer D.: Cooperative coevolution of artificial neural network ensembles for pattern classification. IEEE Trans. Evol. Comput. 9(3), 271\u2013302 (2005)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"4_CR56","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.patcog.2006.06.024","volume":"40","author":"N. Garc\u00eda-Pedrajas","year":"2007","unstructured":"Garc\u00eda-Pedrajas N., Ortiz-Boyer D.: A cooperative constructive method for neural networks for pattern recognition. Pattern Recognit. 40(1), 80\u201399 (2007)","journal-title":"Pattern Recognit."},{"key":"4_CR57","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.knosys.2011.05.002","volume":"25","author":"N. Garc\u00eda-Pedrajas","year":"2012","unstructured":"Garc\u00eda-Pedrajas N., P\u00e9rez-Rodr\u00edguez J., Garc\u00eda-Pedrajas M.D., Ortiz-Boyer D., Fyfe C.: Class imbalance methods for translation initiation site recognition in dna sequences. Knowl. Based Syst. 25, 22\u201334 (2012)","journal-title":"Knowl. Based Syst."},{"key":"4_CR58","unstructured":"Graf, H.P., Cosatto, E., Bottou, L., Dourdanovic, I., Vapnik, V.: Parallel support vector machines: the cascade svm. In: Saul, L.K., Weiss, Y., Bottou, L. (eds.) Neural Information Processing Systems, vol. 17, pp. 521\u2013528 (2004)"},{"key":"4_CR59","unstructured":"Graf, H.P., Cosatto, E., Bottou, L., Durdanovic, I., Vapnik, V.: Parallel support vector machines: The cascade SVM. In: Advances in Neural Information Processing Systems, pp. 521\u2013528. MIT Press, Cambridge (2005)"},{"key":"4_CR60","unstructured":"Griffin, J.D.: Methods for reducing search and evaluating fitness functions in genetic algorithms for the snake-in-the-box problem. Ph.D. thesis, The University of Georgia (2009)"},{"key":"4_CR61","first-page":"1157","volume":"3","author":"I. Guyon","year":"2003","unstructured":"Guyon I., Elisseeff A.: An introduction to variable and feature selection. J. Mach. Learn. Res. 3, 1157\u20131182 (2003)","journal-title":"J. Mach. Learn. Res."},{"key":"4_CR62","unstructured":"Holte, R., Acker, L., Porterm, B.: Concept learning and the problem of small disjuncts. In: Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pp. 813\u2013818. Morgan Kaufmann (2002)"},{"key":"4_CR63","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.patrec.2005.07.009","volume":"27","author":"J.H. Hong","year":"2006","unstructured":"Hong J.H., Cho S.B.: Efficient huge-scale feature selection with speciated genetic algorithm. Pattern Recognit. Lett. 27, 143\u2013150 (2006)","journal-title":"Pattern Recognit. Lett."},{"key":"4_CR64","doi-asserted-by":"crossref","first-page":"13","DOI":"10.2307\/2282952","volume":"58","author":"W. Howffding","year":"1963","unstructured":"Howffding W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58, 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"4_CR65","doi-asserted-by":"crossref","unstructured":"Huang, D.W., Lin, J.: Scaling populations of a genetic algorithm for job shop scheduling problems using mapreduce. In: Proceedings of the 2010 IEEE Second International Conference on Cloud Computing Technology and Science, pp. 780\u2013785 (2010)","DOI":"10.1109\/CloudCom.2010.18"},{"key":"4_CR66","unstructured":"Huber, P.: From large to huge: A statistician\u2019s reaction to kdd and dm. In: Proceedings of the Third International Conference on Knowledge Discovery and Data Mining, pp. 304\u2013308. AAAI Press (1997)"},{"key":"4_CR67","doi-asserted-by":"crossref","unstructured":"Hulten, G., Domingos, P.: Mining complex models from arbitrarily large databases in constant time. In: Proceedings of the International Conference on Knowledge Discovery and Data Mining, pp. 525\u2013531. Edmonton, Canada (2002)","DOI":"10.1145\/775107.775124"},{"key":"4_CR68","doi-asserted-by":"crossref","first-page":"20","DOI":"10.2174\/1874061801004010020","volume":"4","author":"W.J. Hwang","year":"2010","unstructured":"Hwang W.J., Ou C.M., Hung P.C., Yang C.Y., Yu T.H.: An efficient distributed genetic algorithm architecture for vector quantizer design. Open Artif. Intell. J. 4, 20\u201329 (2010)","journal-title":"Open Artif. Intell. J."},{"issue":"4","key":"4_CR69","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1109\/TNN.2003.813832","volume":"14","author":"M.M. Islam","year":"2003","unstructured":"Islam M.M., Yao X., Murase K.: A constructive algorithm for training cooperative neural network ensembles. IEEE Trans. Neural Netw. 14(4), 820\u2013834 (2003)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"1","key":"4_CR70","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1109\/TKDE.2005.18","volume":"17","author":"R. Jin","year":"2005","unstructured":"Jin R., Yang G., Agrawal G.: Shared memory parallelization of data mining algorithms: Techniques, programming interface, and performance. IEEE Trans. Knowl. Data Eng. 17(1), 71\u201389 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"4_CR71","doi-asserted-by":"crossref","unstructured":"Johnson, D.B., Metaxas, P.: A parallel algorithm for computing minimum spanning trees. In: Proceedings of the Fourth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA\u201992), pp. 363\u2013372 (1992)","DOI":"10.1145\/140901.141917"},{"issue":"8","key":"4_CR72","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. IEEE Trans. Pattern Anal. Mach. Intell. 20(8), 871\u2013876 (1998)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"4_CR73","first-page":"144","volume":"4","author":"K. Kerdprasop","year":"2010","unstructured":"Kerdprasop K., Kerdprasop N.: A lightweight method to parallel k-means clustering. Int. J. Math. Comput. Simul. 4, 144\u2013153 (2010)","journal-title":"Int. J. Math. Comput. Simul."},{"key":"4_CR74","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1997","unstructured":"Knuth D.E.: The Art of Computer Programming. Addison- Wesley, Reading (1997)"},{"key":"4_CR75","doi-asserted-by":"crossref","unstructured":"Kononova, A.V., Ingham, D.B., Pourkashanian, M.: Simple scheduled memetic algorithm for inverse problems in higher dimensions: application to chemical kinetics. In: Proceedings of the IEEE world congress on computational intelligence CEC\u20192008, pp. 3906\u20133913. IEEE Press (2008)","DOI":"10.1109\/CEC.2008.4631328"},{"key":"4_CR76","first-page":"1048","volume":"2","author":"B. Kumari","year":"2011","unstructured":"Kumari B., Swarnkar T.: Filter versus wrapper feature subset selection in large dimensionality micro array: A review. Int. J. Comput. Sci. Inf. Technol. 2, 1048\u20131053 (2011)","journal-title":"Int. J. Comput. Sci. Inf. Technol."},{"issue":"2","key":"4_CR77","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1023\/A:1006529012972","volume":"13","author":"P. Larra\u00f1aga","year":"1999","unstructured":"Larra\u00f1aga P., Kuijpers C.M.H., Murga R.H., Inza I., Dizdarevic S.: Genetic algorithms for the traveling salesman problem: A review of representations and operators. Artif. Intell. Rev. 13(2), 129\u2013170 (1999)","journal-title":"Artif. Intell. Rev."},{"key":"4_CR78","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1023\/A:1013992203485","volume":"11","author":"A. Lazarevic","year":"2002","unstructured":"Lazarevic A., Obradovic Z.: Boosting algorithms for parallel and distributed learning. Distrib. Parallel Databases 11, 203\u2013229 (2002)","journal-title":"Distrib. Parallel Databases"},{"key":"4_CR79","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1109\/MC.2002.999772","volume":"35","author":"N. Leavitt","year":"2002","unstructured":"Leavitt N.: Data mining for the corporate masses?. Computer 35, 22\u201324 (2002)","journal-title":"Computer"},{"key":"4_CR80","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0167-8191(89)90036-7","volume":"11","author":"X. Li","year":"1989","unstructured":"Li X., Fang Z.: Parallel clustering algorithms. Parallel Comput. 11, 275\u2013290 (1989)","journal-title":"Parallel Comput."},{"key":"4_CR81","doi-asserted-by":"crossref","unstructured":"Li, X., Yao, X.: Tackling high dimensional nonseparable optimization problems by cooperatively coevolving particle swarms. In: Proceedings of the IEEE Congress on Eevolutionary Computation CEC\u20192009, pp. 1546\u20131556 (2009)","DOI":"10.1109\/CEC.2009.4983126"},{"key":"4_CR82","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1016\/j.future.2006.10.008","volume":"23","author":"D. Lim","year":"2007","unstructured":"Lim D., Ong Y.S., Jin Y., Sendhoff B., Lee B.S.: Efficient hierarchical parallel genetic algorithms using grid computing. Future Gener. Comput. Syst. 23, 658\u2013670 (2007)","journal-title":"Future Gener. Comput. Syst."},{"key":"4_CR83","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s11227-006-0002-7","volume":"39","author":"Y. Lin","year":"2007","unstructured":"Lin Y., Chung S.M.: Parallel bisecting k-means with prediction clustering algorithm. J. Supercomput. 39, 19\u201337 (2007)","journal-title":"J. Supercomput."},{"issue":"7","key":"4_CR84","doi-asserted-by":"crossref","first-page":"1119","DOI":"10.1016\/j.future.2003.11.024","volume":"20","author":"Z. Liu","year":"2004","unstructured":"Liu Z., Liu A., Wang C., Niu Z.: Evolving neural networks using real coded genetic algorithm (ga) for multispectral image classification. Future Gener. Comput. Syst. 20(7), 1119\u20131129 (2004)","journal-title":"Future Gener. Comput. Syst."},{"key":"4_CR85","first-page":"419","volume":"2","author":"H. Lodhi","year":"2002","unstructured":"Lodhi H., Saunders C., Shawe-Taylor J., Christiani N., Watkins C.: Text classification using string kernels. J. Mach. Learn. Res. 2, 419\u2013444 (2002)","journal-title":"J. Mach. Learn. Res."},{"key":"4_CR86","unstructured":"Lu, C.T., Boedihardjo, A.P., Manalwar, P.: Exploiting efficient data mining techniques to enhance intrusion detection systems. In: Proceedings of the 2005 IEEE International Conference on Information Reuse and Integration (IEEE IRI-2005 Knowledge Acquisition and Management), pp. 512\u2013517 (2005)"},{"issue":"2","key":"4_CR87","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s10115-007-0082-6","volume":"14","author":"Y. Lu","year":"2008","unstructured":"Lu Y., Roychowdhury V.: Parallel randomized sampling for support vector machine (SVM) and support vector regression (SVR). Knowl. Inf. Syst. 14(2), 233\u2013247 (2008)","journal-title":"Knowl. Inf. Syst."},{"issue":"7","key":"4_CR88","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1109\/TNN.2007.2000061","volume":"19","author":"Y. Lu","year":"2008","unstructured":"Lu Y., Roychowdhury V., Vandenberghe L.: Distributed parallel support vector machines in strongly connected networks. IEEE Trans. Neural Netw. 19(7), 1167\u20131178 (2008)","journal-title":"IEEE Trans. Neural Netw."},{"key":"4_CR89","doi-asserted-by":"crossref","unstructured":"Marchiori, E., Steenbeek, A.: An evolutionary algorithm for large scale set covering problems with application to airline crew scheduling, pp. 367\u2013381. Lecture Notes in Computer Science. Springer, Berlin (2000)","DOI":"10.1007\/3-540-45561-2_36"},{"key":"4_CR90","unstructured":"Moore, A.: Very fast em-based mixture model clustering using multiresolution kd-trees. In: Kearns, M., Cohn, D. (eds.) Advances in Neural Information Processing Systems, pp. 543\u2013549. Morgan Kaufman (1999)"},{"key":"4_CR91","first-page":"11","volume":"22","author":"D.E. Moriarty","year":"1996","unstructured":"Moriarty D.E., Miikkulainen R.: Efficient reinforcement learning through symbiotic evolution. Mach. Learn. 22, 11\u201332 (1996)","journal-title":"Mach. Learn."},{"key":"4_CR92","doi-asserted-by":"crossref","unstructured":"Moser, A., Murty, M.N.: On the scalability of genetic algorithms to very large-scale feature selection. In: Proceedings of EvoWorkshops 2000, Lecture Notes in Computer Science, vol. 1603, pp. 77\u201386. Springer-Verlag, New York (2000)","DOI":"10.1007\/3-540-45561-2_8"},{"key":"4_CR93","doi-asserted-by":"crossref","unstructured":"Murtagh, F.: Clustering in massive data sets. In: Handbook of Massive Data Sets, pp. 501\u2013543. Kluwer Academic Publishers, Dordrecht (2002)","DOI":"10.1007\/978-1-4615-0005-6_14"},{"issue":"3","key":"4_CR94","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s11047-006-9004-x","volume":"5","author":"F. Neumann","year":"2006","unstructured":"Neumann F., Wegener I.: Minimum spanning trees made easier. Nat. Comput. 5(3), 305\u2013319 (2006)","journal-title":"Nat. Comput."},{"key":"4_CR95","unstructured":"Nopiah, Z.M., Khairir, M.I., Abdullah, S., Baharin, M.N., Airfin, A.: Time complexity analysis of the genetic algorithm clustering method. In: Proceedings of the 9th WSEAS international conference on Signal processing, robotics and automation, pp. 171\u2013176 (2010)"},{"key":"4_CR96","doi-asserted-by":"crossref","unstructured":"Nowostawski, M., Poli, R.: Parallel genetic algorithm taxonomy. In: Proceedings of the Third International Conference on Knowledge-Based Intelligent Information Engineering Systems, pp. 88\u201392 (1999)","DOI":"10.1109\/KES.1999.820127"},{"key":"4_CR97","unstructured":"Obradovic, Z., Rangarajan, S.: Constructive neural networks design using genetic optimization, pp. 133\u2013146. No. 15 in Mathematics and Informatics. University of Nis (2000)"},{"issue":"1","key":"4_CR98","first-page":"100","volume":"4","author":"P.S. Oliveto","year":"2007","unstructured":"Oliveto P.S., He J., Yao X.: Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results. Int. J. Autom. Comput. 4(1), 100\u2013106 (2007)","journal-title":"Int. J. Autom. Comput."},{"issue":"2","key":"4_CR99","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/TCBB.2007.70272","volume":"6","author":"V. Olman","year":"2009","unstructured":"Olman V., Mao F., Wu H., Xu Y.: Parallel clustering algorithm for large data sets with applications in bioinformatics. IEEE\/ACM Trans. Comput. Biol. Bioinforma. 6(2), 344\u2013352 (2009)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinforma."},{"key":"4_CR100","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1016\/0167-8191(95)00017-I","volume":"21","author":"C.F. Olson","year":"1995","unstructured":"Olson C.F.: Parallel algorithms for hierarchical clustering. Parallel Comput. V 21, 1313\u20131325 (1995)","journal-title":"Parallel Comput. V"},{"key":"4_CR101","doi-asserted-by":"crossref","unstructured":"Othman, F., Abdullah, R., Rashid, N.A., Salam, R.A.: Parallel k-means clustering algorithm on dna dataset. In: Proceedings of the 5th International Conference on Parallel and Distributed Computing: Applications and Technologies, (PDCAT\u201904), Lecture Notes in Computer Science, vol. 3320, pp. 248\u2013251 (2004)","DOI":"10.1007\/978-3-540-30501-9_54"},{"key":"4_CR102","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1109\/TSMCC.2005.855515","volume":"36","author":"S.K. Pal","year":"2006","unstructured":"Pal S.K., Bandyopadhyay S.: Evolutionary computation in bioinformatics: A review. IEEE Trans. Syst. Man Cybern. Part B Cybern. 36, 601\u2013615 (2006)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B Cybern."},{"key":"4_CR103","doi-asserted-by":"crossref","unstructured":"Panigrahy, R.: An improved algorithm finding nearest neighbor using kd-trees. In: Proceedings of the 8th Latin American Symposium, Lectures Notes in Computer Science, vol. 4957, pp. 387\u2013398. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-78773-0_34"},{"issue":"2","key":"4_CR104","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1109\/72.839013","volume":"11","author":"R. Parekh","year":"2000","unstructured":"Parekh R., Yang J., Honavar V.: Constructive neural-network learning algorithms for pattern classification. IEEE Trans. Neural Netw. 11(2), 436\u2013450 (2000)","journal-title":"IEEE Trans. Neural Netw."},{"key":"4_CR105","unstructured":"Potter, M.A.: The design and analysis of a computational model of cooperative coevolution. Ph.D. thesis, George Mason University, Fairfax, Virginia (1997)"},{"issue":"1","key":"4_CR106","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/106365600568086","volume":"8","author":"M.A. Potter","year":"2000","unstructured":"Potter M.A., De Jong K.A.: Cooperative coevolution: An architecture for evolving coadapted subcomponents. Evol. Comput. 8(1), 1\u201329 (2000)","journal-title":"Evol. Comput."},{"key":"4_CR107","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1023\/A:1009876119989","volume":"2","author":"F.J. Provost","year":"1999","unstructured":"Provost F.J., Kolluri V.: A survey of methods for scaling up inductive learning algorithms. Data Min. Knowl. Discov. 2, 131\u2013169 (1999)","journal-title":"Data Min. Knowl. Discov."},{"key":"4_CR108","volume-title":"Parallel Computing: Theory and Practice","author":"M.J. Quinn","year":"1994","unstructured":"Quinn M.J.: Parallel Computing: Theory and Practice. McGraw-Hill, New York (1994)"},{"issue":"1","key":"4_CR109","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1108\/eb026836","volume":"45","author":"E.M. Rasmussen","year":"1989","unstructured":"Rasmussen E.M., Willet P.: Efficiency of hierarchical agglomerative clustering using ICL distributed array processors. J. Doc. 45(1), 1\u201324 (1989)","journal-title":"J. Doc."},{"key":"4_CR110","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1016\/j.compbiomed.2008.04.011","volume":"38","author":"T. Rausch","year":"2008","unstructured":"Rausch T., Thomas A., Camp N.J., Cannon-Albrigth L.A., Facelli J.C.: A parallel genetic algorithm to discover patterns in genetic markers that indicate predisposition to multifactorial disease. Comput. Biol. Med. 38, 826\u2013836 (2008)","journal-title":"Comput. Biol. Med."},{"key":"4_CR111","unstructured":"Rida, A., Labbi, A., Pellegrini, C.: Local experts combination through density decomposition. In: Proceedings of the 7th International Workshop on Artificial Intelligence and Statistics, pp. 692\u2013699 (1999)"},{"key":"4_CR112","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1016\/j.asoc.2009.12.035","volume":"11","author":"M. Rodr\u00edguez","year":"2011","unstructured":"Rodr\u00edguez M., Escalante D.M., Peregr\u00edn A.: Efficient distributed genetic algorithm for rule extraction. Appl. Soft Comput. 11, 733\u2013743 (2011)","journal-title":"Appl. Soft Comput."},{"key":"4_CR113","first-page":"941","volume":"5","author":"S. Rosset","year":"2004","unstructured":"Rosset S., Zhu J., Hastie T.: Boosting as a regularized path to a maximum margin classifier. J. Mach. Learn. Res. 5, 941\u2013973 (2004)","journal-title":"J. Mach. Learn. Res."},{"key":"4_CR114","first-page":"1557","volume":"5","author":"C. Rudin","year":"2004","unstructured":"Rudin C., Daubechies I., Schapire R.E.: The dynamics of adaboost: Cyclic behavior and convergence of margins. J. Mach. Learn. Res. 5, 1557\u20131595 (2004)","journal-title":"J. Mach. Learn. Res."},{"key":"4_CR115","doi-asserted-by":"crossref","first-page":"2383","DOI":"10.1016\/j.patcog.2005.11.001","volume":"39","author":"R. Ruiz","year":"2006","unstructured":"Ruiz R.: Incremental wrapper-based gene selection from microarray data for cancer classification. Pattern Recognit. 39, 2383\u20132392 (2006)","journal-title":"Pattern Recognit."},{"issue":"5","key":"4_CR116","doi-asserted-by":"crossref","first-page":"1651","DOI":"10.1214\/aos\/1024691352","volume":"26","author":"R.E. Schapire","year":"1998","unstructured":"Schapire R.E., Freund Y., Bartlett P.L., Lee W.S.: Boosting the margin: A new explanation for the effectiveness of voting methods. Ann. Stat. 26(5), 1651\u20131686 (1998)","journal-title":"Ann. Stat."},{"key":"4_CR117","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1016\/S0031-3203(01)00084-X","volume":"35","author":"M. Sebban","year":"2002","unstructured":"Sebban M., Nock R.: A hybrid filter\/wrapper approach of feature selection using information theory. Pattern Recognit. 35, 835\u2013846 (2002)","journal-title":"Pattern Recognit."},{"issue":"4","key":"4_CR118","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1016\/S0167-739X(99)00134-X","volume":"17","author":"G.S. Sena","year":"2001","unstructured":"Sena G.S., Megherbi D., Iserm G.: Implementation of a parallel genetic algorithm on a cluster of workstations: Travelling salesman problem, a case study. Future Gener. Comput. Syst. 17(4), 477\u2013488 (2001)","journal-title":"Future Gener. Comput. Syst."},{"key":"4_CR119","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1093\/comjnl\/16.1.30","volume":"16","author":"R. Sibson","year":"1973","unstructured":"Sibson R.: Slink: An optimally efficient algorithm for the single link cluster method. Comput. J. 16, 30\u201334 (1973)","journal-title":"Comput. J."},{"key":"4_CR120","unstructured":"Sikonja, M.R.: Speeding up relief algorithm with k-d trees. In: Proceedings of Electrotechnical and Computer Science Conference (ERK\u201998), pp. 137\u2013140. Portoroz, Slovenia (1998)"},{"issue":"4","key":"4_CR121","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/4434.806976","volume":"7","author":"D. Skillicorn","year":"1999","unstructured":"Skillicorn D.: Strategies for parallel data mining. IEEE Concurr. 7(4), 26\u201335 (1999)","journal-title":"IEEE Concurr."},{"issue":"2","key":"4_CR122","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01189880","volume":"12","author":"F. Smieja","year":"1993","unstructured":"Smieja F.: Neural-network constructive algorithms: Trading generalization for learning efficiency?. Circuits Syst. Signal Process. 12(2), 331\u2013374 (1993)","journal-title":"Circuits Syst. Signal Process."},{"key":"4_CR123","unstructured":"Steinbach, M., Karypis, G., Kumar, V.: A comparison of document clustering techniques. In: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2000)"},{"key":"4_CR124","unstructured":"Steinhaeuser, K., Chawla, N.V., Kogge, P.M.: Exploiting thread-level parallelism to build decision trees. In: Proceedings of the ECML\/PKDD Workshop on Parallel Data Mining (PDM). Berlin, Germany (2006)"},{"key":"4_CR125","doi-asserted-by":"crossref","unstructured":"Stoffel, K., Belkoniene, A.: Parallel k\/h-means clustering for large data sets. In: Proceedings of the 5th International Parallel Processing Conference (Euro-Par\u201999), Lecture Notes in Computer Science, vol. 1685, pp. 1451\u20131454 (1999)","DOI":"10.1007\/3-540-48311-X_205"},{"key":"4_CR126","doi-asserted-by":"crossref","first-page":"2719","DOI":"10.1162\/089976600300014908","volume":"12","author":"V. Tresp","year":"2000","unstructured":"Tresp V.: A bayesian committee machine. Neural Comput. 12, 2719\u20132741 (2000)","journal-title":"Neural Comput."},{"key":"4_CR127","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1109\/TEVC.2004.826069","volume":"8","author":"F. Bergh van den","year":"2004","unstructured":"van den Bergh F., Engelbrecht A.P.: A cooperative approach to particle swarm optimization. IEEE Trans. Evol. Comput. 8, 225\u2013239 (2004)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"4_CR128","doi-asserted-by":"crossref","unstructured":"Verma, A., Llor\u00e0, X., Goldberg, D.E., Campbell, R.H.: Scaling genetic algorithms using mapreduce. In: Proceedings of the 2009 Ninth International Conference on Intelligent Systems Design and Applications, pp. 13\u201317 (2009)","DOI":"10.1109\/ISDA.2009.181"},{"key":"4_CR129","unstructured":"Weiss, S.M., Indurkhya, N., Zhang, T., Damerau, F.: Text Mining: Predictive Methods for Analyzing Unstructured Information. Springer, Berlin, Germany (2010)"},{"key":"4_CR130","doi-asserted-by":"crossref","first-page":"2985","DOI":"10.1016\/j.ins.2008.02.017","volume":"178","author":"Z. Yang","year":"2008","unstructured":"Yang Z., Tang K., Yao X.: Large scale evolutionary optimization using cooperative coevolution. Inf. Sci. 178, 2985\u20132999 (2008)","journal-title":"Inf. Sci."},{"issue":"87","key":"4_CR131","doi-asserted-by":"crossref","first-page":"1423","DOI":"10.1109\/5.784219","volume":"9","author":"X. Yao","year":"1999","unstructured":"Yao X.: Evolving artificial neural networks. Proc. IEEE 9(87), 1423\u20131447 (1999)","journal-title":"Proc. IEEE"},{"key":"4_CR132","first-page":"153","volume":"4","author":"S.H. Yen","year":"2010","unstructured":"Yen S.H., Shih C.Y., Li T.K., Chang H.W.: Applying multiple kd-trees in high dimensional nearest neighbor searching. Int. J. Circuits Syst. Signal Process. 4, 153\u2013160 (2010)","journal-title":"Int. J. Circuits Syst. Signal Process."},{"key":"4_CR133","first-page":"825","volume":"28","author":"O.T. Y\u0131ld\u0131z","year":"2007","unstructured":"Y\u0131ld\u0131z O.T., Dikmen O.: Parallel univariate decision trees. Neural Process. Lett. 28, 825\u2013832 (2007)","journal-title":"Neural Process. Lett."},{"key":"4_CR134","doi-asserted-by":"crossref","unstructured":"Yin, D., An, C., Baird, H.S.: Imbalance and concentration in k-nn classification. In: Proceedings of 20th International Conference on Pattern Recognition (ICPR\u20192010), pp. 2170\u20132173. IEEE Press (2010)","DOI":"10.1109\/ICPR.2010.531"},{"key":"4_CR135","doi-asserted-by":"crossref","unstructured":"Yong, Z., Sannomiya, N.: A method for solving large-scale flowshop problems by reducing search space of genetic algorithms. In: 2000 IEEE International Conference on Systems, Man, and Cybernetics, vol. 3, pp. 1776\u20131781. IEEE Press (2000)","DOI":"10.1109\/ICSMC.2000.886366"},{"key":"4_CR136","doi-asserted-by":"crossref","unstructured":"Yu, T., Davis, L., Baydar, C., Roy, R. (eds.): Evolutionary Computation in Practice, Studies in Computational Intelligence, vol. 88. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-75771-9"},{"issue":"9","key":"4_CR137","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1093\/bioinformatics\/16.9.799","volume":"16","author":"A. Zien","year":"2000","unstructured":"Zien A., R\u00e4tsch G., Mika S., Sch\u00f6lkopf B., Lengauer T., M\u00fcller K.R.: Engineering support vector machines kernels that recognize translation initiation sites. Bioinformatics 16(9), 799\u2013807 (2000)","journal-title":"Bioinformatics"}],"container-title":["Progress in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13748-011-0004-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13748-011-0004-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13748-011-0004-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T21:42:31Z","timestamp":1742334151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13748-011-0004-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,13]]},"references-count":137,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["4"],"URL":"https:\/\/doi.org\/10.1007\/s13748-011-0004-4","relation":{},"ISSN":["2192-6352","2192-6360"],"issn-type":[{"value":"2192-6352","type":"print"},{"value":"2192-6360","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,13]]}}}