ScholarGate
Asisten

Bandingkan metode

Tinjau metode pilihan Anda berdampingan; baris yang berbeda akan disorot.

UMAP×Random Forest×
BidangPembelajaran MesinPembelajaran Mesin
KeluargaMachine learningMachine learning
Tahun asal20182001
PencetusMcInnes, L.; Healy, J.; Melville, J.Breiman, L.
TipeNonlinear manifold-learning dimension reductionEnsemble (bagging of decision trees)
Sumber perintisMcInnes, 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 ↗
AliasUMAP (Uniform Manifold Approximation and Projection), uniform manifold approximation and projection, manifold dimension reductionRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Terkait54
RingkasanUMAP (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.
ScholarGateSet data
  1. v1
  2. 1 Sumber
  3. PUBLISHED
  1. v1
  2. 2 Sumber
  3. PUBLISHED

Ke halaman pencarian Unduh salindia

ScholarGateBandingkan metode: UMAP · Random Forest. Diakses 2026-06-18 dari https://scholargate.app/id/compare