Timezone: »

Kernelized Sorting
Novi Quadrianto · Le Song · Alexander Smola

Wed Dec 10 07:30 PM -- 12:00 AM (PST) @

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.

Author Information

Novi Quadrianto (University of Sussex and HSE)
Le Song (Carnegie Mellon University)
Alexander Smola (Amazon)

**AWS Machine Learning**

Related Events (a corresponding poster, oral, or spotlight)

More from the Same Authors