In this paper, we propose a kernel version of the credal classification rule (CCR) to perform the classification in a feature space of high dimension. Kernels based approaches have become popular for several years to solve supervised or unsupervised learning problems. In this paper, our method is extended to the CCR. It is realized by replacing the inner product with an appropriate positive definite function, and the corresponding algorithms are called kernel Credal Classification Rule (KCCR). The approach is applied to the classification of the generated and real data to evaluate and compare the performance of the KCCR method with other classification methods.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.