The scientific community has accumulated an immense experience in processing data represented in finite-dimensional linear spaces of numerical features of entities, whereas the kit of mathematical instruments for dissimilarity-based processing of data in metric spaces representing distances between entities, for which sufficiently informative features cannot be found, is much poorer. In this work, the problem of embedding the given set of entities into a linear space with inner product by choosing an appropriate kernel function is considered as the major challenge in the featureless approach to estimating dependences in data sets of arbitrary kind. As a rule, several kernels may be heuristically suggested within the bounds of the same data analysis problem. We treat several kernels on a set of entities as Cartesian product of the respective number of linear spaces, each supplied with a specific kernel function as a specific inner product. The main requirement here is to avoid discrete selection in eliminating redundant kernels with the purpose of achieving acceptable computational complexity of the fusion algorithm. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Mottl, V., Krasotkina, O., Seredin, O., & Muchnik, I. (2005). Principles of multi-kernel data mining. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3587 LNAI, pp. 52–61). Springer Verlag. https://doi.org/10.1007/11510888_6
Mendeley helps you to discover research relevant for your work.