kernelized Sorting

Object matching is a fundamental operation in data analysis. It typically requires the definition of a similarity measure between the classes of objects to be matched. Instead, we develop an approach which is able to perform matching by requiring a similarity measure only within each of the classes. This is achieved by maximizing the dependency between matched pairs of observations by means of the Hilbert Schmidt Independence Criterion. This problem can be cast as one of maximizing a quadratic assignment problem with special structure and we present a simple algorithm for finding a locally optimal solution.

Introduction

Problem Statement

Assume we are given two collections of documents purportedly covering the same content, written in two different languages. Can we determine the correspondence between these two sets of documents without using a dictionary?

Sorting and Matching

(Formal) problem formulation:

Given {\color {blue} two sets of observations} <math>\X= \{ x_{1},..., x_{m} \}\subseteq \cal X<math>\ and <math>\Y=\{ y_{1},..., y_{m}\} \subseteq \cal Y <math>\

Find {\color {blue} a permutation matrix} <math>\\pi \in \Pi_{m}<math>\,

<math>\ \Pi_{m}:= \{\pi | \pi \in \{0,1\}^{m \times m} \hspace{0.2 em} where \hspace{0.2 em} \pi 1_{m}=1_{m}, \hspace{0.2 em} \pi^{T}1_{m}=1_{m}\} <math>\

such that <math>\ \{ (x_{i},y_{\pi (i)}) for 1 \leqslant i \leqslant m \} $ is maximally dependent. Here $1_{m} \in \mathbb{R}^{m}<math>\ is the vector of all ones.