… In recent work we have extended the method to allow partial matchings over unequal-mass
sets using multi-resolution histogram intersection, and we show its capacity as a kernel for …

… can efficiently classify graphs if graph kernels are used instead of feature vectors. In this
paper, we propose two novel and efficient graph kernels called Mapping Distance Kernel with …

… learning, which enables effective and efficient action recognition. We have conducted
extensive experiments on five challenging realistic datasets. Our approach achieves high …

… proposing an efficient but robust kernel descriptor to encode the appearance of a person.
The matching is then improved by applying a learning technique based on Kernel Canonical …

… In this paper, we propose a novel kernel for feature-sets, “Dimension Amnesic Pyramid
Match Kernel”, which enjoys the power and efficiency of the Pyramid Match Kernel, while …

… indefinite kernels. We also present a graph kernel based on the Pyramid Match kernel that
… results with state-of-the-art graph kernels and that are also efficient in terms of running time. …

… embeds stabilitysensitive filter in the temporal matching kernel with explicit feature maps (TE…
vector by using a temporal invariant match kernel. TE matches relevant videos and at the …

… Until now, an efficient scoring algorithm that considers the … The kernel trick, rooted in the
statistical learning theory, is … peaks, and all the matches contribute equally to the final score…

… This formulation is more efficient than we consider a bidirectional matching. Intuitively,
when distribution Xi is more similar to Yj than other distributions {Yj′ | j′ ̸= j}N …

… Finally, we develop an efficient iterative algorithm to solve the proposed model. Compared
with the state-of-the-art methods, the presented algorithm enhances the performance of graph …