Kernelized Sorting (Poster ID: W48)Novi Quadrianto, Le Song, and Alex J. SmolaProblem : Given two sets of observations X = {(xi)}mi=1 and Y ={(yi)}mi=1, sort yis according to xis without a cross domain comparison.

Solution : Maximizing dependence by permuting yisπ∗ = argmax

π∈Πtrace(HKHπLπ>) ; Kij = k(xi, xj), Lij = l(yi, yj)

Applications :Image Layout Multilingual Document Matching

English German

NIPS is great! NIPS ist klasse!Our paper is cool! Unsere Veröffentlichung ist cool!

Image Matching

Kernelized Sorting (Poster ID: W48)