Porovnat metody
Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.
| Regularizovaný Gaussovský Směsný Model× | Regularizovaný k-nejbližší sousedé× | |
|---|---|---|
| Obor | Strojové učení | Strojové učení |
| Rodina | Machine learning | Machine learning |
| Rok vzniku≠ | 2000s–2010s | 1967–2000s |
| Tvůrce≠ | Fraley, C. & Raftery, A. E. (regularization formalized); sklearn team (practical reg_covar parameter) | Extends Cover & Hart (1967); regularization formulations developed through kernel smoothing literature |
| Typ≠ | Probabilistic clustering with regularization | Instance-based / lazy learner with regularization |
| Původní zdroj≠ | Fraley, C. & Raftery, A. E. (2002). Model-based clustering, discriminant analysis, and density estimation. Journal of the American Statistical Association, 97(458), 611–631. DOI ↗ | Cover, T. & Hart, P. (1967). Nearest neighbor pattern classification. IEEE Transactions on Information Theory, 13(1), 21–27. DOI ↗ |
| Další názvy | Regularized GMM, GMM with covariance regularization, stabilized Gaussian mixture model, penalized GMM | regularized kNN, kernel-weighted kNN, distance-regularized nearest neighbors, kNN with regularization |
| Příbuzné≠ | 5 | 4 |
| Shrnutí≠ | A Regularized Gaussian Mixture Model (GMM) adds a small positive constant to the diagonal of each component covariance matrix during the Expectation-Maximization algorithm, preventing singular or near-singular matrices that cause numerical failures when the data are sparse, high-dimensional, or contain near-duplicate observations. | Regularized k-Nearest Neighbors (kNN) extends the classical nearest-neighbor algorithm by incorporating regularization mechanisms — most commonly kernel-based distance weighting or bandwidth control — that smooth predictions, reduce sensitivity to the choice of k, and lower variance. The result is a more stable and better-calibrated instance-based learner for classification and regression tasks on tabular data. |
| ScholarGateDatová sada ↗ |
|
|