ScholarGate
Βοηθός

Σύγκριση μεθόδων

Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.

Τυχαίο Δάσος×Μηχανή Υποστήριξης Διανυσμάτων (Ταξινόμηση)×Μετασχηματιστής (Επεξεργασία Φυσικής Γλώσσας)×
ΠεδίοΜηχανική ΜάθησηΜηχανική ΜάθησηΒαθιά Μάθηση
ΟικογένειαMachine learningMachine learningMachine learning
Έτος προέλευσης200119952017
ΔημιουργόςBreiman, L.Cortes, C. & Vapnik, V.Vaswani, A. et al.
ΤύποςEnsemble (bagging of decision trees)Maximum-margin classifier (kernel method)Attention-based deep neural network
Θεμελιώδης πηγή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 ↗Vaswani, A. et al. (2017). Attention Is All You Need. NeurIPS. link ↗
Εναλλακτικές ονομασίεςRastgele 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 classifierTransformer Modeli (NLP), attention-based language model, self-attention network, transformer NLP
Συναφείς454
Σύνοψη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.The Transformer is an attention-based deep learning model, introduced by Vaswani and colleagues in 2017, that performs text classification, named-entity recognition, and language modelling by letting every token in a sequence attend directly to every other token. It replaced earlier recurrent designs with a self-attention mechanism that processes whole sequences in parallel.
ScholarGateΣύνολο δεδομένων
  1. v1
  2. 2 Πηγές
  3. PUBLISHED
  1. v1
  2. 1 Πηγές
  3. PUBLISHED
  1. v1
  2. 1 Πηγές
  3. PUBLISHED

Μετάβαση στην αναζήτηση Λήψη διαφανειών

ScholarGateΣύγκριση μεθόδων: Random Forest · Support Vector Machine · Transformer. Ανακτήθηκε στις 2026-06-18 από https://scholargate.app/el/compare