{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:51:00Z","timestamp":1754488260563,"version":"3.37.3"},"reference-count":116,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T00:00:00Z","timestamp":1659052800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T00:00:00Z","timestamp":1659052800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["676580","740233"],"award-info":[{"award-number":["676580","740233"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["676580"],"award-info":[{"award-number":["676580"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Berlin Big-Data Center","award":["01IS14013E"],"award-info":[{"award-number":["01IS14013E"]}]},{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["740233"],"award-info":[{"award-number":["740233"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2022,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The identification of relevant features, i.e., the driving variables that determine a process or the properties of a system, is an essential part of the analysis of data sets with a large number of variables. A mathematical rigorous approach to quantifying the relevance of these features is mutual information. Mutual information determines the relevance of features in terms of their joint mutual dependence to the property of interest. However, mutual information requires as input probability distributions, which cannot be reliably estimated from continuous distributions such as physical quantities like lengths or energies. Here, we introduce total cumulative mutual information (TCMI), a measure of the relevance of mutual dependences that extends mutual information to random variables of continuous distribution based on cumulative probability distributions. TCMI is a non-parametric, robust, and deterministic measure that facilitates comparisons and rankings between feature sets with different cardinality. The ranking induced by TCMI allows for feature selection, i.e., the identification of variable sets that are nonlinear statistically related to a property of interest, taking into account the number of data samples as well as the cardinality of the set of variables. We evaluate the performance of our measure with simulated data, compare its performance with similar multivariate-dependence measures, and demonstrate the effectiveness of our feature-selection method on a set of standard data sets and a typical scenario in materials science.<\/jats:p>","DOI":"10.1007\/s10618-022-00847-y","type":"journal-article","created":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T19:04:04Z","timestamp":1659121444000},"page":"1815-1864","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["TCMI: a non-parametric mutual-dependence estimator for multivariate continuous distributions"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2966-9168","authenticated-orcid":false,"given":"Benjamin","family":"Regler","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1280-9873","authenticated-orcid":false,"given":"Matthias","family":"Scheffler","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5099-3029","authenticated-orcid":false,"given":"Luca M.","family":"Ghiringhelli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,29]]},"reference":[{"issue":"3","key":"847_CR1","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s00500-008-0323-y","volume":"13","author":"J Alcal\u00e1-Fdez","year":"2009","unstructured":"Alcal\u00e1-Fdez J, S\u00e1nchez L, Garc\u00eda S et al (2009) Keel: a software tool to assess evolutionary algorithms for data mining problems. Soft Comput 13(3):307\u2013318. https:\/\/doi.org\/10.1007\/s00500-008-0323-y","journal-title":"Soft Comput"},{"issue":"2\u20133","key":"847_CR2","first-page":"255","volume":"17","author":"J Alcal\u00e1-Fdez","year":"2011","unstructured":"Alcal\u00e1-Fdez J, Fernandez A, Luengo J et al (2011) Keel data-mining software tool: Data set repository, integration of algorithms and experimental analysis framework. J Multi-Valued Log Soft Comput 17(2\u20133):255\u2013287","journal-title":"J Multi-Valued Log Soft Comput"},{"issue":"1","key":"847_CR3","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0004-3702(94)90084-1","volume":"69","author":"H Almuallim","year":"1994","unstructured":"Almuallim H, Dietterich TG (1994) Learning boolean concepts in the presence of many irrelevant features. Artif Intell 69(1):279\u2013305. https:\/\/doi.org\/10.1016\/0004-3702(94)90084-1","journal-title":"Artif Intell"},{"issue":"3","key":"847_CR4","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10844-007-0037-0","volume":"30","author":"A Arauzo-Azofra","year":"2008","unstructured":"Arauzo-Azofra A, Benitez JM, Castro JL (2008) Consistency measures for feature selection. J Intell Inf Syst 30(3):273\u2013292. https:\/\/doi.org\/10.1007\/s10844-007-0037-0","journal-title":"J Intell Inf Syst"},{"issue":"4","key":"847_CR5","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/0165-1684(89)90079-0","volume":"18","author":"M Basseville","year":"1989","unstructured":"Basseville M (1989) Distance measures for signal processing and pattern recognition. Signal Process 18(4):349\u2013369. https:\/\/doi.org\/10.1016\/0165-1684(89)90079-0","journal-title":"Signal Process"},{"key":"847_CR6","unstructured":"Belghazi MI, Baratin A, Rajeshwar S et\u00a0al (2018) Mutual information neural estimation. In: Dy J, Krause A (eds) Proceedings of the 35th International Conference on Machine Learning, Proceedings of Machine Learning Research, vol\u00a080. PMLR, Stockholm, Sweden, pp 531\u2013540, https:\/\/proceedings.mlr.press\/v80\/belghazi18a.html"},{"key":"847_CR7","unstructured":"Bellman R (1957) Dynamic Programming. Princeton University Press, New Jersey, USA, https:\/\/press.princeton.edu\/books\/paperback\/9780691146683\/dynamic-programming"},{"issue":"22","key":"847_CR8","doi-asserted-by":"publisher","first-page":"8520","DOI":"10.1016\/j.eswa.2015.07.007","volume":"42","author":"M Bennasar","year":"2015","unstructured":"Bennasar M, Hicks Y, Setchi R (2015) Feature selection using joint mutual information maximisation. Expert Syst Appl 42(22):8520\u20138532. https:\/\/doi.org\/10.1016\/j.eswa.2015.07.007","journal-title":"Expert Syst Appl"},{"issue":"3","key":"847_CR9","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1111\/j.1467-9868.2011.00772.x","volume":"73","author":"A Bernacchia","year":"2011","unstructured":"Bernacchia A, Pigolotti S (2011) Self-consistent method for density estimation. J R Stat Soc: Ser B (Statistical Methodology) 73(3):407\u2013422. https:\/\/doi.org\/10.1111\/j.1467-9868.2011.00772.x","journal-title":"J R Stat Soc: Ser B (Statistical Methodology)"},{"issue":"1","key":"847_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0004-3702(97)00063-5","volume":"97","author":"AL Blum","year":"1997","unstructured":"Blum AL, Langley P (1997) Selection of relevant features and examples in machine learning. Artif Intell 97(1):245\u2013271. https:\/\/doi.org\/10.1016\/S0004-3702(97)00063-5","journal-title":"Artif Intell"},{"key":"847_CR11","doi-asserted-by":"publisher","DOI":"10.1201\/9781315139470","volume-title":"Classification and regression trees","author":"L Breiman","year":"1984","unstructured":"Breiman L, Friedman J, Stone CJ et al (1984) Classification and regression trees. Chapman and Hall\/CRC, Florida, USA. https:\/\/doi.org\/10.1201\/9781315139470"},{"key":"847_CR12","unstructured":"Cantelli FP (1933) Sulla determinazione empirica delle leggi di probabilita. Giorn Ist Ital Attuari 4(421\u2013424)"},{"issue":"1","key":"847_CR13","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1109\/TNN.2004.841414","volume":"16","author":"TWS Chow","year":"2005","unstructured":"Chow TWS, Huang D (2005) Estimating optimal feature subsets using efficient estimation of high-dimensional mutual information. IEEE Trans Neural Networks 16(1):213\u2013224. https:\/\/doi.org\/10.1109\/TNN.2004.841414","journal-title":"IEEE Trans Neural Networks"},{"key":"847_CR14","unstructured":"Clausen J (1999) Branch and bound algorithms \u2013 principles and examples. Tech. rep., Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK2100 Copenhagen, Denmark"},{"key":"847_CR15","volume-title":"Mathematical Psychology: An Elementary Introduction","author":"C Coombs","year":"1970","unstructured":"Coombs C, Dawes R, Tversky A (1970) Mathematical Psychology: An Elementary Introduction. Prentice-Hall, Englewood Cliffs, NJ"},{"key":"847_CR16","unstructured":"Cortez P, Morais A (2007) A data mining approach to predict forest fires using meteorological data. In: Neves J, Santos MF, Machado J (eds) New Trends in Artificial Intelligence,. Proceedings of the 13th EPIA 2007 - Portuguese Conference on Artificial Intelligence, Guimaraes, Portugal, pp 512\u2013523, https:\/\/hdl.handle.net\/1822\/8039"},{"issue":"1","key":"847_CR17","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1186\/s12859-018-2264-5","volume":"19","author":"R Couronn\u00e9","year":"2018","unstructured":"Couronn\u00e9 R, Probst P, Boulesteix AL (2018) Random forest versus logistic regression: a large-scale benchmark experiment. BMC Bioinform 19(1):270. https:\/\/doi.org\/10.1186\/s12859-018-2264-5","journal-title":"BMC Bioinform"},{"key":"847_CR18","doi-asserted-by":"publisher","unstructured":"Cover TM, Thomas JA (2006) Elements of Information Theory. Wiley Series in Telecommunications and Signal Processing, Wiley-Interscience, New York, USA, https:\/\/doi.org\/10.1002\/047174882X","DOI":"10.1002\/047174882X"},{"issue":"12","key":"847_CR19","doi-asserted-by":"publisher","first-page":"4072","DOI":"10.1016\/j.jspi.2009.05.038","volume":"139","author":"AD Crescenzo","year":"2009","unstructured":"Crescenzo AD, Longobardi M (2009) On cumulative entropies. J Stat Plan Inference 139(12):4072\u20134087. https:\/\/doi.org\/10.1016\/j.jspi.2009.05.038","journal-title":"J Stat Plan Inference"},{"key":"847_CR20","doi-asserted-by":"publisher","unstructured":"Crescenzo AD, Longobardi M (2009b) On cumulative entropies and lifetime estimations. In: Mira J, Ferr\u00e1ndez JM, \u00c1lvarez JR, et\u00a0al (eds) Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira\u2019s Scientific Legacy: Third International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2009, Santiago de Compostela, Spain, June 22-26, 2009, Proceedings, Part I. Springer, Berlin, Heidelberg, pp 132\u2013141, https:\/\/doi.org\/10.1007\/978-3-642-02264-7_15","DOI":"10.1007\/978-3-642-02264-7_15"},{"key":"847_CR21","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/B978-1-55860-377-6.50032-3","volume-title":"Machine Learning: Proceedings of the Twelfth International Conference","author":"J Dougherty","year":"1995","unstructured":"Dougherty J, Kohavi R, Sahami M (1995) Supervised and unsupervised discretization of continuous features. In: Prieditis A, Russell SJ (eds) Machine Learning: Proceedings of the Twelfth International Conference. Morgan Kaufmann, San Francisco, USA, pp 194\u2013202. https:\/\/doi.org\/10.1016\/B978-1-55860-377-6.50032-3"},{"key":"847_CR22","unstructured":"Dua D, Graff C (2017) UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml"},{"key":"847_CR23","unstructured":"Dutta M (1966) On maximum (information-theoretic) entropy estimation. Sankhy\u0101: The Indian Journal of Statistics, Series A (1961-2002) 28(4):319\u2013328. https:\/\/www.jstor.org\/stable\/25049432"},{"key":"847_CR24","doi-asserted-by":"publisher","unstructured":"Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In: MHS\u201995. Proceedings of the Sixth International Symposium on Micro Machine and Human Science, pp 39\u201343, https:\/\/doi.org\/10.1109\/MHS.1995.494215","DOI":"10.1109\/MHS.1995.494215"},{"issue":"2","key":"847_CR25","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1109\/TNN.2008.2005601","volume":"20","author":"PA Estevez","year":"2009","unstructured":"Estevez PA, Tesmer M, Perez CA et al (2009) Normalized mutual information feature selection. IEEE Trans Neural Networks 20(2):189\u2013201. https:\/\/doi.org\/10.1109\/TNN.2008.2005601","journal-title":"IEEE Trans Neural Networks"},{"key":"847_CR26","unstructured":"Fayyad U, Irani K (1993) Multi-interval discretization of continuous-valued attributes for classification learning. In: Proceedings of the 13th Int. Joint Conference on Artificial Intelligence. Morgan Kaufmann, Chambery, France, pp 1022\u20131027"},{"key":"847_CR27","unstructured":"Fern\u00e1ndez-Delgado M, Cernadas E, Barro S et\u00a0al (2014) Do we need hundreds of classifiers to solve real world classification problems? J Mach Learn Res 15(1):3133\u20133181. https:\/\/jmlr.org\/papers\/v15\/delgado14a.html"},{"key":"847_CR28","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/978-3-642-22027-2_59","volume-title":"Digital Information and Communication Technology and Its Applications","author":"R Forsati","year":"2011","unstructured":"Forsati R, Moayedikia A, Safarkhani B (2011) Heuristic approach to solve feature selection problem. In: Cherifi H, Zain JM, El-Qawasmeh E (eds) Digital Information and Communication Technology and Its Applications. Springer, Berlin, Heidelberg, pp 707\u2013717. https:\/\/doi.org\/10.1007\/978-3-642-22027-2_59"},{"key":"847_CR29","doi-asserted-by":"publisher","unstructured":"Fouch\u00e9 E, B\u00f6hm K (2019) Monte carlo dependency estimation. In: Proceedings of the 31st International Conference on Scientific and Statistical Database Management. ACM, New York, NY, USA, SSDBM \u201919, pp 13\u201324, https:\/\/doi.org\/10.1145\/3335783.3335795","DOI":"10.1145\/3335783.3335795"},{"issue":"2","key":"847_CR30","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s10619-020-07295-x","volume":"39","author":"E Fouch\u00e9","year":"2021","unstructured":"Fouch\u00e9 E, Mazankiewicz A, Kalinke F et al (2021) A framework for dependency estimation in heterogeneous data streams. Distributed and Parallel Databases 39(2):415\u2013444. https:\/\/doi.org\/10.1007\/s10619-020-07295-x","journal-title":"Distributed and Parallel Databases"},{"issue":"1","key":"847_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/aos\/1176347963","volume":"19","author":"JH Friedman","year":"1991","unstructured":"Friedman JH (1991) Multivariate adaptive regression splines. Ann Stat 19(1):1\u201367. https:\/\/doi.org\/10.1214\/aos\/1176347963","journal-title":"Ann Stat"},{"key":"847_CR32","doi-asserted-by":"crossref","unstructured":"Friedman JH (2001) Greedy function approximation: A gradient boosting machine. Ann Stat 29(5):1189\u20131232. https:\/\/www.jstor.org\/stable\/2699986","DOI":"10.1214\/aos\/1013203451"},{"issue":"4","key":"847_CR33","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1016\/j.csda.2009.09.020","volume":"54","author":"D Garcia","year":"2010","unstructured":"Garcia D (2010) Robust smoothing of gridded data in one and higher dimensions with missing values. Comput Stat & Data Analysis 54(4):1167\u20131178. https:\/\/doi.org\/10.1016\/j.csda.2009.09.020","journal-title":"Comput Stat & Data Analysis"},{"issue":"10","key":"847_CR34","doi-asserted-by":"publisher","first-page":"105,503","DOI":"10.1103\/PhysRevLett.114.105503","volume":"114","author":"LM Ghiringhelli","year":"2015","unstructured":"Ghiringhelli LM, Vybiral J, Levchenko SV et al (2015) Big data of materials science: Critical role of the descriptor. Phys Rev Lett 114(10):105,503. https:\/\/doi.org\/10.1103\/PhysRevLett.114.105503","journal-title":"Phys Rev Lett"},{"issue":"2","key":"847_CR35","doi-asserted-by":"publisher","first-page":"023,017","DOI":"10.1088\/1367-2630\/aa57bf","volume":"19","author":"LM Ghiringhelli","year":"2017","unstructured":"Ghiringhelli LM, Vybiral J, Ahmetcik E et al (2017) Learning physical descriptors for materials science by compressed sensing. New J Phys 19(2):023,017. https:\/\/doi.org\/10.1088\/1367-2630\/aa57bf","journal-title":"New J Phys"},{"key":"847_CR36","first-page":"92","volume":"4","author":"V Glivenko","year":"1933","unstructured":"Glivenko V (1933) Sulla determinazione empirica delle leggi di probabilita. Gion Ist Ital Attauri 4:92\u201399","journal-title":"Gion Ist Ital Attauri"},{"key":"847_CR37","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.5555\/944919.944968","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:1157\u20131182. https:\/\/doi.org\/10.5555\/944919.944968","journal-title":"J Mach Learn Res"},{"key":"847_CR38","unstructured":"Hey T, Tansley S, Tolle K (2009) The Fourth Paradigm: Data-Intensive Scientific Discovery. Microsoft Research, Washington, USA, https:\/\/www.microsoft.com\/en-us\/research\/publication\/fourth-paradigm-data-intensive-scientific-discovery\/"},{"issue":"9","key":"847_CR39","doi-asserted-by":"publisher","first-page":"10,737","DOI":"10.1016\/j.eswa.2011.01.023","volume":"38","author":"Q Hu","year":"2011","unstructured":"Hu Q, Zhang L, Zhang D et al (2011) Measuring relevance between discrete and continuous features based on neighborhood mutual information. Expert Syst Appl 38(9):10,737-10,750. https:\/\/doi.org\/10.1016\/j.eswa.2011.01.023","journal-title":"Expert Syst Appl"},{"key":"847_CR40","doi-asserted-by":"publisher","unstructured":"James G, Witten D, Hastie T et al (2013) An Introduction to Statistical Learning, Springer Texts in Statistics, vol 103. Springer, New York, https:\/\/doi.org\/10.1007\/978-1-4614-7138-7","DOI":"10.1007\/978-1-4614-7138-7"},{"key":"847_CR41","unstructured":"Ke G, Meng Q, Finley T et\u00a0al (2017) Lightgbm: A highly efficient gradient boosting decision tree. In: Guyon I, Luxburg UV, Bengio S, et\u00a0al (eds) Advances in Neural Information Processing Systems 30. Curran Associates, Inc., New York, USA, p 3146\u20133154, http:\/\/papers.nips.cc\/paper\/6907-lightgbm-a-highly-efficient-gradient-boosting-decision-tree.pdf"},{"key":"847_CR42","doi-asserted-by":"publisher","unstructured":"Keller F, Muller E, Bohm K (2012) Hics: High contrast subspaces for density-based outlier ranking. In: 28th IEEE International Conference on Data Engineering, Washington, USA, pp 1037\u20131048, https:\/\/doi.org\/10.1109\/ICDE.2012.88","DOI":"10.1109\/ICDE.2012.88"},{"key":"847_CR43","doi-asserted-by":"publisher","unstructured":"Khaire UM, Dhanalakshmi R (2019) Stability of feature selection algorithm: A review. J King Saud University - Comput Inf Sci 34(4):1060\u20131073. https:\/\/doi.org\/10.1016\/j.jksuci.2019.06.012","DOI":"10.1016\/j.jksuci.2019.06.012"},{"issue":"1","key":"847_CR44","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):273\u2013324. https:\/\/doi.org\/10.1016\/S0004-3702(97)00043-X","journal-title":"Artif Intell"},{"key":"847_CR45","unstructured":"Koller D, Sahami M (1996) Toward optimal feature selection. In: Proceedings of the 13th International Conference on Machine Learning, Bari, Italy, pp 284\u2013292, http:\/\/ilpubs.stanford.edu:8090\/208\/"},{"issue":"2","key":"847_CR46","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF00175355","volume":"4","author":"JR Koza","year":"1994","unstructured":"Koza JR (1994) Genetic programming as a means for programming computers by natural selection. Stat Comput 4(2):87\u2013112. https:\/\/doi.org\/10.1007\/BF00175355","journal-title":"Stat Comput"},{"key":"847_CR47","unstructured":"Kozachenko LF, Leonenko NN (1987) Sample estimate of the entropy of a random vector. Problemy Peredachi Informatsii 23(2):9\u201316. http:\/\/mi.mathnet.ru\/eng\/ppi\/v23\/i2\/p9"},{"issue":"6","key":"847_CR48","doi-asserted-by":"publisher","first-page":"066,138","DOI":"10.1103\/PhysRevE.69.066138","volume":"69","author":"A Kraskov","year":"2004","unstructured":"Kraskov A, St\u00f6gbauer H, Grassberger P (2004) Estimating mutual information. Phys Rev E 69(6):066,138. https:\/\/doi.org\/10.1103\/PhysRevE.69.066138","journal-title":"Phys Rev E"},{"key":"847_CR49","volume-title":"Information Theory and Statistics","author":"S Kullback","year":"1959","unstructured":"Kullback S (1959) Information Theory and Statistics. John Wiley and Sons, New York"},{"key":"847_CR50","doi-asserted-by":"crossref","unstructured":"Kullback S, Leibler RA (1951) On information and sufficiency. Ann Math Stat 22(1):79\u201386. https:\/\/www.jstor.org\/stable\/2236703","DOI":"10.1214\/aoms\/1177729694"},{"issue":"12","key":"847_CR51","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1109\/TPAMI.2002.1114861","volume":"24","author":"N Kwak","year":"2002","unstructured":"Kwak N, Choi C-H (2002) Input feature selection by mutual information based on parzen window. IEEE Trans Pattern Anal Mach Intell 24(12):1667\u20131671. https:\/\/doi.org\/10.1109\/TPAMI.2002.1114861","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"847_CR52","volume-title":"The Chi-squared Distribution","author":"HO Lancaster","year":"1969","unstructured":"Lancaster HO (1969) The Chi-squared Distribution. Wiley & Sons Inc, New York"},{"issue":"3","key":"847_CR53","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"AH Land","year":"1960","unstructured":"Land AH, Doig AG (1960) An automatic method of solving discrete programming problems. Econom 28(3):497\u2013520. https:\/\/doi.org\/10.2307\/1910129","journal-title":"Econom"},{"issue":"3","key":"847_CR54","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1002\/sim.5937","volume":"33","author":"F Lu","year":"2014","unstructured":"Lu F, Petkova E (2014) A comparative study of variable selection methods in the context of developing psychiatric screening instruments. Stat Med 33(3):401\u2013421. https:\/\/doi.org\/10.1002\/sim.5937","journal-title":"Stat Med"},{"key":"847_CR55","unstructured":"Lundberg SM, Lee SI (2017) A unified approach to interpreting model predictions. In: Proceedings of the 31st International Conference on Neural Information Processing Systems. Curran Associates Inc., New York, USA, NIPS\u201917, p 4768-4777, https:\/\/proceedings.neurips.cc\/paper\/2017\/hash\/8a20a8621978632d76c43dfd28b67767-Abstract.html"},{"key":"847_CR56","doi-asserted-by":"publisher","unstructured":"Mandros P, Boley M, Vreeken J (2017) Discovering reliable approximate functional dependencies. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, New York, NY, USA, KDD \u201917, pp 355\u2013363, https:\/\/doi.org\/10.1145\/3097983.3098062","DOI":"10.1145\/3097983.3098062"},{"issue":"1","key":"847_CR57","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/TIT.1963.1057810","volume":"9","author":"T Marill","year":"1963","unstructured":"Marill T, Green D (1963) On the effectiveness of receptors in recognition systems. IEEE Trans Inf Theory 9(1):11\u201317. https:\/\/doi.org\/10.1109\/TIT.1963.1057810","journal-title":"IEEE Trans Inf Theory"},{"issue":"2","key":"847_CR58","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF02289159","volume":"19","author":"WJ McGill","year":"1954","unstructured":"McGill WJ (1954) Multivariate information transmission. Psychom 19(2):97\u2013116. https:\/\/doi.org\/10.1007\/BF02289159","journal-title":"Psychom"},{"key":"847_CR59","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07807-5","volume-title":"How to Solve It: Modern Heuristics","author":"Z Michalewicz","year":"2004","unstructured":"Michalewicz Z, Fogel DB (2004) How to Solve It: Modern Heuristics. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-662-07807-5"},{"issue":"9","key":"847_CR60","doi-asserted-by":"publisher","first-page":"2328","DOI":"10.4249\/scholarpedia.2328","volume":"2","author":"C Mira","year":"2007","unstructured":"Mira C (2007) Noninvertible maps. Scholarpedia 2(9):2328. https:\/\/doi.org\/10.4249\/scholarpedia.2328","journal-title":"Scholarpedia"},{"key":"847_CR61","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-56602-3_138","volume-title":"Machine Learning: ECML-93","author":"M Modrzejewski","year":"1993","unstructured":"Modrzejewski M (1993) Feature selection using rough sets theory. In: Brazdil PB (ed) Machine Learning: ECML-93. Springer, Berlin, Heidelberg, pp 213\u2013226. https:\/\/doi.org\/10.1007\/3-540-56602-3_138"},{"key":"847_CR62","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.disopt.2016.01.005","volume":"19","author":"DR Morrison","year":"2016","unstructured":"Morrison DR, Jacobson SH, Sauppe JJ et al (2016) Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning. Discret Optim 19:79\u2013102. https:\/\/doi.org\/10.1016\/j.disopt.2016.01.005","journal-title":"Discret Optim"},{"issue":"9","key":"847_CR63","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1109\/TC.1977.1674939","volume":"C\u201326","author":"PM Narendra","year":"1977","unstructured":"Narendra PM, Fukunaga K (1977) A branch and bound algorithm for feature subset selection. IEEE Trans Comput C\u201326(9):917\u2013922. https:\/\/doi.org\/10.1109\/TC.1977.1674939","journal-title":"IEEE Trans Comput"},{"key":"847_CR64","doi-asserted-by":"publisher","first-page":"21","DOI":"10.3389\/fnbot.2013.00021","volume":"7","author":"A Natekin","year":"2013","unstructured":"Natekin A, Knoll A (2013) Gradient boosting machines, a tutorial. Front Neurorobot 7:21\u201321. https:\/\/doi.org\/10.3389\/fnbot.2013.00021","journal-title":"Front Neurorobot"},{"key":"847_CR65","doi-asserted-by":"publisher","unstructured":"Nguyen HV, M\u00fcller E, Vreeken J et\u00a0al (2013) CMI: An Information-Theoretic Contrast Measure for Enhancing Subspace Cluster and Outlier Detection, Proceedings of the 2013 SIAM International Conference on Data Mining (SDM), Austin, Texas, USA, chap\u00a021, pp 198\u2013206. https:\/\/doi.org\/10.1137\/1.9781611972832.22","DOI":"10.1137\/1.9781611972832.22"},{"key":"847_CR66","doi-asserted-by":"publisher","unstructured":"Nguyen HV, M\u00fcller E, Vreeken J et al (2014) Unsupervised interaction-preserving discretization of multivariate data. Data Min Knowl Disc 28(5):1366\u20131397. https:\/\/doi.org\/10.1007\/s10618-014-0350-5","DOI":"10.1007\/s10618-014-0350-5"},{"key":"847_CR67","unstructured":"Nguyen HV, M\u00fcller E, Vreeken J, et\u00a0al (2014b) Multivariate maximal correlation analysis. In: Jebara T, Xing EP (eds) Proceedings of the 31st International Conference on Machine Learning (ICML-14), vol\u00a032. JMLR Workshop and Conference Proceedings, Beijing, China, pp 775\u2013783, https:\/\/proceedings.mlr.press\/v32\/nguyenc14.html"},{"key":"847_CR68","doi-asserted-by":"publisher","unstructured":"Nguyen HV, Mandros P, Vreeken J (2016) Universal Dependency Analysis, Society for Industrial and Applied Mathematics, Florida, USA, pp 792\u2013800. Proceedings, https:\/\/doi.org\/10.1137\/1.9781611974348.89, https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/1.9781611974348.89","DOI":"10.1137\/1.9781611974348.89"},{"key":"847_CR69","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.csda.2014.06.002","volume":"79","author":"TA O\u2019Brien","year":"2014","unstructured":"O\u2019Brien TA, Collins WD, Rauscher SA et al (2014) Reducing the computational cost of the ECF using a nufft: A fast and objective probability density estimation method. Comput Stat & Data Analysis 79:222\u2013234. https:\/\/doi.org\/10.1016\/j.csda.2014.06.002","journal-title":"Comput Stat & Data Analysis"},{"key":"847_CR70","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.csda.2016.02.014","volume":"101","author":"TA O\u2019Brien","year":"2016","unstructured":"O\u2019Brien TA, Kashinath K, Cavanaugh NR et al (2016) A fast and objective multidimensional kernel density estimation method: fastkde. Comput Stat & Data Analysis 101:148\u2013160. https:\/\/doi.org\/10.1016\/j.csda.2016.02.014","journal-title":"Comput Stat & Data Analysis"},{"issue":"8","key":"847_CR71","doi-asserted-by":"publisher","first-page":"083,802 (11)","DOI":"10.1103\/PhysRevMaterials.2.083802","volume":"2","author":"R Ouyang","year":"2018","unstructured":"Ouyang R, Curtarolo S, Ahmetcik E et al (2018) Sisso: A compressed-sensing method for identifying the best low-dimensional descriptor in an immensity of offered candidates. Phys Rev Materials 2(8):083,802 (11). https:\/\/doi.org\/10.1103\/PhysRevMaterials.2.083802","journal-title":"Phys Rev Materials"},{"key":"847_CR72","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1098\/rsta.1896.0007","volume":"187","author":"K Pearson","year":"1896","unstructured":"Pearson K (1896) Mathematical contributions to the theory of evolution. iii. regression, heredity, and panmixia. Philos Trans R Soc Lond Ser A 187:253\u2013318. https:\/\/doi.org\/10.1098\/rsta.1896.0007","journal-title":"Philos Trans R Soc Lond Ser A"},{"issue":"8","key":"847_CR73","doi-asserted-by":"publisher","first-page":"1226","DOI":"10.1109\/TPAMI.2005.159","volume":"27","author":"H Peng","year":"2005","unstructured":"Peng H, Long F, Ding C (2005) Feature selection based on mutual information criteria of max-dependency, max-relevance, and min-redundancy. IEEE Trans Pattern Anal Mach Intell 27(8):1226\u20131238. https:\/\/doi.org\/10.1109\/TPAMI.2005.159","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"1","key":"847_CR74","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0038-1098(84)90765-8","volume":"51","author":"D Pettifor","year":"1984","unstructured":"Pettifor D (1984) A chemical scale for crystal-structure maps. Solid State Commun 51(1):31\u201334. https:\/\/doi.org\/10.1016\/0038-1098(84)90765-8","journal-title":"Solid State Commun"},{"issue":"3","key":"847_CR75","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10115-008-0150-6","volume":"19","author":"D Pfitzner","year":"2008","unstructured":"Pfitzner D, Leibbrandt R, Powers D (2008) Characterization and evaluation of similarity measures for pairs of clusterings. Knowl Inf Syst 19(3):361. https:\/\/doi.org\/10.1007\/s10115-008-0150-6","journal-title":"Knowl Inf Syst"},{"issue":"3","key":"847_CR76","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1103\/RevModPhys.42.317","volume":"42","author":"JC Phillips","year":"1970","unstructured":"Phillips JC (1970) Ionicity of the chemical bond in crystals. Rev Mod Phys 42(3):317\u2013356. https:\/\/doi.org\/10.1103\/RevModPhys.42.317","journal-title":"Rev Mod Phys"},{"key":"847_CR77","doi-asserted-by":"publisher","DOI":"10.1137\/1031025","volume-title":"Numerical Recipes in C: The Art of Scientific Computing","author":"WH Press","year":"1988","unstructured":"Press WH, Flannery BP, Teukolsky SA et al (1988) Numerical Recipes in C: The Art of Scientific Computing. Cambridge University Press, Cambridge. https:\/\/doi.org\/10.1137\/1031025"},{"issue":"11","key":"847_CR78","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 Recogn Lett 15(11):1119\u20131125. https:\/\/doi.org\/10.1016\/0167-8655(94)90127-9","journal-title":"Pattern Recogn Lett"},{"key":"847_CR79","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-1-4613-0231-5_23","volume-title":"Recent Feature Selection Methods in Statistical Pattern Recognition","author":"P Pudil","year":"2002","unstructured":"Pudil P, Novovi\u010dov\u00e1 J, Somol P (2002) Recent Feature Selection Methods in Statistical Pattern Recognition. Springer, Boston, MA, pp 565\u2013615. https:\/\/doi.org\/10.1007\/978-1-4613-0231-5_23"},{"issue":"4","key":"847_CR80","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1007\/s10959-005-7541-3","volume":"18","author":"M Rao","year":"2005","unstructured":"Rao M (2005) More on a new concept of entropy and information. J Theor Probab 18(4):967\u2013981. https:\/\/doi.org\/10.1007\/s10959-005-7541-3","journal-title":"J Theor Probab"},{"issue":"6","key":"847_CR81","doi-asserted-by":"publisher","first-page":"1220","DOI":"10.1109\/TIT.2004.828057","volume":"50","author":"M Rao","year":"2004","unstructured":"Rao M, Chen Y, Vemuri BC et al (2004) Cumulative residual entropy: a new measure of information. IEEE Trans Inf Theory 50(6):1220\u20131228. https:\/\/doi.org\/10.1109\/TIT.2004.828057","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"847_CR82","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1214\/12-STS405","volume":"28","author":"M Reimherr","year":"2013","unstructured":"Reimherr M, Nicolae DL (2013) On quantifying dependence: A framework for developing interpretable measures. Stat Sci 28(1):116\u2013130. https:\/\/doi.org\/10.1214\/12-STS405","journal-title":"Stat Sci"},{"issue":"6062","key":"847_CR83","doi-asserted-by":"publisher","first-page":"1518","DOI":"10.1126\/science.1205438","volume":"334","author":"DN Reshef","year":"2011","unstructured":"Reshef DN, Reshef YA, Finucane HK et al (2011) Detecting novel associations in large data sets. Sci 334(6062):1518\u20131524. https:\/\/doi.org\/10.1126\/science.1205438","journal-title":"Sci"},{"key":"847_CR84","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-540-35488-8_5","volume-title":"Search Strategies","author":"J Reunanen","year":"2006","unstructured":"Reunanen J (2006) Search Strategies. Springer, Berlin, Heidelberg, pp 119\u2013136. https:\/\/doi.org\/10.1007\/978-3-540-35488-8_5"},{"key":"847_CR85","unstructured":"Romano S, Bailey J, Nguyen V et\u00a0al (2014) Standardized mutual information for clustering comparisons: One step further in adjustment for chance. In: Jebara T, Xing EP (eds) Proceedings of the 31st International Conference on Machine Learning (ICML-14), vol\u00a032. JMLR Workshop and Conference Proceedings, Beijing, China, pp 1143\u20131151, https:\/\/proceedings.mlr.press\/v32\/romano14.html"},{"key":"847_CR86","doi-asserted-by":"publisher","unstructured":"Romano S, Vinh NX, Bailey J et\u00a0al (2016) A framework to adjust dependency measure estimates for chance. In: Proceedings of the 2016 SIAM International Conference on Data Mining, pp 423\u2013431, https:\/\/doi.org\/10.1137\/1.9781611974348.48","DOI":"10.1137\/1.9781611974348.48"},{"key":"847_CR87","doi-asserted-by":"crossref","unstructured":"Rossi RJ (2018) Mathematical Statistics: An Introduction to Likelihood Based Inference. New Jersey, USA, https:\/\/www.wiley.com\/en-us\/MathematicalStatistics:AnIntroductiontoLikelihoodBasedInference-p-9781118771044","DOI":"10.1002\/9781118771075"},{"issue":"10","key":"847_CR88","doi-asserted-by":"publisher","first-page":"104,104","DOI":"10.1103\/PhysRevB.85.104104","volume":"85","author":"Y Saad","year":"2012","unstructured":"Saad Y, Gao D, Ngo T et al (2012) Data mining for materials: Computational experiments with $$ab$$ compounds. Phys Rev B 85(10):104,104. https:\/\/doi.org\/10.1103\/PhysRevB.85.104104","journal-title":"Phys Rev B"},{"issue":"4","key":"847_CR89","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/j.spl.2006.08.007","volume":"77","author":"F Schmid","year":"2007","unstructured":"Schmid F, Schmidt R (2007) Multivariate extensions of spearman\u2019s rho and related statistics. Stat & Probab Lett 77(4):407\u2013416. https:\/\/doi.org\/10.1016\/j.spl.2006.08.007","journal-title":"Stat & Probab Lett"},{"key":"847_CR90","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316849","volume-title":"Multivariate Density Estimation: Theory, Practice, and Visualization","author":"DW Scott","year":"1982","unstructured":"Scott DW (1982) Multivariate Density Estimation: Theory, Practice, and Visualization. Wiley, New York. https:\/\/doi.org\/10.1002\/9780470316849"},{"issue":"3","key":"847_CR91","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon CE (1948) A mathematical theory of communication. Bell Syst Tech J 27(3):379\u2013423. https:\/\/doi.org\/10.1002\/j.1538-7305.1948.tb01338.x","journal-title":"Bell Syst Tech J"},{"key":"847_CR92","volume-title":"The Mathematical Theory of Communication","author":"CE Shannon","year":"1949","unstructured":"Shannon CE, Weaver W (1949) The Mathematical Theory of Communication, vol III. Illinois Press, Illinois, USA"},{"key":"847_CR93","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1142\/9789814343138_0004","volume-title":"On automatic feature selection","author":"W Siedlecki","year":"1993","unstructured":"Siedlecki W, Sklansky J (1993) On automatic feature selection. World Scientific, Singapore, New Yersey, London, Hong Kong, pp 63\u201387. https:\/\/doi.org\/10.1142\/9789814343138_0004"},{"key":"847_CR94","doi-asserted-by":"publisher","DOI":"10.1201\/9781315140919","volume-title":"Density Estimation for Statistics and Data Analysis","author":"BW Silverman","year":"1986","unstructured":"Silverman BW (1986) Density Estimation for Statistics and Data Analysis, vol 1. Chapman and Hall\/CRC, New York. https:\/\/doi.org\/10.1201\/9781315140919"},{"issue":"1","key":"847_CR95","doi-asserted-by":"publisher","first-page":"72","DOI":"10.2307\/1412159","volume":"15","author":"C Spearman","year":"1904","unstructured":"Spearman C (1904) The proof and measurement of association between two things. Am J Psychol 15(1):72\u2013101. https:\/\/doi.org\/10.2307\/1412159","journal-title":"Am J Psychol"},{"issue":"6","key":"847_CR96","doi-asserted-by":"publisher","first-page":"2382","DOI":"10.1214\/14-AOS1255","volume":"42","author":"GJ Sz\u00e9kely","year":"2014","unstructured":"Sz\u00e9kely GJ, Rizzo ML (2014) Partial distance correlation with methods for dissimilarities. Ann Stat 42(6):2382\u20132412. https:\/\/doi.org\/10.1214\/14-AOS1255","journal-title":"Ann Stat"},{"issue":"6","key":"847_CR97","doi-asserted-by":"publisher","first-page":"2769","DOI":"10.1214\/009053607000000505","volume":"35","author":"GJ Sz\u00e9kely","year":"2007","unstructured":"Sz\u00e9kely GJ, Rizzo ML, Bakirov NK (2007) Measuring and testing dependence by correlation of distances. Ann Stat 35(6):2769\u20132794. https:\/\/doi.org\/10.1214\/009053607000000505","journal-title":"Ann Stat"},{"issue":"3","key":"847_CR98","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1103\/PhysRev.182.891","volume":"182","author":"JA Van Vechten","year":"1969","unstructured":"Van Vechten JA (1969) Quantum dielectric theory of electronegativity in covalent systems. i. electronic dielectric constant. Phys Rev 182(3):891\u2013905. https:\/\/doi.org\/10.1103\/PhysRev.182.891","journal-title":"Phys Rev"},{"issue":"1","key":"847_CR99","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s00521-013-1368-0","volume":"24","author":"JR Vergara","year":"2014","unstructured":"Vergara JR, Est\u00e9vez PA (2014) A review of feature selection methods based on mutual information. Neural Comput Appl 24(1):175\u2013186. https:\/\/doi.org\/10.1007\/s00521-013-1368-0","journal-title":"Neural Comput Appl"},{"key":"847_CR100","doi-asserted-by":"publisher","unstructured":"Vinh NX, Epps J, Bailey J (2009) Information theoretic measures for clusterings comparison: Is a correction for chance necessary? In: Proceedings of the 26th Annual International Conference on Machine Learning. ACM, New York, NY, USA, ICML \u201909, pp 1073\u20131080, https:\/\/doi.org\/10.1145\/1553374.1553511","DOI":"10.1145\/1553374.1553511"},{"key":"847_CR101","doi-asserted-by":"publisher","first-page":"2837","DOI":"10.1145\/1553374.1553511","volume":"11","author":"NX Vinh","year":"2010","unstructured":"Vinh NX, Epps J, Bailey J (2010) Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance. J Mach Learn Res 11:2837\u20132854. https:\/\/doi.org\/10.1145\/1553374.1553511","journal-title":"J Mach Learn Res"},{"key":"847_CR102","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-540-45087-0_33","volume-title":"A New & Robust Information Theoretic Measure and Its Application to Image Alignment","author":"F Wang","year":"2003","unstructured":"Wang F, Vemuri BC, Rao M et al (2003) A New & Robust Information Theoretic Measure and Its Application to Image Alignment. Springer, Berlin, Heidelberg, pp 388\u2013400. https:\/\/doi.org\/10.1007\/978-3-540-45087-0_33"},{"key":"847_CR103","doi-asserted-by":"crossref","unstructured":"Wang Y, Romano S, Nguyen V et\u00a0al (2017) Unbiased multivariate correlation analysis. In: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17), https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/10778","DOI":"10.1609\/aaai.v31i1.10778"},{"issue":"1","key":"847_CR104","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1147\/rd.41.0066","volume":"4","author":"S Watanabe","year":"1960","unstructured":"Watanabe S (1960) Information theoretical analysis of multivariate correlation. IBM J Res Dev 4(1):66\u201382. https:\/\/doi.org\/10.1147\/rd.41.0066","journal-title":"IBM J Res Dev"},{"key":"847_CR105","unstructured":"White JV, Steingold S, Fournelle C (2004) Performance metrics for group-detection algorithms. In: Said YH, Marchette DJ, Solka JL (eds) Computing Science and Statistics: Computational Biology and Informatics - Proceedings of the 36th Symposium on the Interface, Baltimore, Maryland, https:\/\/www.interfacesymposia.org\/I04\/I2004Proceedings\/WhiteJim\/WhiteJim.paper.pdf"},{"issue":"9","key":"847_CR106","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1109\/T-C.1971.223410","volume":"C\u201320","author":"AW Whitney","year":"1971","unstructured":"Whitney AW (1971) A direct method of nonparametric measurement selection. IEEE Trans Comput C\u201320(9):1100\u20131103. https:\/\/doi.org\/10.1109\/T-C.1971.223410","journal-title":"IEEE Trans Comput"},{"issue":"7","key":"847_CR107","doi-asserted-by":"publisher","first-page":"1391","DOI":"10.1162\/neco.1996.8.7.1391","volume":"8","author":"DH Wolpert","year":"1996","unstructured":"Wolpert DH (1996) The existence of a priori distinctions between learning algorithms. Neural Comput 8(7):1391\u20131420. https:\/\/doi.org\/10.1162\/neco.1996.8.7.1391","journal-title":"Neural Comput"},{"issue":"7","key":"847_CR108","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.1162\/neco.1996.8.7.1341","volume":"8","author":"DH Wolpert","year":"1996","unstructured":"Wolpert DH (1996) The lack of a priori distinctions between learning algorithms. Neural Comput 8(7):1341\u20131390. https:\/\/doi.org\/10.1162\/neco.1996.8.7.1341","journal-title":"Neural Comput"},{"key":"847_CR109","unstructured":"Wolpert DH, Macready WG (1995) No free lunch theorems for search. Technical Report SFI-TR-95-02-010\u00a010, Santa Fe Institute, https:\/\/www.santafe.edu\/research\/results\/working-papers\/no-free-lunch-theorems-for-search"},{"issue":"1","key":"847_CR110","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67\u201382. https:\/\/doi.org\/10.1109\/4235.585893","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"847_CR111","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s40745-015-0040-1","volume":"2","author":"D Xu","year":"2015","unstructured":"Xu D, Tian Y (2015) A comprehensive survey of clustering algorithms. Ann Data Sci 2(2):165\u2013193. https:\/\/doi.org\/10.1007\/s40745-015-0040-1","journal-title":"Ann Data Sci"},{"issue":"12","key":"847_CR112","doi-asserted-by":"publisher","first-page":"1797","DOI":"10.1016\/S0008-8846(98)00165-3","volume":"28","author":"IC Yeh","year":"1998","unstructured":"Yeh IC (1998) Modeling of strength of high-performance concrete using artificial neural networks. Cem Concr Res 28(12):1797\u20131808. https:\/\/doi.org\/10.1016\/S0008-8846(98)00165-3","journal-title":"Cem Concr Res"},{"issue":"6","key":"847_CR113","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1016\/0031-3203(93)90054-Z","volume":"26","author":"B Yu","year":"1993","unstructured":"Yu B, Yuan B (1993) A more efficient branch and bound algorithm for feature selection. Pattern Recogn 26(6):883\u2013889. https:\/\/doi.org\/10.1016\/0031-3203(93)90054-Z","journal-title":"Pattern Recogn"},{"issue":"1","key":"847_CR114","doi-asserted-by":"publisher","first-page":"99","DOI":"10.3390\/e21010099","volume":"21","author":"S Yu","year":"2019","unstructured":"Yu S, Pr\u00edncipe JC (2019) Simple stopping criteria for information theoretic feature selection. Entropy 21(1):99. https:\/\/doi.org\/10.3390\/e21010099","journal-title":"Entropy"},{"issue":"4","key":"847_CR115","doi-asserted-by":"publisher","first-page":"860","DOI":"10.3390\/e13040860","volume":"13","author":"Y Zheng","year":"2011","unstructured":"Zheng Y, Kwoh CK (2011) A feature subset selection method based on high-dimensional mutual information. Entropy 13(4):860\u2013901. https:\/\/doi.org\/10.3390\/e13040860","journal-title":"Entropy"},{"issue":"12","key":"847_CR116","doi-asserted-by":"publisher","first-page":"5839","DOI":"10.1103\/PhysRevB.22.5839","volume":"22","author":"A Zunger","year":"1980","unstructured":"Zunger A (1980) Systematization of the stable crystal structure of all $${\\rm AB}$$-type binary compounds: A pseudopotential orbital-radii approach. Phys Rev B 22(12):5839\u20135872. https:\/\/doi.org\/10.1103\/PhysRevB.22.5839","journal-title":"Phys Rev B"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-022-00847-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-022-00847-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-022-00847-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,6]],"date-time":"2022-10-06T10:13:27Z","timestamp":1665051207000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-022-00847-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,29]]},"references-count":116,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["847"],"URL":"https:\/\/doi.org\/10.1007\/s10618-022-00847-y","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2022,7,29]]},"assertion":[{"value":"20 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}