Sparse kernel orthonormalized PLS for feature extraction in large datasets

Jerónimo Arenas-García, Kaare Brandt Petersen, Lars Kai Hansen

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    241 Downloads (Pure)


    In this paper we are presenting a novel multivariate analysis method for large scale problems. Our scheme is based on a novel kernel orthonormalized partial least squares (PLS) variant for feature extraction, imposing sparsity constrains in the solution to improve scalability. The algorithm is tested on a benchmark of UCI data sets, and on the analysis of integrated short-time music features for genre prediction. The upshot is that the method has strong expressive power even with rather few features, is clearly outperforming the ordinary kernel PLS, and therefore is an appealing method for feature extraction of labelled data.
    Original languageEnglish
    Title of host publicationNIPS 2006
    Publication date2006
    Publication statusPublished - 2006
    EventNIPS 2006 -
    Duration: 1 Jan 2006 → …


    ConferenceNIPS 2006
    Period01/01/2006 → …

    Fingerprint Dive into the research topics of 'Sparse kernel orthonormalized PLS for feature extraction in large datasets'. Together they form a unique fingerprint.

    Cite this