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...
Autors principals: | Zhang, Z, Sturgess, P, Sengupta, S, Crook, N, Torr, PHS |
---|---|
Format: | Conference item |
Idioma: | English |
Publicat: |
IEEE
2012
|
Ítems similars
-
An invariant large margin nearest neighbour classifier
per: Kumar, MP, et al.
Publicat: (2007) -
Secure k -ish Nearest Neighbors Classifier
per: Shaul, Hayim, et al.
Publicat: (2021) -
A pre-averaged pseudo nearest neighbor classifier
per: Dapeng Li
Publicat: (2024-08-01) -
Information Retrieval Document Classified with K-Nearest Neighbor
per: Badruz Zaman, et al.
Publicat: (2016-01-01) -
Dynamic Nearest Neighbor: An Improved Machine Learning Classifier and Its Application in Finances
per: Oscar Camacho-Urriolagoitia, et al.
Publicat: (2021-09-01)