Home › Entities › academia › Fast-mRMR: Fast Minimum Redundancy Maximum Relevance Algorithm for High-Dimensional Big Data

Fast-mRMR: Fast Minimum Redundancy Maximum Relevance Algorithm for High-Dimensional Big Data

Research article (International Journal of Intelligent Systems, 2016) · cited 196× · AI/ML
academia openalex:W2475596014
Press Enter · cited answer in seconds

Fast-mRMR: Fast Minimum Redundancy Maximum Relevance Algorithm for High-Dimensional Big Data

Summary

Fast-mRMR: Fast Minimum Redundancy Maximum Relevance Algorithm for High-Dimensional Big Data is a scholarly article[1].

Key Facts

  • Fast-mRMR: Fast Minimum Redundancy Maximum Relevance Algorithm for High-Dimensional Big Data's instance of is recorded as scholarly article[2].

Related Entities

Amparo Alonso Betanzos Francisco Herrera Verónica Bolón Canedo

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Fast-mRMR: Fast Minimum Redundancy Maximum Relevance Algorithm for High-Dimensional Big Data. Retrieved May 24, 2026, from https://4ort.xyz/entity/fast-mrmr-fast-minimum-redundancy-maximum-relevance-algorithm-for-high-dimensional-big-data
MLA “Fast-mRMR: Fast Minimum Redundancy Maximum Relevance Algorithm for High-Dimensional Big Data.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/fast-mrmr-fast-minimum-redundancy-maximum-relevance-algorithm-for-high-dimensional-big-data.
BibTeX @misc{4ortxyz_fast-mrmr-fast-minimum-redundancy-maximum-relevance-algorithm-for-high-dimensional-big-data_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Fast-mRMR: Fast Minimum Redundancy Maximum Relevance Algorithm for High-Dimensional Big Data}}, year = {2026}, url = {https://4ort.xyz/entity/fast-mrmr-fast-minimum-redundancy-maximum-relevance-algorithm-for-high-dimensional-big-data}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Fast-mRMR: Fast Minimum Redundancy Maximum Relevance Algorithm for High-Dimensional Big Data — https://4ort.xyz/entity/fast-mrmr-fast-minimum-redundancy-maximum-relevance-algorithm-for-high-dimensional-big-data (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/fast-mrmr-fast-minimum-redundancy-maximum-relevance-algorithm-for-high-dimensional-big-data · Last refreshed: