Fast-mRMR: Fast Minimum Redundancy Maximum Relevance Algorithm for High-Dimensional Big Data: FAST-mRMR ALGORITHM FOR BIG DATA
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
With the advent of large-scale problems, feature selection has become a fundamental preprocessing step to reduce input dimensionality. The minimum-redundancy-maximum-relevance (mRMR) selector is considered one of the most relevant methods for dimensionality reduction due to its high accuracy. However, it is a computationally expensive technique, sharply affected by the number of features. This paper presents fast-mRMR, an extension of mRMR, which tries to overcome this computational burden. Associated with fast-mRMR, we include a package with three implementations of this algorithm in several platforms, namely, CPU for sequential execution, GPU (graphics processing units) for parallel computing, and Apache Spark for distributed computing using big data technologies.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fast support vector machine training and classification on graphics processors
Catanzaro, B., Sundaram, N., & Keutzer, K. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390170 · Cited by 372
Cited by
Ensembles for feature selection: A review and future trends
Bolón-Canedo, V., & Alonso-Betanzos, A. (2019) · Information Fusion · doi:10.1016/j.inffus.2018.11.008 · Cited by 541
Self-citationYun, K. K., Yoon, S. W., & Won, D. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.115716 · Cited by 287
Ramírez-Gallego, S., Fernández, A., García, S., Chen, M., & Herrera, F. (2018) · Information Fusion · doi:10.1016/j.inffus.2017.10.001 · Cited by 140
Self-citationMeng, L., Zhang, A., Chen, C., Wang, X., Jiang, X., Tao, L., Fan, J., Wu, X., Dai, C., Zhang, Y., et al. (2021) · Sensors · doi:10.3390/s21030799 · Cited by 45
“As for the feature selection, The minimum-redundancy maximum-relevancy (mRMR) [49] was adopted as the feature selection method to prune the number of features and improve the accuracy of evaluation systems [50].”
MethodDeep multi-modal fusion network with gated unit for breast cancer survival prediction
Yuan, H., & Xu, H. (2024) · Computer Methods in Biomechanics and Biomedical Engineering · doi:10.1080/10255842.2023.2211188 · Cited by 10
Metadata
- Authors
- Ramírez-Gallego, S., Lastra, I., Martínez-Rego, D., Bolón-Canedo, V., Benítez, J. M., Herrera, F., & Alonso-Betanzos, A.
- Venue
- International Journal of Intelligent Systems
- Publisher
- Hindawi Limited
- Published
- 2016-07-09
- Volume
- 32
- Issue
- 2
- Pages
- 134-152
- ISSN
- 0884-8173 (ISSN-L)
- OpenAlex
- W2475596014
- Cited by
- 201
- References
- 1
- FWCI
- 10.27
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fast-mRMR: Fast Minimum Redundancy Maximum Relevance Algorithm for High-Dimensional Big Data: FAST-mRMR ALGORITHM FOR BIG DATA. https://app.cochat.ai/papers/10.1002/int.21833
- The paper
- Ramírez-Gallego, S., Lastra, I., Martínez-Rego, D., Bolón-Canedo, V., Benítez, J. M., Herrera, F., & Alonso-Betanzos, A. (2017). Fast-mRMR: Fast Minimum Redundancy Maximum Relevance Algorithm for High-Dimensional Big Data: FAST-mRMR ALGORITHM FOR BIG DATA. International Journal of Intelligent Systems. https://doi.org/10.1002/int.21833
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.