سند علمی

Kernel Dimensionality Reduction Dimensionality Reduction for Supervised Learning with Reproducing Kernel Hilbert Spaces

چکیده

We propose a novel method of dimensionality reduction for supervised learning problems. Given a regression or classification problem in which we wish to predict a response variable Y from an explanatory variable X , we treat the problem of dimensionality reduction as that of finding a low-dimensional “effective subspace” of X which retains the statistical relationship between X and Y . We show that this problem can be formulated in terms of conditional independence. To turn this formulation into an optimization problem we establish a general nonparametric characterization of conditional independence using covariance operators on a reproducing kernel Hilbert space. This characterization allows us to derive a contrast function for estimation of the effective subspace. Unlike many conventional methods for dimensionality reduction in supervised learning, the proposed method requires neither assumptions on the marginal distribution of X , nor a parametric model of the conditional distribution of Y . We present experiments that compare the performance of the method with conventional methods.

اسناد مشابه

  • Kernel Dimensionality Reduction for Supervised Learning

    سند علمی۲۰۰۳NIPSKenji Fukumizu, Francis R. Bach, Michael I. Jordan

    We propose a novel method of dimensionality reduction for supervised learning. Given a regression or classification problem in which we wish to predict a variable Y from an explanatory vector X , we treat the problem of dimensionality reduction as that of finding a low-dimensiona

  • Dimensionality Reduction Using Automatic Supervision for Vision-Based Terrain Learning

    سند علمی۲۰۰۷Robotics: Science and SystemsAnelia Angelova, Larry H. Matthies, Daniel M. Helmick, Pietro Perona

    This paper considers the problem of learning to recognize different terrains from color imagery in a fully automatic fashion, using the robot’s mechanical sensors as supervision. We present a probabilistic framework in which the visual information and the mechanical supervision i

  • A Conditional Entropy Minimization Criterion for Dimensionality Reduction and Multiple Kernel Learning

    سند علمی۲۰۱۰Neural computationHideitsu Hino, Noboru Murata

    Reducing the dimensionality of high-dimensional data without losing its essential information is an important task in information processing. When class labels of training data are available, Fisher discriminant analysis (FDA) has been widely used. However, the optimality of FDA

  • Kernel Fisher’s Discriminant Analysis in Gaussian Reproducing Kernel Hilbert Space1

    سند علمی۲۰۰۵Su-Yun Huang

    Kernel Fisher’s linear discriminant analysis (KFLDA) has been proposed for nonlinear binary classification (Mika, Rätsch, Weston, Schölkopf and Müller, 1999, Baudat and Anouar, 2000). It is a hybrid method of the classical Fisher’s linear discriminant analysis and a kernel machin

  • A unified semi-supervised dimensionality reduction framework for manifold learning

    سند علمی۲۰۱۰NeurocomputingRatthachat Chatpatanasiri, Boonserm Kijsirikul

    We present a general framework of semi-supervised dimensionality reduction for manifold learning which naturally generalizes existing supervised and unsupervised learning frameworks which apply the spectral decomposition. Algorithms derived under our framework are able to employ

  • A supervised non-linear dimensionality reduction approach for manifold learning

    سند علمی۲۰۱۲Pattern RecognitionBogdan Raducanu, Fadi Dornaika

    In this paper we introduce a novel supervised manifold learning technique called Supervised Laplacian Eigenmaps (S-LE), which makes use of class label information to guide the procedure of non-linear dimensionality reduction by adopting the large margin concept. The graph Laplaci