• DocumentCode
    2251366
  • Title

    Decision bireducts and approximate decision reducts: Comparison of two approaches to attribute subset ensemble construction

  • Author

    Stawicki, Sebastian ; Widz, Sebastian

  • Author_Institution
    Inst. of Math., Univ. of Warsaw, Warsaw, Poland
  • fYear
    2012
  • fDate
    9-12 Sept. 2012
  • Firstpage
    331
  • Lastpage
    338
  • Abstract
    We discuss the notion of a decision bireduct [1], which is an extension of the notion of a decision reduct developed within the theory of rough sets. We show relationships between the decision bireducts and some formulations of approximate decision reducts summarized in [2]. We investigate advantages of the decision bireducts and the approximate decision reducts within a rough-set-inspired framework for deriving attribute subset ensembles from data, wherein each of attribute subsets yields a single classifier, basically by generating its corresponding if-then decision rules from the training data. We also show how to use the above-mentioned relationships to build even more efficient rough-set-based ensembles in the future.
  • Keywords
    data mining; decision trees; learning (artificial intelligence); pattern classification; rough set theory; approximate decision reducts; attribute subset ensemble construction; classifier; decision bireducts; if-then decision rules; rough set theory; rough set-based ensembles; rough set-inspired framework; Approximation algorithms; Approximation methods; Buildings; Rain; Rough sets; Standards; Training data; Approximate Reducts; Attribute Subset Selection; Bireducts; Classifier Ensembles; Randomized Search;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Science and Information Systems (FedCSIS), 2012 Federated Conference on
  • Conference_Location
    Wroclaw
  • Print_ISBN
    978-1-4673-0708-6
  • Electronic_ISBN
    978-83-60810-51-4
  • Type

    conf

  • Filename
    6354441