MRMD2.0: A Python Tool for Machine Learning with Feature Ranking and Reduction
The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Aims: The study aims to find a way to reduce the dimensionality of the dataset. Background: Dimensionality reduction is the key issue of the machine learning process. It does not only improve the prediction performance but also could recommend the intrinsic features and help to explore the biological expression of the machine learning “black box”. Objective: A variety of feature selection algorithms are used to select data features to achieve dimensionality reduction. Methods: First, MRMD2.0 integrated 7 different popular feature ranking algorithms with PageRank strategy. Second, optimized dimensionality was detected with forward adding strategy. Result: We have achieved good results in our experiments. Conclusion: Several works have been tested with MRMD2.0. It showed well performance. Otherwise, it also can draw the performance curves according to the feature dimensionality. If users want to sacrifice accuracy for fewer features, they can select the dimensionality from the performance curves. Other: We developed friendly python tools together with the web server. The users could upload their csv, arff or libsvm format files. Then the webserver would help to rank features and find the optimized dimensionality.
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
Top 10 algorithms in data mining
Wu, X., Kumar, V., Ross Quinlan, J., Ghosh, J., Yang, Q., Motoda, H., McLachlan, G. J., Ng, A., Liu, B., Yu, P. S., et al. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-007-0114-2 · Cited by 5,667
Cancer Diagnosis Through IsomiR Expression with Machine Learning Method
Liao, Z., Li, D., Wang, X., Li, L., & Zou, Q. (2018) · Current Bioinformatics · doi:10.2174/1574893611666160609081155 · Cited by 130
Self-citationAn Efficient Classifier for Alzheimer’s Disease Genes Identification
Xu, L., Liang, G., Liao, C., Chen, G.-D., & Chang, C.-C. (2018) · Molecules · doi:10.3390/molecules23123140 · Cited by 107
SeqSVM: A Sequence-Based Support Vector Machine Method for Identifying Antioxidant Proteins
Xu, L., Liang, G., Shi, S., & Liao, C. (2018) · International Journal of Molecular Sciences · doi:10.3390/ijms19061773 · Cited by 95
A survey on online feature selection with streaming features
Hu, X., Zhou, P., Li, P., Wang, J., & Wu, X. (2018) · Frontiers of Computer Science · doi:10.1007/s11704-016-5489-3 · Cited by 88
Cited by
The Colony Predation Algorithm
Tu, J., Chen, H., Wang, M., & Gandomi, A. H. (2021) · Journal of Bionic Engineering · doi:10.1007/s42235-021-0050-y · Cited by 571
Modeling of CO2 capture ability of [Bmim][BF4] ionic liquid using connectionist smart paradigms
Daryayehsalameh, B., Nabavi, M., & Vaferi, B. (2021) · Environmental Technology & Innovation · doi:10.1016/j.eti.2021.101484 · Cited by 111
Xie, X., Wu, C., Ma, C., Gao, D., Su, W., Huang, J., Deng, K., Yan, D., & Lin, H. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2024.124702 · Cited by 17
The Roles of Cloud-Based Systems on the Cancer-Related Studies: A Systematic Literature Review
Xu, B., & Zhou, F. (2022) · IEEE Access · doi:10.1109/access.2022.3181147 · Cited by 13
Xie, X., Wu, C., Yang, Y., Su, W., Dao, F., Huang, J., Shi, Z., Lyu, H., & Lin, H. (2025) · Cardiovascular Diabetology · doi:10.1186/s12933-025-02865-8 · Cited by 10
“…feature selection algorithms were applied to calculate the importance scores and rankings of all features, including maximal information coefficient (MIC), analysis of variance (ANOVA), F-score, principal component analysis (PCA), gradient boosting decision tree (GBDT), and gini impurity [38, 39].”
Metadata
- Authors
- He, S., Guo, F., Zou, Q., & HuiDing
- Venue
- Current Bioinformatics
- Publisher
- Bentham Science Publishers Ltd.
- Published
- 2021-02-10
- Volume
- 15
- Issue
- 10
- Pages
- 1213-1221
- ISSN
- 1574-8936 (ISSN-L)
- OpenAlex
- W3022704604
- Cited by
- 184
- References
- 5
- FWCI
- 10.37
- Type
- journal article
- Language
- en
- Open access
- closed
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: MRMD2.0: A Python Tool for Machine Learning with Feature Ranking and Reduction. https://app.cochat.ai/papers/10.2174/1574893615999200503030350
- The paper
- He, S., Guo, F., Zou, Q., & HuiDing. (2021). MRMD2.0: A Python Tool for Machine Learning with Feature Ranking and Reduction. Current Bioinformatics. https://doi.org/10.2174/1574893615999200503030350
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.