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...
मुख्य लेखकों: | Zhang, Z, Sturgess, P, Sengupta, S, Crook, N, Torr, PHS |
---|---|
स्वरूप: | Conference item |
भाषा: | English |
प्रकाशित: |
IEEE
2012
|
समान संसाधन
-
An invariant large margin nearest neighbour classifier
द्वारा: Kumar, MP, और अन्य
प्रकाशित: (2007) -
Secure k -ish Nearest Neighbors Classifier
द्वारा: Shaul, Hayim, और अन्य
प्रकाशित: (2021) -
A pre-averaged pseudo nearest neighbor classifier
द्वारा: Dapeng Li
प्रकाशित: (2024-08-01) -
Information Retrieval Document Classified with K-Nearest Neighbor
द्वारा: Badruz Zaman, और अन्य
प्रकाशित: (2016-01-01) -
Information Retrieval Document Classified with K-Nearest Neighbor
द्वारा: Alifian Sukma, और अन्य
प्रकाशित: (2018-01-01)