Comparar métodos

	Busca de Arquitetura Neural	Random Forest	Máquina de Vetores de Suporte (Classificação)
Área	Aprendizado profundo	Aprendizado de máquina	Aprendizado de máquina
Família	Machine learning	Machine learning	Machine learning
Ano de origem	2017	2001	1995
Autor original	Zoph, B. & Le, Q.V.	Breiman, L.	Cortes, C. & Vapnik, V.
Tipo	Automated architecture optimization (deep learning)	Ensemble (bagging of decision trees)	Maximum-margin classifier (kernel method)
Fonte seminal	Zoph, B. & Le, Q.V. (2017). Neural Architecture Search with Reinforcement Learning. ICLR.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.	Cortes, C. & Vapnik, V. (1995). Support-Vector Networks. Machine Learning, 20, 273–297.
Outros nomes	Nöral Mimari Arama (NAS), NAS, automated architecture design, differentiable architecture search	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
Relacionados	5	4	5
Resumo	Neural Architecture Search (NAS), introduced by Zoph and Le in 2017, automatically optimizes architectural decisions such as a network's depth, width, and connection structure instead of hand-designing them. Leading methods in the field include DARTS, ENAS, and Once-for-All.	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.