Efficient discriminative learning of parametric nearest neighbor classifiers
Linear SVMs are efficient in both training and testing, however the data in real applications is rarely linearly separable. Non-linear kernel SVMs are too computationally intensive for applications with large-scale data sets. Recently locally linear classifiers have gained popularity due to their ef...
Main Authors: | Zhang, Z, Sturgess, P, Sengupta, S, Crook, N, Torr, PHS |
---|---|
Format: | Conference item |
Language: | English |
Published: |
IEEE
2012
|
Similar Items
-
Secure k -ish Nearest Neighbors Classifier
by: Shaul, Hayim, et al.
Published: (2021) -
Dynamic Nearest Neighbor: An Improved Machine Learning Classifier and Its Application in Finances
by: Oscar Camacho-Urriolagoitia, et al.
Published: (2021-09-01) -
A multi-voter multi-commission nearest neighbor classifier
by: Suyanto Suyanto, et al.
Published: (2022-09-01) -
Q-learning with nearest neighbors
by: Shah, Devavrat, et al.
Published: (2021) -
Non-parametric Nearest Neighbor Classification Based on Global Variance Difference
by: Shaobo Deng, et al.
Published: (2023-03-01)