{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T13:51:46Z","timestamp":1778161906911,"version":"3.51.4"},"reference-count":44,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2022,2,8]],"date-time":"2022-02-08T00:00:00Z","timestamp":1644278400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["MAKE"],"abstract":"<jats:p>Datasets with thousands of features represent a challenge for many of the existing learning methods because of the well known curse of dimensionality. Not only that, but the presence of irrelevant and redundant features on any dataset can degrade the performance of any model where training and inference is attempted. In addition, in large datasets, the manual management of features tends to be impractical. Therefore, the increasing interest of developing frameworks for the automatic discovery and removal of useless features through the literature of Machine Learning. This is the reason why, in this paper, we propose a novel framework for selecting relevant features in supervised datasets based on a cascade of methods where speed and precision are in mind. This framework consists of a novel combination of Approximated and Simulate Annealing versions of the Maximal Information Coefficient (MIC) to generalize the simple linear relation between features. This process is performed in a series of steps by applying the MIC algorithms and cutoff strategies to remove irrelevant and redundant features. The framework is also designed to achieve a balance between accuracy and speed. To test the performance of the proposed framework, a series of experiments are conducted on a large battery of datasets from SPECTF Heart to Sonar data. The results show the balance of accuracy and speed that the proposed framework can achieve.<\/jats:p>","DOI":"10.3390\/make4010007","type":"journal-article","created":{"date-parts":[[2022,2,8]],"date-time":"2022-02-08T23:37:48Z","timestamp":1644363468000},"page":"131-149","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Novel Framework for Fast Feature Selection Based on Multi-Stage Correlation Measures"],"prefix":"10.3390","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6260-7359","authenticated-orcid":false,"given":"Ivan-Alejandro","family":"Garcia-Ramirez","sequence":"first","affiliation":[{"name":"Department of Computer Science, Centro de Investigaci\u00f3n y de Estudios Avanzados del Instituto Polit\u00e9cnico Nacional, Zapopan 45017, Jalisco, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arturo","family":"Calderon-Mora","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Centro de Investigaci\u00f3n y de Estudios Avanzados del Instituto Polit\u00e9cnico Nacional, Zapopan 45017, Jalisco, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andres","family":"Mendez-Vazquez","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Centro de Investigaci\u00f3n y de Estudios Avanzados del Instituto Polit\u00e9cnico Nacional, Zapopan 45017, Jalisco, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susana","family":"Ortega-Cisneros","sequence":"additional","affiliation":[{"name":"Department of Electronic System Design, Centro de Investigaci\u00f3n y de Estudios Avanzados del Instituto Polit\u00e9cnico Nacional, Zapopan 45017, Jalisco, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Reyes-Amezcua","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Centro de Investigaci\u00f3n y de Estudios Avanzados del Instituto Polit\u00e9cnico Nacional, Zapopan 45017, Jalisco, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,2,8]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1040","DOI":"10.1631\/FITEE.1500441","article-title":"Big data storage technologies: A survey","volume":"18","author":"Siddiqa","year":"2017","journal-title":"Front. Inf. Technol. Electron. Eng."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"990","DOI":"10.1016\/j.tibtech.2020.12.008","article-title":"Novel modalities in DNA data storage","volume":"39","author":"Lim","year":"2021","journal-title":"Trends Biotechnol."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.acra.2019.10.006","article-title":"Exploring large-scale public medical image datasets","volume":"27","year":"2020","journal-title":"Acad. Radiol."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"341","DOI":"10.3390\/make1010020","article-title":"Recent advances in supervised dimension reduction: A survey","volume":"1","author":"Chao","year":"2019","journal-title":"Mach. Learn. Knowl. Extr."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1518","DOI":"10.1126\/science.1205438","article-title":"Detecting novel associations in large data sets","volume":"334","author":"Reshef","year":"2011","journal-title":"Science"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Dash, M., Liu, H., and Motoda, H. (2000, January 18\u201320). Consistency based feature selection. Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining, Kyoto, Japan.","DOI":"10.1007\/3-540-45571-X_13"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Liul, H., Motoda, H., and Dash, M. (1998, January 21\u201323). A monotonic measure for optimal feature selection. Proceedings of the 10th European Conference on Machine Learning, Chemnitz, Germany.","DOI":"10.1007\/BFb0026678"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.mineng.2018.12.004","article-title":"Machine learning applications in minerals processing: A review","volume":"132","author":"McCoy","year":"2019","journal-title":"Miner. Eng."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1038\/nrg3920","article-title":"Machine learning applications in genetics and genomics","volume":"16","author":"Libbrecht","year":"2015","journal-title":"Nat. Rev. Genet."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"101816","DOI":"10.1016\/j.jobe.2020.101816","article-title":"Machine learning applications for building structural design and performance assessment: State-of-the-art review","volume":"33","author":"Sun","year":"2021","journal-title":"J. Build. Eng."},{"key":"ref_11","unstructured":"Bishop, C.M. (2006). Pattern Recognition and Machine Learning (Information Science and Statistics), Springer."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Hastie, T., Tibshirani, R., and Friedman, J. (2009). The Elements of Statistical Learning: Data Mining, Inference, and Prediction, Springer. [2nd ed.].","DOI":"10.1007\/978-0-387-84858-7"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"211","DOI":"10.6029\/smartcr.2014.03.007","article-title":"Feature selection: A literature review","volume":"4","author":"Kumar","year":"2014","journal-title":"SmartCR"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1080\/14786440109462720","article-title":"LIII. On lines and planes of closest fit to systems of points in space","volume":"2","author":"Pearson","year":"1901","journal-title":"London Edinburgh Dublin Philos. Mag. J. Sci."},{"key":"ref_15","unstructured":"Britain, R.S.G. (1895). Proceedings of the Royal Society of London, Taylor & Francis."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1111\/j.1469-1809.1936.tb02137.x","article-title":"The use of multiple measurements in taxonomic problems","volume":"7","author":"Fisher","year":"1936","journal-title":"Ann. Eugen."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1111\/j.2517-6161.1948.tb00008.x","article-title":"The utilization of multiple measurements in problems of biological classification","volume":"10","author":"Rao","year":"1948","journal-title":"J. R. Stat. Soc. Ser. Methodol."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"2323","DOI":"10.1126\/science.290.5500.2323","article-title":"Nonlinear dimensionality reduction by locally linear embedding","volume":"290","author":"Roweis","year":"2000","journal-title":"Science"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1126\/science.295.5552.7a","article-title":"The isomap algorithm and topological stability","volume":"295","author":"Balasubramanian","year":"2002","journal-title":"Science"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1373","DOI":"10.1162\/089976603321780317","article-title":"Laplacian eigenmaps for dimensionality reduction and data representation","volume":"15","author":"Belkin","year":"2003","journal-title":"Neural Comput."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1226","DOI":"10.1109\/TPAMI.2005.159","article-title":"Feature selection based on mutual information criteria of max-dependency, max-relevance, and min-redundancy","volume":"27","author":"Peng","year":"2005","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_22","first-page":"2579","article-title":"Visualizing data using t-SNE","volume":"9","author":"Maaten","year":"2008","journal-title":"J. Mach. Learn. Res."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"McInnes, L., Healy, J., and Melville, J. (2018). Umap: Uniform manifold approximation and projection for dimension reduction. arXiv.","DOI":"10.21105\/joss.00861"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s10115-012-0487-8","article-title":"A review of feature selection methods on synthetic data","volume":"34","year":"2013","journal-title":"Knowl. Inf. Syst."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1037","DOI":"10.1002\/asi.21023","article-title":"Ambiguity measure feature-selection algorithm","volume":"60","author":"Mengle","year":"2009","journal-title":"J. Am. Soc. Inf. Sci. Technol."},{"key":"ref_26","first-page":"316","article-title":"Feature selection algorithm based on conditional dynamic mutual information","volume":"8","author":"Liping","year":"2015","journal-title":"Int. J. Smart Sens. Intell. Syst."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Shin, K., and Xu, X.M. (2009, January 28\u201330). Consistency-based feature selection. Proceedings of the International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, Santiago, Chile.","DOI":"10.1007\/978-3-642-04595-0_42"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Benesty, J., Chen, J., Huang, Y., and Cohen, I. (2009). Pearson correlation coefficient. Noise Reduction in Speech Processing, Springer.","DOI":"10.1007\/978-3-642-00296-0_5"},{"key":"ref_29","unstructured":"Clark, M. (2013). A Comparison of Correlation Measures, Center for Social Research, University of Notre Dame."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"3354","DOI":"10.1073\/pnas.1309933111","article-title":"Equitability, mutual information, and the maximal information coefficient","volume":"111","author":"Kinney","year":"2014","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Gray, R.M. (1990). Entropy and Information Theory, Springer.","DOI":"10.1007\/978-1-4757-3982-4"},{"key":"ref_32","first-page":"bts707","article-title":"Minerva and minepy: A C engine for the MINE suite and its R, Python and MATLAB wrappers","volume":"29","author":"Albanese","year":"2012","journal-title":"Bioinformatics"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"11","DOI":"10.4137\/EBO.S13121","article-title":"RapidMic: Rapid Computation of the Maximal Information Coefficient","volume":"10","author":"Tang","year":"2014","journal-title":"Evol. Bioinform. Online"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1007\/BF01009452","article-title":"Optimization by simulated annealing: Quantitative studies","volume":"34","author":"Kirkpatrick","year":"1984","journal-title":"J. Stat. Phys."},{"key":"ref_35","unstructured":"Yu, L., and Liu, H. (2003, January 21\u201324). Feature selection for high-dimensional data: A fast correlation-based filter solution. Proceedings of the 20th International Conference on Machine Learning (ICML-03), Washington, DC, USA."},{"key":"ref_36","unstructured":"Herlihy, M., and Shavit, N. (2008). The Art of Multiprocessor Programming, Morgan Kaufmann Publishers Inc."},{"key":"ref_37","unstructured":"Williams, A. (2012). C++ Concurrency in Action: Practical Multithreading, Manning."},{"key":"ref_38","unstructured":"Hennessy, J.L., and Patterson, D.A. (2011). Computer Architecture: A Quantitative Approach, Morgan Kaufmann Publishers Inc.. [5th ed.]."},{"key":"ref_39","unstructured":"Dua, D., and Graff, C. (2021, June 15). UCI Machine Learning Repository 2017. Available online: https:\/\/archive.ics.uci.edu\/ml\/index.php."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"27:1","DOI":"10.1145\/1961189.1961199","article-title":"LIBSVM: A library for support vector machines","volume":"2","author":"Chang","year":"2011","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"ref_41","first-page":"8952","article-title":"Feature Selection using Stochastic Gates","volume":"2020","author":"Yamada","year":"2020","journal-title":"Proc. Mach. Learn. Syst."},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Rogers, J., and Gunn, S. (2005). Identifying feature relevance using a random forest. International Statistical and Optimization Perspectives Workshop \u201cSubspace, Latent Structure and Feature Selection\", Springer.","DOI":"10.1007\/11752790_12"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"181683","DOI":"10.1109\/ACCESS.2020.3028039","article-title":"A Novel Decomposing Model With Evolutionary Algorithms for Feature Selection in Long Non-Coding RNAs","volume":"8","author":"Bonidia","year":"2020","journal-title":"IEEE Access"},{"key":"ref_44","first-page":"2825","article-title":"Scikit-learn: Machine Learning in Python","volume":"12","author":"Pedregosa","year":"2011","journal-title":"J. Mach. Learn. Res."}],"container-title":["Machine Learning and Knowledge Extraction"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2504-4990\/4\/1\/7\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:15:48Z","timestamp":1760134548000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2504-4990\/4\/1\/7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,8]]},"references-count":44,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,3]]}},"alternative-id":["make4010007"],"URL":"https:\/\/doi.org\/10.3390\/make4010007","relation":{},"ISSN":["2504-4990"],"issn-type":[{"value":"2504-4990","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,8]]}}}