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
关键词
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 条
  • [1] A new heuristic reduct algorithm base on rough sets theory
    Zhang, J
    Wang, JM
    Li, DY
    He, HC
    Sun, JQ
    ADVANCES IN WEB-AGE INFORMATION MANAGEMENT, PROCEEDINGS, 2003, 2762 : 247 - 253
  • [2] Approximate reduct computation by rough sets based attribute weighting
    Al-Radaideh, QA
    Sulaiman, MN
    Selamat, MH
    Ibrahim, H
    2005 IEEE INTERNATIONAL CONFERENCE ON GRANULAR COMPUTING, VOLS 1 AND 2, 2005, : 383 - 386
  • [3] The concept learning in the theory of rough sets
    Zhang, Qun-Feng
    Jiang, Yu-Ting
    Li, Zhi-Qiang
    PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2008, : 337 - +
  • [4] The briefest reduct of rough sets by genetic algorithm
    Guan Hong-bo
    Tian Da-gang
    Yang Bao-an
    Proceedings of 2006 Chinese Control and Decision Conference, 2006, : 1033 - 1036
  • [5] FPGA in Rough Set Based Core and Reduct Computation
    Grzes, Tomasz
    Kopczynski, Maciej
    Stepaniuk, Jaroslaw
    ROUGH SETS AND KNOWLEDGE TECHNOLOGY: 8TH INTERNATIONAL CONFERENCE, 2013, 8171 : 263 - 270
  • [6] The Briefest Reduct of Rough Sets Based On Genetic Algorithm
    Guan Hong-bo
    Yang Bao-an
    2008 IEEE INTERNATIONAL SYMPOSIUM ON IT IN MEDICINE AND EDUCATION, VOLS 1 AND 2, PROCEEDINGS, 2008, : 23 - 27
  • [7] Rough Sets Based Approach to Reduct Approximation: RSBARA
    Foitong, Sombut
    Srinil, Phaitoon
    Pinngern, Ouen
    FIFTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 2, PROCEEDINGS, 2008, : 250 - 254
  • [8] Generalized attribute reduct in rough set theory
    Jia, Xiuyi
    Shang, Lin
    Zhou, Bing
    Yao, Yiyu
    KNOWLEDGE-BASED SYSTEMS, 2016, 91 : 204 - 218
  • [9] Methods of rough sets theory in solving problem of concept generalization
    Vagin, VN
    Kulikov, AV
    Fomina, MV
    JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 2004, 43 (06) : 878 - 891
  • [10] Dynamic reduct research based on rough set theory
    Han, Bin
    Wu, Tie-Jun
    Yang, Ming-Hui
    Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 2002, 22 (06):