Multiple modalities present potential difficulties for kernel-based pattern recognition in consequence of the lack of inter-modal kernel measures. This is particularly apparent when training sets for the differing modalities are disjoint. Thus, while it is always possible to consider the problem at the classifier fusion level, it is conceptually preferable to approach the matter from a kernel-based perspective. By interpreting the aggregate of disjoint training sets as an entire data set with missing inter-modality measurements to be filled in by appropriately chosen substitutes, we arrive at a novel kernel-based technique, the neutral-point method. On further theoretical analysis, it transpires that the method is, in structural terms, a kernel-based analog of the well-known sum rule combination scheme. We therefore expect the method to exhibit similar error-canceling behavior, and thus constitute a robust and conservative strategy for the treatment of kernel-based multi-modal data. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Windridge, D., Mottl, V., Tatarchuk, A., & Eliseyev, A. (2007). The neutral point method for kernel-based combination of disjoint training data in multi-modal pattern recognition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4472 LNCS, pp. 13–21). Springer Verlag. https://doi.org/10.1007/978-3-540-72523-7_2
Mendeley helps you to discover research relevant for your work.