nips nips2008 nips2008-113 nips2008-113-reference knowledge-graph by maker-knowledge-mining

113 nips-2008-Kernelized Sorting


Source: pdf

Author: Novi Quadrianto, Le Song, Alex J. Smola

Abstract: 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. 1


reference text

[1] T. Jebara. Kernelizing sorting, permutation, and alignment for minimum volume PCA. In Conference on Computational Learning Theory (COLT), volume 3120 of LNAI, pages 609– 623. Springer, 2004.

[2] A.J. Smola, A. Gretton, L. Song, and B. Sch¨ lkopf. A hilbert space embedding for distrio butions. In E. Takimoto, editor, Algorithmic Learning Theory, Lecture Notes on Computer Science. Springer, 2007.

[3] K. Fukumizu, F. R. Bach, and M. I. Jordan. Dimensionality reduction for supervised learning with reproducing kernel Hilbert spaces. J. Mach. Learn. Res., 5:73–99, 2004.

[4] T. Pham Dinh and L. Hoai An. A D.C. optimization algorithm for solving the trust-region subproblem. SIAM Journal on Optimization, 8(2):476–505, 1988.

[5] A.L. Yuille and A. Rangarajan. The concave-convex procedure. Neural Computation, 15:915– 936, 2003.

[6] R. Jonker and A. Volgenant. A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing, 38:325–340, 1987.

[7] T. Cour, P. Srinivasan, and J. Shi. Balanced graph matching. In B. Sch¨ lkopf, J. Platt, and o T. Hofmann, editors, Advances in Neural Information Processing Systems 19, pages 313–320. MIT Press, December 2006.

[8] W. Gander, G.H. Golub, and U. von Matt. A constrained eigenvalue problem. In Linear Algebra Appl. 114-115, pages 815–839, 1989.

[9] P. Koehn. Europarl: A parallel corpus for statistical machine translation. In Machine Translation Summit X, pages 79–86, 2005.

[10] W. A. Gale and K. W. Church. A program for aligning sentences in bilingual corpora. In Meeting of the Association for Computational Linguistics, pages 177–184, 1991.