ScholarGate
دستیار

مقایسهٔ روش‌ها

روش‌های انتخابی خود را کنار هم مرور کنید؛ ردیف‌های متفاوت برجسته شده‌اند.

یو-مپ×جنگل تصادفی×
حوزهیادگیری ماشینیادگیری ماشین
خانوادهMachine learningMachine learning
سال پیدایش20182001
پدیدآورMcInnes, L.; Healy, J.; Melville, J.Breiman, L.
نوعNonlinear manifold-learning dimension reductionEnsemble (bagging of decision trees)
منبع بنیادینMcInnes, L., Healy, J. & Melville, J. (2018). UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction. arXiv:1802.03426. link ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
نام‌های دیگرUMAP (Uniform Manifold Approximation and Projection), uniform manifold approximation and projection, manifold dimension reductionRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
مرتبط54
خلاصهUMAP (Uniform Manifold Approximation and Projection) is a fast, scalable nonlinear dimension-reduction method grounded in manifold-learning theory, introduced by McInnes, Healy and Melville in 2018. It compresses high-dimensional data into a low-dimensional embedding for visualisation and downstream analysis.Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.
ScholarGateمجموعه‌داده
  1. v1
  2. 1 منابع
  3. PUBLISHED
  1. v1
  2. 2 منابع
  3. PUBLISHED

رفتن به جست‌وجو دریافت اسلایدها

ScholarGateمقایسهٔ روش‌ها: UMAP · Random Forest. بازیابی‌شده در 2026-06-17 از https://scholargate.app/fa/compare