Záznam dôkazov metódy

Regularized k-nearest neighbors

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.

Sources recorded, not reviewed

Zdrojový záznam

Citácie skopírované doslovne zo zdrojového záznamu metódy. Nevyplýva z nich žiadne overenie na úrovni tvrdenia.

Regularized k-Nearest Neighbors (Kernel-Weighted kNN)

Taxonomický záznam metódy · ml-model / machine-learning

Cover, T. & Hart, P. (1967). Nearest neighbor pattern classification. IEEE Transactions on Information Theory, 13(1), 21–27. · DOI 10.1109/TIT.1967.1053964
Hastie, T., Tibshirani, R. & Friedman, J. (2009). The Elements of Statistical Learning (2nd ed., Ch. 13). Springer. · ISBN 978-0-387-84858-7

Otvoriť celú metódu

Spracované tvrdenia

Tvrdenia uložené v registri dôkazov, každé s vlastným hodnotením.

Zatiaľ žiadne spracované tvrdenia

Tento pohľad nevymýšľa hodnotenie tvrdenia, ak register žiadne nemá.

Súvisiace metódy

Vygenerované z grafu metód a zobrazené ako vzťahy navrhnuté strojom – nevyplýva z nich žiadne tvrdenie o dôkaze.

Taxonomic bucketGaussian Processmachine-suggested · Relational suggestion, not evidence.Taxonomic bucketRegularized Gaussian Processmachine-suggested · Relational suggestion, not evidence.Taxonomic bucketRegularized Logistic Regressionmachine-suggested · Relational suggestion, not evidence.Taxonomic bucketRegularized Support Vector Machinemachine-suggested · Relational suggestion, not evidence.