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 |
---|---|
Formato: | Conference item |
Idioma: | English |
Publicado: |
IEEE
2012
|
Títulos similares
-
An invariant large margin nearest neighbour classifier
por: Kumar, MP, et al.
Publicado: (2007) -
Secure k -ish Nearest Neighbors Classifier
por: Shaul, Hayim, et al.
Publicado: (2021) -
A pre-averaged pseudo nearest neighbor classifier
por: Dapeng Li
Publicado: (2024-08-01) -
Information Retrieval Document Classified with K-Nearest Neighbor
por: Badruz Zaman, et al.
Publicado: (2016-01-01) -
Information Retrieval Document Classified with K-Nearest Neighbor
por: Alifian Sukma, et al.
Publicado: (2018-01-01)