A variant of the trace quotient formulation for dimensionality reduction

Peng Wang*, Chunhua Shen, Hong Zheng, Zhang Ren

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    3 Citations (Scopus)

    Abstract

    Due to its importance to classification and clustering, dimensionality reduction or distance metric learning has been studied in depth in recent years. In this work, we demonstrate the weakness of a widely-used class separability criterion - trace quotient for dimensionality reduction - and propose new criteria for the dimensionality reduction problem. The proposed optimization problem can be efficiently solved using semidefinite programming, similar to the technique in [1]. Experiments on classification and clustering are performed to evaluate the proposed algorithm. Results show the advantage of the our proposed algorithm.

    Original languageEnglish
    Title of host publicationComputer Vision, ACCV 2009 - 9th Asian Conference on Computer Vision, Revised Selected Papers
    Pages277-286
    Number of pages10
    EditionPART 3
    DOIs
    Publication statusPublished - 2010
    Event9th Asian Conference on Computer Vision, ACCV 2009 - Xi'an, China
    Duration: 23 Sept 200927 Sept 2009

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    NumberPART 3
    Volume5996 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Conference

    Conference9th Asian Conference on Computer Vision, ACCV 2009
    Country/TerritoryChina
    CityXi'an
    Period23/09/0927/09/09

    Fingerprint

    Dive into the research topics of 'A variant of the trace quotient formulation for dimensionality reduction'. Together they form a unique fingerprint.

    Cite this