ScholarGate
المساعد

قارن الطرق

راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.

تعلم المقاييس المجمعة (Ensemble Metric Learning)×الغابات العشوائية×
المجالتعلم الآلةتعلم الآلة
العائلةMachine learningMachine learning
سنة النشأة2000s–2010s2001
صاحب الطريقةMultiple contributors (Weinberger, Saul, et al.)Breiman, L.
النوعEnsemble of learned distance metricsEnsemble (bagging of decision trees)
المصدر التأسيسيWang, J., Kalousis, A., & Woznica, A. (2012). Parametric local metric learning for nearest neighbor classification. Advances in Neural Information Processing Systems, 25. link ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
الأسماء البديلةEML, ensemble distance metric learning, multiple metric fusion, combined metric learningRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
ذات صلة54
الملخصEnsemble Metric Learning trains multiple distance metric learners — each on a different data view, feature subspace, or with a different objective — and combines the resulting metrics to produce a single, more robust similarity function. Combining diverse metrics reduces the variance of any individual metric and improves performance in tasks such as nearest-neighbor classification, retrieval, and few-shot learning.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. 2 المصادر
  3. PUBLISHED
  1. v1
  2. 2 المصادر
  3. PUBLISHED

انتقل إلى البحث تنزيل الشرائح

ScholarGateقارن الطرق: Ensemble Metric Learning · Random Forest. استُرجع بتاريخ 2026-06-18 من https://scholargate.app/ar/compare