방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 정규화 k-최근접 이웃× | 정규화된 가우시안 과정× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 1967–2000s | 2006 (canonical formulation); kernel regularization roots 1990s |
| 창시자≠ | Extends Cover & Hart (1967); regularization formulations developed through kernel smoothing literature | Rasmussen, C. E. & Williams, C. K. I. |
| 유형≠ | Instance-based / lazy learner with regularization | Probabilistic kernel model with regularization |
| 원전≠ | Cover, T. & Hart, P. (1967). Nearest neighbor pattern classification. IEEE Transactions on Information Theory, 13(1), 21–27. DOI ↗ | Rasmussen, C. E., & Williams, C. K. I. (2006). Gaussian Processes for Machine Learning. MIT Press. ISBN: 978-0-262-18253-9 |
| 별칭 | regularized kNN, kernel-weighted kNN, distance-regularized nearest neighbors, kNN with regularization | Regularized GP, GP with noise regularization, sparse regularized Gaussian process, regularized Gaussian process regression |
| 관련 | 4 | 4 |
| 요약≠ | 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. | A Regularized Gaussian Process (GP) is a probabilistic kernel-based model that places a prior over functions and explicitly controls overfitting through a noise regularization parameter — the observation noise variance — that prevents the model from memorizing training labels. It produces calibrated uncertainty estimates alongside predictions, making it uniquely suited to small or expensive datasets where knowing how confident the model is matters as much as the prediction itself. |
| ScholarGate데이터셋 ↗ |
|
|