• DocumentCode
    2778019
  • Title

    A nonparametric criterion for the selection of the number of factors and nonnegative extension for gradient-based matrix factorization

  • Author

    Bakharia, Aneesha ; Nikulin, Vladimir

  • Author_Institution
    Fac. of Sci. & Eng., Queensland Univ. of Technol., Brisbane, QLD, Australia
  • fYear
    2012
  • fDate
    10-15 June 2012
  • Firstpage
    1
  • Lastpage
    8
  • Abstract
    The high dimensionality of the data, the expressions of thousands of features in a much smaller number of samples, presents challenges that affect applicability of the analytical results. In principle, it would be better to describe the data in terms of a small number of meta-features, derived as a result of matrix factorization, which could reduce noise while still capturing the essential features of the data. Two novel and mutually relevant methods are presented in this paper: 1) nonparametric criterion for the selection of the number of factors; and 2) nonnegative version of the gradient-based matrix factorization which doesn´t require any extra computational costs in comparison to the existing methods. We demonstrate effectiveness of the proposed methods to the supervised classification of gene expression data.
  • Keywords
    bioinformatics; feature extraction; genetics; learning (artificial intelligence); matrix decomposition; pattern classification; data dimensionality; essential data features; gene expression data; metafeatures; noise reduction; nonnegative extension; nonnegative gradient-based matrix factorization version; nonparametric criterion; supervised classification; Algorithm design and analysis; Colon; Gene expression; Matrix decomposition; Optimization; Standards; Tumors; classification; leave-one-out; matrix factorization; non-negativity bioinformatics; number of factors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Neural Networks (IJCNN), The 2012 International Joint Conference on
  • Conference_Location
    Brisbane, QLD
  • ISSN
    2161-4393
  • Print_ISBN
    978-1-4673-1488-6
  • Electronic_ISBN
    2161-4393
  • Type

    conf

  • DOI
    10.1109/IJCNN.2012.6252817
  • Filename
    6252817