{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T09:23:51Z","timestamp":1790673831683,"version":"4.1.0"},"reference-count":73,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T00:00:00Z","timestamp":1593993600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T00:00:00Z","timestamp":1593993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2021,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Artificial neural networks (ANNs) have emerged as hot topics in the research community. Despite the success of ANNs, it is challenging to train and deploy modern ANNs on commodity hardware due to the ever-increasing model size and the unprecedented growth in the data volumes. Particularly for microarray data, the very high dimensionality and the small number of samples make it difficult for machine learning techniques to handle. Furthermore, specialized hardware such as graphics processing unit (GPU) is expensive. Sparse neural networks are the leading approaches to address these challenges. However, off-the-shelf sparsity-inducing techniques either operate from a pretrained model or enforce the sparse structure via binary masks. The training efficiency of sparse neural networks cannot be obtained practically. In this paper, we introduce a technique allowing us to train truly sparse neural networks with fixed parameter count throughout training. Our experimental results demonstrate that our method can be applied directly to handle high-dimensional data, while achieving higher accuracy than the traditional two-phase approaches. Moreover, we have been able to create truly sparse multilayer perceptron models with over one million neurons and to train them on a typical laptop without GPU (<jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/github.com\/dcmocanu\/sparse-evolutionary-artificial-neural-networks\/tree\/master\/SET-MLP-Sparse-Python-Data-Structures\">https:\/\/github.com\/dcmocanu\/sparse-evolutionary-artificial-neural-networks\/tree\/master\/SET-MLP-Sparse-Python-Data-Structures<\/jats:ext-link>), this being way beyond what is possible with any state-of-the-art technique.<\/jats:p>","DOI":"10.1007\/s00521-020-05136-7","type":"journal-article","created":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T06:03:37Z","timestamp":1594015417000},"page":"2589-2604","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Sparse evolutionary deep learning with over one million artificial neurons on commodity hardware"],"prefix":"10.1007","volume":"33","author":[{"given":"Shiwei","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Decebal Constantin","family":"Mocanu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amarsagar Reddy Ramapuram","family":"Matavalam","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yulong","family":"Pei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mykola","family":"Pechenizkiy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,7,6]]},"reference":[{"issue":"8","key":"5136_CR1","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1038\/nbt.3300","volume":"33","author":"B Alipanahi","year":"2015","unstructured":"Alipanahi B, Delong A, Weirauch MT, Frey BJ (2015) Predicting the sequence specificities of dna-and rna-binding proteins by deep learning. Nat Biotechnol 33(8):831","journal-title":"Nat Biotechnol"},{"issue":"Mar","key":"5136_CR2","first-page":"1183","volume":"3","author":"R Bekkerman","year":"2003","unstructured":"Bekkerman R, El-Yaniv R, Tishby N, Winter Y (2003) Distributional word clusters vs. words for text categorization. J Mach Learn Res 3(Mar):1183\u20131208","journal-title":"J Mach Learn Res"},{"issue":"32","key":"5136_CR3","doi-asserted-by":"publisher","first-page":"15849","DOI":"10.1073\/pnas.1903070116","volume":"116","author":"M Belkin","year":"2019","unstructured":"Belkin M, Hsu D, Ma S, Mandal S (2019) Reconciling modern machine-learning practice and the classical bias-variance trade-off. Proc Natl Acad Sci 116(32):15849\u201315854","journal-title":"Proc Natl Acad Sci"},{"key":"5136_CR4","unstructured":"Bellec G, Kappel D, Maass W, Legenstein R (2017) Deep rewiring: training very sparse deep networks. arXiv preprint arXiv:1711.05136"},{"issue":"1","key":"5136_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.knosys.2011.01.015","volume":"25","author":"P Bermejo","year":"2012","unstructured":"Bermejo P, de la Ossa L, G\u00e1mez JA, Puerta JM (2012) Fast wrapper feature subset selection in high-dimensional datasets by means of filter re-ranking. Knowl Based Syst 25(1):35\u201344","journal-title":"Knowl Based Syst"},{"key":"5136_CR6","unstructured":"Bourgin DD, Peterson JC, Reichman D, Griffiths TL, Russell SJ (2019) Cognitive model priors for predicting human decisions. arXiv preprint arXiv:1905.09397"},{"issue":"Mar","key":"5136_CR7","first-page":"1245","volume":"3","author":"R Caruana","year":"2003","unstructured":"Caruana R, Sa VR (2003) Benefitting from the variables that variable selection discards. J Mach Learn Res 3(Mar):1245\u20131264","journal-title":"J Mach Learn Res"},{"issue":"1","key":"5136_CR8","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.compeleceng.2013.11.024","volume":"40","author":"G Chandrashekar","year":"2014","unstructured":"Chandrashekar G, Sahin F (2014) A survey on feature selection methods. Comput Electr Eng 40(1):16\u201328","journal-title":"Comput Electr Eng"},{"key":"5136_CR9","unstructured":"Chauvin Y (1989) A back-propagation algorithm with optimal use of hidden units. In: Advances in neural information processing systems, pp 519\u2013526"},{"issue":"12","key":"5136_CR10","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1093\/bioinformatics\/btw074","volume":"32","author":"Y Chen","year":"2016","unstructured":"Chen Y, Li Y, Narayan R, Subramanian A, Xie X (2016) Gene expression inference with deep learning. Bioinformatics 32(12):1832\u20131839","journal-title":"Bioinformatics"},{"issue":"5","key":"5136_CR11","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/j.imavis.2006.02.002","volume":"24","author":"O Cord\u00f3n","year":"2006","unstructured":"Cord\u00f3n O, Damas S, Santamar\u00eda J (2006) Feature-based image registration by means of the chc evolutionary algorithm. Image Vis Comput 24(5):525\u2013533","journal-title":"Image Vis Comput"},{"key":"5136_CR12","unstructured":"Cun YL, Denker JS, Solla SA (1990) Optimal brain damage. In: Advances in neural information processing systems. Morgan Kaufmann, pp 598\u2013605"},{"issue":"10","key":"5136_CR13","doi-asserted-by":"publisher","first-page":"1487","DOI":"10.1109\/TC.2019.2914438","volume":"68","author":"X Dai","year":"2019","unstructured":"Dai X, Yin H, Jha N (2019) Nest: a neural network synthesis tool based on a grow-and-prune paradigm. IEEE Trans Comput 68(10):1487\u20131497","journal-title":"IEEE Trans Comput"},{"key":"5136_CR14","doi-asserted-by":"crossref","unstructured":"Davidson JL, Jalan J (2010) Feature selection for steganalysis using the mahalanobis distance. In: Media forensics and security II, vol 7541. International Society for Optics and Photonics, p 754104","DOI":"10.1117\/12.841074"},{"issue":"6","key":"5136_CR15","doi-asserted-by":"publisher","first-page":"1296","DOI":"10.1109\/TFUZZ.2009.2029569","volume":"17","author":"Rubio J de Jes\u00fas","year":"2009","unstructured":"de Jes\u00fas Rubio J (2009) Sofmls: online self-organizing fuzzy modified least-squares network. IEEE Trans Fuzzy Syst 17(6):1296\u20131309","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"5136_CR16","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.neucom.2016.08.150","volume":"262","author":"Rubio J de Jes\u00fas","year":"2017","unstructured":"de Jes\u00fas Rubio J (2017) Usnfis: uniform stable neuro fuzzy inference system. Neurocomputing 262:57\u201366","journal-title":"Neurocomputing"},{"key":"5136_CR17","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.neucom.2019.10.057","volume":"390","author":"J de Jesus Rubio","year":"2020","unstructured":"de Jesus Rubio J, Pan Y, Lughofer E, Chen M-Y, Qiu J (2020) Fast learning of neural networks with application to big data processes. Neurocomputing 390:294\u2013296. https:\/\/doi.org\/10.1016\/j.neucom.2019.10.057","journal-title":"Neurocomputing"},{"issue":"1","key":"5136_CR18","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean J, Ghemawat S (2008) Mapreduce: simplified data processing on large clusters. Commun ACM 51(1):107\u2013113","journal-title":"Commun ACM"},{"issue":"1","key":"5136_CR19","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10287-008-0070-7","volume":"6","author":"A Destrero","year":"2009","unstructured":"Destrero A, Mosci S, De Mol C, Verri A, Odone F (2009) Feature selection for high-dimensional data. Comput Manag Sci 6(1):25\u201340","journal-title":"Comput Manag Sci"},{"key":"5136_CR20","unstructured":"Dettmers T, Zettlemoyer L (2019) Sparse networks from scratch: faster training without losing performance. arXiv preprint arXiv:1907.04840"},{"key":"5136_CR21","unstructured":"Elton DC (2020) Self-explainability as an alternative to interpretability for judging the trustworthiness of artificial intelligences. arXiv preprint arXiv:2002.05149"},{"key":"5136_CR22","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s P, R\u00e9nyi A (1959) On random graphs i. Publ Math (Debrecen) 6:290\u2013297","journal-title":"Publ Math (Debrecen)"},{"key":"5136_CR23","doi-asserted-by":"crossref","unstructured":"Eshelman LJ (1991) The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination. In: Rawlings GJE (ed) Foundations of genetic algorithms, vol\u00a01. Elsevier, pp 265\u2013283","DOI":"10.1016\/B978-0-08-050684-5.50020-3"},{"key":"5136_CR24","unstructured":"Evci U, Elsen E, Castro P, Gale T (2020) Rigging the lottery: making all tickets winners. https:\/\/openreview.net\/forum?id=ryg7vA4tPB"},{"key":"5136_CR25","unstructured":"Fakoor R, Ladhak F, Nazi A, Huber M (2013) Using deep learning to enhance cancer diagnosis and classification. In: Proceedings of the international conference on machine learning, vol\u00a028"},{"issue":"Mar","key":"5136_CR26","first-page":"1289","volume":"3","author":"G Forman","year":"2003","unstructured":"Forman G (2003) An extensive empirical study of feature selection metrics for text classification. J Mach Learn Res 3(Mar):1289\u20131305","journal-title":"J Mach Learn Res"},{"key":"5136_CR27","unstructured":"Frankle J, Carbin M (2018) The lottery ticket hypothesis: finding sparse, trainable neural networks. arXiv preprint arXiv:1803.03635"},{"issue":"18","key":"5136_CR28","doi-asserted-by":"publisher","first-page":"6503","DOI":"10.1158\/0008-5472.CAN-04-0452","volume":"64","author":"WA Freije","year":"2004","unstructured":"Freije WA, Castro-Vargas FE, Fang Z, Horvath S, Cloughesy T, Liau LM, Mischel PS, Nelson SF (2004) Gene expression profiling of gliomas strongly predicts survival. Cancer Res 64(18):6503\u20136510","journal-title":"Cancer Res"},{"key":"5136_CR29","volume-title":"Deep learning (Subsection 1.2.3)","author":"I Goodfellow","year":"2016","unstructured":"Goodfellow I, Bengio Y, Courville A (2016) Deep learning (Subsection 1.2.3). The MIT Press, Cambridge"},{"issue":"Mar","key":"5136_CR30","first-page":"1157","volume":"3","author":"I Guyon","year":"2003","unstructured":"Guyon I, Elisseeff A (2003) An introduction to variable and feature selection. J Mach Learn Res 3(Mar):1157\u20131182","journal-title":"J Mach Learn Res"},{"issue":"15","key":"5136_CR31","doi-asserted-by":"publisher","first-page":"2529","DOI":"10.1200\/JCO.2009.23.4732","volume":"28","author":"T Haferlach","year":"2010","unstructured":"Haferlach T, Kohlmann A, Wieczorek L, Basso G, Kronnie GT, B\u00e9n\u00e9 MC, De JV, Hern\u00e1ndez JM, Hofmann WK, Mills KI et al (2010) Clinical utility of microarray-based gene expression profiling in the diagnosis and subclassification of leukemia: report from the international microarray innovations in leukemia study group. J Clin Oncol 28(15):2529\u20132537","journal-title":"J Clin Oncol"},{"issue":"1","key":"5136_CR32","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1656274.1656278","volume":"11","author":"M Hall","year":"2009","unstructured":"Hall M, Frank E, Holmes G, Pfahringer B, Reutemann P, Witten IH (2009) The weka data mining software: an update. ACM SIGKDD Explor Newsl 11(1):10\u201318","journal-title":"ACM SIGKDD Explor Newsl"},{"key":"5136_CR33","unstructured":"Han S, Pool J, Tran J, Dally W (2015) Learning both weights and connections for efficient neural network. In: Advances in neural information processing systems, pp 1135\u20131143"},{"key":"5136_CR34","unstructured":"Han S, Pool J, Tran J, Dally WJ (2015) Learning both weights and connections for efficient neural networks. In: Proceedings of the 28th international conference on neural information processing systems, vol 1. NIPS\u201915, MIT Press, Cambridge, pp 1135\u20131143. http:\/\/dl.acm.org\/citation.cfm?id=2969239.2969366"},{"issue":"19","key":"5136_CR35","doi-asserted-by":"publisher","first-page":"3937","DOI":"10.1200\/JCO.2004.12.133","volume":"22","author":"C Haslinger","year":"2004","unstructured":"Haslinger C, Schweifer N, Stilgenbauer S, Dohner H, Lichter P, Kraut N, Stratowa C, Abseher R (2004) Microarray gene expression profiling of b-cell chronic lymphocytic leukemia subgroups defined by genomic aberrations and vh mutation status. J Clin Oncol 22(19):3937\u20133949","journal-title":"J Clin Oncol"},{"key":"5136_CR36","unstructured":"Hinton GE, Srivastava N, Krizhevsky A, Sutskever I, Salakhutdinov R (2012) Improving neural networks by preventing co-adaptation of feature detectors. CoRR arXiv:abs\/1207.0580"},{"key":"5136_CR37","doi-asserted-by":"crossref","unstructured":"Jouppi NP, Young C, Patil N, Patterson D, Agrawal G, Bajwa R, Bates S, Bhatia S, Boden N, Borchers A, et\u00a0al (2017) In-datacenter performance analysis of a tensor processing unit. In: 2017 ACM\/IEEE 44th annual international symposium on computer architecture (ISCA). IEEE, pp 1\u201312","DOI":"10.1145\/3079856.3080246"},{"issue":"1\u20132","key":"5136_CR38","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0004-3702(97)00043-X","volume":"97","author":"R Kohavi","year":"1997","unstructured":"Kohavi R, John GH (1997) Wrappers for feature subset selection. Artif Intell 97(1\u20132):273\u2013324","journal-title":"Artif Intell"},{"key":"5136_CR39","unstructured":"Koller D, Sahami M (1996) Toward optimal feature selection. Tech. rep, Stanford InfoLab"},{"key":"5136_CR40","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1016\/j.knosys.2015.09.005","volume":"89","author":"M Kumar","year":"2015","unstructured":"Kumar M, Rath SK (2015) Classification of microarray using mapreduce based proximal support vector machine classifier. Knowl Based Syst 89:584\u2013602","journal-title":"Knowl Based Syst"},{"key":"5136_CR41","doi-asserted-by":"crossref","unstructured":"Langley P (1994) Selection of relevant features in machine learning. In: Proceedings of the AAAI Fall symposium on relevance. pp 1\u20135","DOI":"10.21236\/ADA292575"},{"issue":"7553","key":"5136_CR42","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1038\/nature14539","volume":"521","author":"Y LeCun","year":"2015","unstructured":"LeCun Y, Bengio Y, Hinton G (2015) Deep learning. Nature 521(7553):436","journal-title":"Nature"},{"key":"5136_CR43","unstructured":"Liu S, Mocanu DC, Pechenizkiy M (2019) Intrinsically sparse long short-term memory networks. arXiv preprint arXiv:1901.09208"},{"key":"5136_CR44","unstructured":"Liu S, Mocanu DC, Pechenizkiy M (2019) On improving deep learning generalization with adaptive sparse connectivity. In: ICML workshop on understanding and improving generalization in deep learning"},{"key":"5136_CR45","unstructured":"Louizos C, Welling M, Kingma DP (2017) Learning sparse neural networks through $ l\\_0 $ regularization. arXiv preprint arXiv:1712.01312"},{"key":"5136_CR46","doi-asserted-by":"publisher","first-page":"31968","DOI":"10.1109\/ACCESS.2018.2846483","volume":"6","author":"JA Meda-Campa\u00f1a","year":"2018","unstructured":"Meda-Campa\u00f1a JA (2018) On the estimation and control of nonlinear systems with parametric uncertainties and noisy outputs. IEEE Access 6:31968\u201331973","journal-title":"IEEE Access"},{"key":"5136_CR47","unstructured":"Mej\u00eda-Lavalle M, Sucar E, Arroyo G (2006) Feature selection with a perceptron neural net. In: Proceedings of the international workshop on feature selection for data mining. pp 131\u2013135"},{"key":"5136_CR48","unstructured":"Michael H, Zhu SG (2018) To prune, or not to prune: exploring the efficacy of pruning for model compression. In: International conference on learning representations workshop"},{"issue":"5","key":"5136_CR49","first-page":"851","volume":"18","author":"S Min","year":"2017","unstructured":"Min S, Lee B, Yoon S (2017) Deep learning in bioinformatics. Brief Bioinform 18(5):851\u2013869","journal-title":"Brief Bioinform"},{"key":"5136_CR50","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.patcog.2017.04.017","volume":"69","author":"DC Mocanu","year":"2017","unstructured":"Mocanu DC, Ammar HB, Puig L, Eaton E, Liotta A (2017) Estimating 3d trajectories from 2d projections via disjunctive factored four-way conditional restricted boltzmann machines. Pattern Recognit 69:325\u2013335","journal-title":"Pattern Recognit"},{"issue":"2\u20133","key":"5136_CR51","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10994-016-5570-z","volume":"104","author":"DC Mocanu","year":"2016","unstructured":"Mocanu DC, Mocanu E, Nguyen PH, Gibescu M, Liotta A (2016) A topological insight into restricted Boltzmann machines. Mach Learn 104(2\u20133):243\u2013270","journal-title":"Mach Learn"},{"issue":"1","key":"5136_CR52","doi-asserted-by":"publisher","first-page":"2383","DOI":"10.1038\/s41467-018-04316-3","volume":"9","author":"DC Mocanu","year":"2018","unstructured":"Mocanu DC, Mocanu E, Stone P, Nguyen PH, Gibescu M, Liotta A (2018) Scalable training of artificial neural networks with adaptive sparse connectivity inspired by network science. Nat Commun 9(1):2383","journal-title":"Nat Commun"},{"key":"5136_CR53","unstructured":"Mocanu DC, et al (2017) Network computations in artificial intelligence. Technische Universiteit Eindhoven"},{"key":"5136_CR54","unstructured":"Molchanov D, Ashukha A, Vetrov, D (2017) Variational dropout sparsifies deep neural networks. In: Proceedings of the 34th international conference on machine learning, vol 70. JMLR. org, pp 2498\u20132507"},{"key":"5136_CR55","unstructured":"Mostafa H, Wang X (2019) Parameter efficient training of deep convolutional neural networks by dynamic sparse reparameterization. arXiv preprint arXiv:1902.05967"},{"issue":"1","key":"5136_CR56","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1109\/TNB.2009.2035284","volume":"9","author":"PA Mundra","year":"2009","unstructured":"Mundra PA, Rajapakse JC (2009) Svm-rfe with mrmr filter for gene selection. IEEE Trans Nanobiosci 9(1):31\u201337","journal-title":"IEEE Trans Nanobiosci"},{"key":"5136_CR57","unstructured":"Narang S, Elsen E, Diamos G, Sengupta S (2017) Exploring sparsity in recurrent neural networks. arXiv preprint arXiv:1704.05119"},{"issue":"3","key":"5136_CR58","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1016\/j.plrev.2014.03.005","volume":"11","author":"L Pessoa","year":"2014","unstructured":"Pessoa L (2014) Understanding brain networks and brain organization. Phys Life Rev 11(3):400\u2013435","journal-title":"Phys Life Rev"},{"issue":"3","key":"5136_CR59","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/j.jpdc.2006.10.004","volume":"67","author":"E Plaku","year":"2007","unstructured":"Plaku E, Kavraki LE (2007) Distributed computation of the knn graph for large high-dimensional point sets. J Parallel Distrib Comput 67(3):346\u2013359","journal-title":"J Parallel Distrib Comput"},{"issue":"1","key":"5136_CR60","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.csl.2013.11.004","volume":"29","author":"J Pohjalainen","year":"2015","unstructured":"Pohjalainen J, R\u00e4s\u00e4nen O, Kadioglu S (2015) Feature selection methods and their combinations in high-dimensional classification of speaker likability, intelligibility and personality traits. Comput Speech Lang 29(1):145\u2013171","journal-title":"Comput Speech Lang"},{"issue":"11","key":"5136_CR61","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1016\/0167-8655(94)90127-9","volume":"15","author":"P Pudil","year":"1994","unstructured":"Pudil P, Novovi\u010dov\u00e1 J, Kittler J (1994) Floating search methods in feature selection. Pattern Recognit Lett 15(11):1119\u20131125","journal-title":"Pattern Recognit Lett"},{"issue":"Mar","key":"5136_CR62","first-page":"1371","volume":"3","author":"J Reunanen","year":"2003","unstructured":"Reunanen J (2003) Overfitting in making comparisons between variable selection methods. J Mach Learn Res 3(Mar):1371\u20131382","journal-title":"J Mach Learn Res"},{"issue":"3","key":"5136_CR63","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1109\/TNN.2007.909535","volume":"19","author":"E Romero","year":"2008","unstructured":"Romero E, Sopena JM (2008) Performing feature selection with multilayer perceptrons. IEEE Trans Neural Netw 19(3):431\u2013441","journal-title":"IEEE Trans Neural Netw"},{"issue":"6088","key":"5136_CR64","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1038\/323533a0","volume":"323","author":"DE Rumelhart","year":"1986","unstructured":"Rumelhart DE, Hinton GE, Williams RJ (1986) Learning representations by back-propagating errors. Nature 323(6088):533","journal-title":"Nature"},{"issue":"1","key":"5136_CR65","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1093\/jnci\/95.1.14","volume":"95","author":"R Simon","year":"2003","unstructured":"Simon R, Radmacher MD, Dobbin K, McShane LM (2003) Pitfalls in the use of dna microarray data for diagnostic and prognostic classification. J Natl Cancer Inst 95(1):14\u201318","journal-title":"J Natl Cancer Inst"},{"issue":"6825","key":"5136_CR66","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1038\/35065725","volume":"410","author":"SH Strogatz","year":"2001","unstructured":"Strogatz SH (2001) Exploring complex networks. Nature 410(6825):268","journal-title":"Nature"},{"key":"5136_CR67","doi-asserted-by":"crossref","unstructured":"Taheri N, Nezamabadi-pour H (2014) A hybrid feature selection method for high-dimensional data. In: 2014 4th international econference on computer and knowledge engineering (ICCKE). IEEE, pp 141\u2013145","DOI":"10.1109\/ICCKE.2014.6993381"},{"key":"5136_CR68","unstructured":"Ullrich K, Meeds E, Welling M (2017) Soft weight-sharing for neural network compression. arXiv preprint arXiv:1702.04008"},{"key":"5136_CR69","doi-asserted-by":"crossref","unstructured":"Wang J, Wei J, Yang Z (2016) Supervised feature selection by preserving class correlation. In: Proceedings of the 25th ACM international on conference on information and knowledge management. ACM, pp 1613\u20131622","DOI":"10.1145\/2983323.2983762"},{"key":"5136_CR70","unstructured":"Wen W, He Y, Rajbhandari S, Zhang M, Wang W, Liu F, Hu B, Chen Y, Li H (2017) Learning intrinsic sparse structures within long short-term memory. arXiv preprint arXiv:1709.05027"},{"key":"5136_CR71","unstructured":"Yoon J, Yang E, Lee J, Hwang S.J (2017) Lifelong learning with dynamically expandable networks. arXiv preprint arXiv:1708.01547"},{"key":"5136_CR72","unstructured":"Zhao Z, Morstatter F, Sharma S, Alelyani S, Anand A, Liu H (2010) Advancing feature selection research. In: ASU feature selection repository. pp 1\u201328"},{"issue":"4","key":"5136_CR73","doi-asserted-by":"publisher","first-page":"1310","DOI":"10.1109\/TNNLS.2019.2919699","volume":"31","author":"H Zhu","year":"2019","unstructured":"Zhu H, Jin Y (2019) Multi-objective evolutionary federated learning. IEEE Trans Neural Netw Learn Syst 31(4):1310\u20131322","journal-title":"IEEE Trans Neural Netw Learn Syst"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-05136-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-020-05136-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-05136-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,3]],"date-time":"2023-10-03T12:43:22Z","timestamp":1696337002000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-020-05136-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,6]]},"references-count":73,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["5136"],"URL":"https:\/\/doi.org\/10.1007\/s00521-020-05136-7","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,6]]},"assertion":[{"value":"11 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}