Sensing-Aware Kernel SVM
원문 초록
We propose a novel approach for designing kernels for support vector machines (SVMs) when the class label is linked to the observation through a latent state and the likelihood function of the observation given the state (the sensing model) is available. We show that the Bayes-optimum decision boundary is a hyperplane under a mapping defined by the likelihood function. Combining this with the maximum margin principle yields kernels for SVMs that leverage knowledge of the sensing model in an optimal way. We derive the optimum kernel for the bag-of-words (BoWs) sensing model and demonstrate its superior performance over other kernels in document and image classification tasks. These results indicate that such optimum sensing-aware kernel SVMs can match the performance of rather sophisticated state-of-the-art approaches.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Generative Adversarial Minority Oversampling for Spectral-Spatial Hyperspectral Image Classification
Attention-Based Adaptive Spectral-Spatial Kernel ResNet for Hyperspectral Image Classification
Multi-direction Networks with Attentional Spectral Prior for Hyperspectral Image Classification
Beyond the Attention: Distinguish the Discriminative and Confusable Features For Fine-grained Image Classification
Multiscale Context-Aware Ensemble Deep KELM for Efficient Hyperspectral Image Classification
Hyperspectral Image Classification Method Based on 2D–3D CNN and Multibranch Feature Fusion
토론
이 논문과 연결된 포럼 글이 아직 없습니다.