Dimensionality reduction with dimension selection

Yi Guo, Junbin Gao, Li. Feng

    Research output: Book chapter/Published conference paperConference paperpeer-review

    1 Citation (Scopus)
    4 Downloads (Pure)


    We propose a novel method called sparse dimensionality reduction (SDR) in this paper. It performs dimension selection while reducing data dimensionality. Different from traditional dimensionality reduction methods, this method does not require dimensionality estimation. The number of final dimensions is the outcome of the sparse component of this method. In a nutshell, the idea is to transform input data to a suitable space where redundant dimensions are compressible. The structure of this method is very flexible which accommodates a series of variants along this line. In this paper, the data transformation is carried out by Laplacian eigenmaps and the dimension selection is fulfilled by l2/l1 norm. A Nesterov algorithm is proposed to solve the approximated SDR objective function. Experiments have been conducted on images from video sequences and protein structure data. It is evident that the SDR algorithm has subspace learning capability and may be applied to computer vision applications potentially.
    Original languageEnglish
    Title of host publicationPAKDD 2013
    Subtitle of host publication17th Proceedings
    Place of PublicationGermany
    PublisherSpringer-Verlag London Ltd.
    Number of pages12
    ISBN (Electronic)9783642374531
    ISBN (Print)9783642374524
    Publication statusPublished - 2013
    EventPacific-Asia Conference on Knowledge Discovery and Data Mining - Gold Coast, Queensland, Australia
    Duration: 14 Apr 201317 Apr 2013

    Publication series

    ISSN (Print)0303-9743


    ConferencePacific-Asia Conference on Knowledge Discovery and Data Mining

    Grant Number

    • DP130100364


    Dive into the research topics of 'Dimensionality reduction with dimension selection'. Together they form a unique fingerprint.

    Cite this