• DocumentCode
    480601
  • Title

    Global Discretization Approach Based on Minimize Entropy in Rough Sets Classification

  • Author

    Chou, Hung-Lieh ; Chen, Jr-Shian ; Cheng, Ching-Hsue

  • Volume
    1
  • fYear
    2008
  • fDate
    20-22 Dec. 2008
  • Firstpage
    889
  • Lastpage
    893
  • Abstract
    The discretization approach produces a qualitative attribute from a quantitative attribute. That has many advantages, such as data can be reduced and simplified. Using discrete attributes are usually more compact, shorter and more accurate than using continuous ones. The LEM2 (Learning from Examples Module, version 2) rule extracting algorithm is superior to other algorithms in rough set, that the deduce rule sets directly from data with symbolic and numerical attributes, but LEM2 requires pre-discretized data. Therefore, this study proposes a global discretization approach, which integrated minimize entropy principle approach and rough sets, to enhance accuracy rate and reduce number of rules for solving classification problems. The experimental results indicate that the proposed approach outperforms the listing approaches.
  • Keywords
    data mining; entropy; learning (artificial intelligence); pattern classification; rough set theory; data classification; global discretization approach; learning-from-example module; minimize entropy principle; quantitative discrete attribute; rough set theory; rule extraction algorithm; Application software; Cardiovascular diseases; Chemistry; Computer science; Data mining; Entropy; Hospitals; Information management; Information technology; Rough sets; Global Discretization; Minimize Entropy; Rough Sets;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Information Technology Application, 2008. IITA '08. Second International Symposium on
  • Conference_Location
    Shanghai
  • Print_ISBN
    978-0-7695-3497-8
  • Type

    conf

  • DOI
    10.1109/IITA.2008.485
  • Filename
    4739699