• DocumentCode
    2544908
  • Title

    A quick value reduction algorithm of rough set

  • Author

    Wang, Xiaofan ; Baoshu Wang

  • Author_Institution
    Sch. of Comput. Sci. & Technol., Xi´´an Univ. of Technol., Xi´´an, China
  • fYear
    2012
  • fDate
    29-31 May 2012
  • Firstpage
    216
  • Lastpage
    219
  • Abstract
    In order to get a value reduction quickly, this paper puts forwards a new algorithm of value reduction based on attribute-value-tree model in attribute order and proves it´s correctness. A attribute reduction and value reduction can be got quickly at the same time from a discrete table in this algorithm. The computational complexity of reduction is changed to O(|U|2|C|) where |U| and |C| are the number of objects and attributes. It is fit to process large data and validated to improve the efficiency by tests.
  • Keywords
    computational complexity; rough set theory; trees (mathematics); attribute order; attribute reduction; attribute-value-tree model; discrete table; quick value reduction algorithm; reduction computational complexity; rough set; Complexity theory; Computer science; Decision making; Educational institutions; Fuzzy systems; Machine learning algorithms; Rough sets; Attribute-Value-Tree; Decision Table; Rough Sets; Value Reduction;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Fuzzy Systems and Knowledge Discovery (FSKD), 2012 9th International Conference on
  • Conference_Location
    Sichuan
  • Print_ISBN
    978-1-4673-0025-4
  • Type

    conf

  • DOI
    10.1109/FSKD.2012.6233931
  • Filename
    6233931
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2544908