Krahasoni metodat

	Rrjeti me kapsula	Pylli i Rastësishëm	Makineria e Vektorëve Mbështetës (Klasifikimi)
Fusha	Mësimi i thellë	Mësimi i makinës	Mësimi i makinës
Familja	Machine learning	Machine learning	Machine learning
Viti i origjinës	2017	2001	1995
Krijuesi	Sabour, S., Frosst, N. & Hinton, G. E.	Breiman, L.	Cortes, C. & Vapnik, V.
Lloji	Deep learning architecture (vector capsules with dynamic routing)	Ensemble (bagging of decision trees)	Maximum-margin classifier (kernel method)
Burimi themelues	Sabour, S., Frosst, N. & Hinton, G. E. (2017). Dynamic Routing Between Capsules. Advances in Neural Information Processing Systems (NeurIPS).	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.	Cortes, C. & Vapnik, V. (1995). Support-Vector Networks. Machine Learning, 20, 273–297.
Emërtime të tjera	Kapsül Ağı (CapsNet), CapsNet, capsule net, dynamic routing network	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble	Destek Vektör Makinesi (SVM — Sınıflandırma), support-vector network, SVM classifier, maximum-margin classifier
Të lidhura	4	4	5
Përmbledhja	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.