Kernel relevant component analysis for distance metric learning

Kernel relevant component analysis for distance metric learning (2005)

Cached

Download Links

by Ivor W. Tsang , Pak-ming Cheung , James T. Kwok

Venue:	In IEEE International Joint Conference on Neural Networks (IJCNN
Citations:	9 - 0 self

BibTeX

@INPROCEEDINGS{Tsang05kernelrelevant,
    author = {Ivor W. Tsang and Pak-ming Cheung and James T. Kwok},
    title = {Kernel relevant component analysis for distance metric learning},
    booktitle = {In IEEE International Joint Conference on Neural Networks (IJCNN},
    year = {2005},
    pages = {954--959},
    publisher = {IJCNN}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Abstract — Defining a good distance measure between patterns is of crucial importance in many classification and clustering algorithms. Recently, relevant component analysis (RCA) is proposed which offers a simple yet powerful method to learn this distance metric. However, it is confined to linear transforms in the input space. In this paper, we show that RCA can also be kernelized, which then results in significant improvements when nonlinearities are needed. Moreover, it becomes applicable to distance metric learning for structured objects that have no natural vectorial representation. Besides, it can be used in an incremental setting. Performance of this kernel method is evaluated on both toy and real-world data sets with encouraging results. I.

Citations

6696	The Nature of Statistical Learning Theory - Vapnik - 1995
2529	C.J.E.: Uci repository of machine learning databases, http://www.ics.uci.edu/ ∼ mlearn/MLRepository.html - Blake, Keogh
1512	Smola A: Learning with Kernels - Schölkopf - 2002
775	Nonlinear component analysis as a kernel eigenvalue problem - Schölkopf, Smola, et al. - 1998
703	SCOP: a Structural Classification Of Proteins database for the investigation of sequences and structures - Murzin, Brenner, et al. - 1995
357	Distance metric learning, with application to clustering with side-information - Xing, Ng, et al. - 2003
325	AP: The use of the area under the ROC curve in the evaluation of machine learning algorithms. Pattern Recogn - Bradley - 1997
250	Schrodl S: Constrained k-means clustering with background knowledge - Wagstaff, Cardie, et al.
219	The spectrum kernel: a string kernel for SVM protein classification - Leslie, Eskin, et al. - 2002
116	Clustering with instance-level constraints - Wagstaff, Cardie - 2000
94	D.: Learning distance functions using equivalence relations - Bar-Hillel, Hertz, et al. - 2003
94	A review and empirical evaluation of feature weighting methods for a class of lazy learning algorithms - Wettschereck, Aha, et al. - 1997
80	T.: Learning a distance metric from relative comparisons - Schultz, Joachims - 2004
60	Adjustment learning and relevant component analysis - Shental, Hertz, et al. - 2002
52	M: The ASTRAL compendium for sequence and structure analysis - SE, Koehl, et al.
43	Learning with Idealized Kernels - Kwok, Tsang
42	Extracting relevant structures with side information - Chechik, Tishby - 2002
32	Feature weighting for lazy learning algorithms - Aha - 1998
19	Comparing and Unifying Search-based and Similarity-Based Approaches to Semi-Supervised Clustering - Basu, Bilenko, et al. - 2003
8	Dealing with Large Diagonals in Kernel Matrices - Weston, Scholkopf, et al. - 2002