On New Concept in Computation of Reduct in Rough Sets Theory

被引：0
|
作者：
Shaari, Faizah [1 ]
Abu Bakar, Azuraliza [2 ]
Hamdan, Abd Razak [2 ]
机构：
[1] Polytech Sultan Salahuddin Abdul Aziz Shah, Persiaran Usahawan, Seksyen U1, Shah Alam 40150, Selangor De, Malaysia
[2] Univ Natl Malaysia UKM, Ctr Artificial Intelligence Technol, Fac Technol & Infomat Sci, Bangi 43600, Malaysia
来源：
ROUGH SETS AND KNOWLEDGE TECHNOLOGY, PROCEEDINGS | 2009年 / 5589卷
关键词：
NewReduct; non-interesting; redundant; not-important; dispensable; rare;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
A new concept of Reduct computation is proposed. This set is referred as NewReduct. It is discovered by defining the Indiscernibility matrix modulo (iDMM D) and Indiscernibility function modulo(iDFM D). Reduct is known as interesting and important set of attributes that able to represent the IS, in adverse the NewReduct is set of superfluous, redundant and non-interesting attributes. The computation of attributes defines sets of dispensable attributes and the partitioning of the objects based on indiscernibility relations shaped the information of a new knowledge. It is assumed that the sets of NewReduct attributes are able to uncover hidden knowledge that lies under a hidden pattern. One important knowledge that may be discovered from the IS or DS is the outliers knowledge.
引用
收藏
页码：136 / +
页数：2
相关论文
共 50 条
  • [11] Dynamic Reduct from Partially Uncertain Data Using Rough Sets
    Trabelsi, Salsabil
    Elouedi, Zied
    Lingras, Pawan
    ROUGH SETS, FUZZY SETS, DATA MINING AND GRANULAR COMPUTING, PROCEEDINGS, 2009, 5908 : 160 - +
  • [12] Unsupervised Quick Reduct Algorithm Using Rough Set Theory
    C. Velayutham
    K. Thangavel
    JournalofElectronicScienceandTechnology, 2011, 9 (03) : 193 - 201
  • [13] Rough sets theory
    Walczak, B
    Massart, DL
    CHEMOMETRICS AND INTELLIGENT LABORATORY SYSTEMS, 1999, 47 (01) : 1 - 16
  • [14] Reduct equivalent rule induction based on Rough Set Theory
    Kovacs, Eva
    Ignat, Iosif
    ICCP 2007: IEEE 3RD INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTER COMMUNICATION AND PROCESSING, PROCEEDINGS, 2007, : 9 - +
  • [15] Discovering reduct rules from N-indiscernibility objects in rough sets
    Sun, JP
    PROCEEDINGS OF THE 12TH IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOLS 1 AND 2, 2003, : 720 - 725
  • [16] The elucidation of an iterative procedure to β-reduct selection in the variable precision rough sets model
    Beynon, MJ
    ROUGH SETS AND CURRENT TRENDS IN COMPUTING, 2004, 3066 : 412 - 417
  • [17] A new classification method based on rough sets theory
    Rasim Cekik
    Sedat Telceken
    Soft Computing, 2018, 22 : 1881 - 1889
  • [18] A new classification method based on rough sets theory
    Cekik, Rasim
    Telceken, Sedat
    SOFT COMPUTING, 2018, 22 (06) : 1881 - 1889
  • [19] Attribute Classification and Reduct Computation in Multi-Adjoint Concept Lattices
    Antoni, Lubomir
    Eugenia Cornejo, M.
    Medina, Jesus
    Ramirez-Poussa, Eloisa
    IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2021, 29 (05) : 1121 - 1132
  • [20] An approach to the reduct problem using axiomatic fuzzy sets theory
    Ebonzo, Angelo Dan Menga
    Liu, Xiaodong
    ICIC Express Letters, 2011, 5 (12): : 4495 - 4502
12345