Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Diffusionsmodell× | Random Forest× | Support Vector Machine (Klassificering)× | |
|---|---|---|---|
| Ämnesområde≠ | Djupinlärning | Maskininlärning | Maskininlärning |
| Familj | Machine learning | Machine learning | Machine learning |
| Ursprungsår≠ | 2020 | 2001 | 1995 |
| Upphovsperson≠ | Ho, J., Jain, A. & Abbeel, P. | Breiman, L. | Cortes, C. & Vapnik, V. |
| Typ≠ | Generative deep learning (denoising diffusion) | Ensemble (bagging of decision trees) | Maximum-margin classifier (kernel method) |
| Ursprungskälla≠ | Ho, J., Jain, A. & Abbeel, P. (2020). Denoising Diffusion Probabilistic Models. 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 ↗ |
| Alias≠ | Difüzyon Modeli (DDPM / Stable Diffusion), difüzyon modeli, denoising diffusion model, DDPM | 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 |
| Närliggande≠ | 4 | 4 | 5 |
| Sammanfattning≠ | A diffusion model is a generative deep-learning method, introduced by Ho, Jain and Abbeel in 2020 (DDPM), that learns to produce high-quality images, audio and molecular structures by reversing a step-by-step noising process. It has largely displaced GANs as the current state of the art in generative modelling. | 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. |
| ScholarGateDatamängd ↗ |
|
|
|