• DocumentCode
    527797
  • Title

    Semi-random subspace sampling for classification

  • Author

    Yang, Ming ; Bao, Jie ; Ji, Gen-lin

  • Author_Institution
    Sch. of Comput. Sci. & Technol., Nanjing Normal Univ., Nanjing, China
  • Volume
    7
  • fYear
    2010
  • fDate
    10-12 Aug. 2010
  • Firstpage
    3420
  • Lastpage
    3424
  • Abstract
    In this paper, we introduce a novel semi-random subspace sampling for classification (for short, denoted by FS_RS). In this method, a ranking feature list is obtained by using feature selection first, and then the more important N0 features in the front of the ranking feature list are chosen, and N1 features is randomly selected from the remaining features in the ranking feature list. Along this sampling method, those obtained feature subsets not only contain those more important features, but also include those relatively weak relevant or irrelevant features, hence both diversity and accuracy of corresponding base classifiers can be effectively guaranteed. So, the performance of the integrated classifier can be effectively improved. Experiments on 4 real-life datasets show the effectiveness of our method.
  • Keywords
    feature extraction; pattern classification; sampling methods; classification; classifiers; feature selection; semi-random subspace sampling; Accuracy; Bagging; Boosting; Classification algorithms; Face recognition; Training; Bagging; Boosting; ensemble classifier; feature selection; random subspace;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Natural Computation (ICNC), 2010 Sixth International Conference on
  • Conference_Location
    Yantai, Shandong
  • Print_ISBN
    978-1-4244-5958-2
  • Type

    conf

  • DOI
    10.1109/ICNC.2010.5584362
  • Filename
    5584362