A Support Kernel Machine for Supervised Selective Combining of Diverse Pattern-Recognition Modalities

Abstract. The Support Kernel Machine (SKM) and the Relevance Kernel Machine (RKM) are two principles for selectively combining objectrepresentation modalities of different kinds by means of incorporating supervised selectivity into the classical kernel-based SVM. The former principle consists in rigidly selecting a subset of presumably informative support kernels and excluding the others, whereas the latter one assigns positive weights to all of them. The RKM algorithm was fully elaborated in previous publications; however the previous algorithm implementing the SKM principle of selectivity supervision is applicable only to real-valued features. The present paper fills in this gap by harnessing the framework of subdifferential calculus for computationally solving the problem of constrained nondifferentiable convex optimization that occurs in the SKM training criterion applicable to arbitrary kernel-based modalities of object representation.

• Type: Journal
• Year: 2010
• Where: MCS
• Authors: Alexander Tatarchuk, Eugene Urlov, Vadim Mottl, David Windridge
• Keywords: Kernel Machine, MCS 2010, Pattern Recognition, SKM Training Criterion, Support Kernels