Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Bayesian Metric Learning× | Bayesiansk Gaussisk Process× | |
|---|---|---|
| Ämnesområde | Maskininlärning | Maskininlärning |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 2010s | 1978–2006 |
| Upphovsperson≠ | Multiple (Xing et al. 2002; Weinberger & Saul 2009; probabilistic extensions by various authors ~2010s) | O'Hagan, A.; Neal, R. M.; Rasmussen, C. E. & Williams, C. K. I. |
| Typ≠ | Probabilistic distance metric learning | Probabilistic kernel model |
| Ursprungskälla≠ | Weinberger, K. Q., & Saul, L. K. (2009). Distance metric learning for large margin nearest neighbor classification. Journal of Machine Learning Research, 10, 207–244. link ↗ | Rasmussen, C. E., & Williams, C. K. I. (2006). Gaussian Processes for Machine Learning. MIT Press. ISBN: 978-0-262-18253-9 |
| Alias | BML, probabilistic metric learning, Bayesian distance metric learning, Bayesian similarity learning | GP regression, GPR, Gaussian process model, GP classifier |
| Närliggande≠ | 5 | 3 |
| Sammanfattning≠ | Bayesian Metric Learning frames the problem of learning a task-adapted distance function as probabilistic inference. Rather than producing a single optimal metric matrix, it places a prior over metrics, updates it with pairwise similarity or label constraints, and yields a posterior distribution that quantifies uncertainty about which metric best captures the true structure of the data. | A Bayesian Gaussian Process (GP) places a probability distribution directly over functions, using a kernel to encode similarity between inputs. After observing data, Bayes' rule converts this prior into a posterior that yields not just point predictions but calibrated uncertainty estimates at every new input — making it one of the most principled probabilistic models in machine learning. |
| ScholarGateDatamängd ↗ |
|
|