• DocumentCode
    3300934
  • Title

    An algorithm for reduct cardinality minimization

  • Author

    AbouEisha, Hassan ; Al Farhan, Mohammed ; Chikalov, Igor ; Moshkov, Mikhail

  • Author_Institution
    Electr. & Math. Sci. & Eng. Div., King Abdullah Univ. of Sci. & Technol. (KAUST), Thuwal, Saudi Arabia
  • fYear
    2013
  • fDate
    13-15 Dec. 2013
  • Firstpage
    1
  • Lastpage
    3
  • Abstract
    This is devoted to the consideration of a new algorithm for reduct cardinality minimization. This algorithm transforms the initial table to a decision table of a special kind, simplify this table, and use a dynamic programming algorithm to finish the construction of an optimal reduct. Results of computer experiments with decision tables from UCI ML Repository are discussed.
  • Keywords
    dynamic programming; learning (artificial intelligence); minimisation; UCI ML Repository; decision tables; dynamic programming algorithm; optimal reduct construction; reduct cardinality minimization algorithm; Computers; Decision trees; Dynamic programming; Heuristic algorithms; Minimization; Optimization; Transforms; decision tree; dynamic programming; reduct;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Granular Computing (GrC), 2013 IEEE International Conference on
  • Conference_Location
    Beijing
  • Type

    conf

  • DOI
    10.1109/GrC.2013.6740370
  • Filename
    6740370
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3300934