ScholarGate
Ассистент

Сравнение методов

Просматривайте выбранные методы рядом; строки с различиями подсвечены.

Капсульная сеть×Случайный лес×Метод опорных векторов (классификация)×
ОбластьГлубокое обучениеМашинное обучениеМашинное обучение
СемействоMachine learningMachine learningMachine learning
Год появления201720011995
Автор методаSabour, S., Frosst, N. & Hinton, G. E.Breiman, L.Cortes, C. & Vapnik, V.
ТипDeep learning architecture (vector capsules with dynamic routing)Ensemble (bagging of decision trees)Maximum-margin classifier (kernel method)
Основополагающий источникSabour, S., Frosst, N. & Hinton, G. E. (2017). Dynamic Routing Between Capsules. Advances in Neural Information Processing Systems (NeurIPS). link ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗Cortes, C. & Vapnik, V. (1995). Support-Vector Networks. Machine Learning, 20, 273–297. DOI ↗
Другие названияKapsül Ağı (CapsNet), CapsNet, capsule net, dynamic routing networkRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensembleDestek Vektör Makinesi (SVM — Sınıflandırma), support-vector network, SVM classifier, maximum-margin classifier
Связанные445
СводкаA Capsule Network (CapsNet) is a deep learning architecture introduced by Sara Sabour, Nicholas Frosst and Geoffrey Hinton in 2017 that organises neurons as vectors (capsules) rather than scalar activations, so that spatial hierarchy and pose (orientation) information are encoded directly. It was proposed to overcome the fragility of convolutional networks to changes in viewpoint.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.The Support Vector Machine, introduced by Corinna Cortes and Vladimir Vapnik in 1995, is a classifier that finds the optimal separating hyperplane between classes in a high-dimensional space. It chooses the boundary that leaves the widest possible margin to the nearest training points, which makes its decisions robust on new data.
ScholarGateНабор данных
  1. v1
  2. 2 Источники
  3. PUBLISHED
  1. v1
  2. 2 Источники
  3. PUBLISHED
  1. v1
  2. 1 Источники
  3. PUBLISHED

Перейти к поиску Скачать слайды

ScholarGateСравнение методов: Capsule Network · Random Forest · Support Vector Machine. Получено 2026-06-19 из https://scholargate.app/ru/compare