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 条

[41] ROUGH SETS THEORY TO KNOWLEDGE DISCOVERY
Caballero, Yaile
Bello, Rafael
Arco, Leticia
Cardenas, Beitmantt
Marquez, Yennely
Garcia, Maria M.
DYNA-COLOMBIA, 2010, 77 (162): : 261 - 270
[42] Rule analysis with rough sets theory
Pattaraintakorn, Puntip
Cercone, Nick
Naruedomkul, Kanlaya
2006 IEEE INTERNATIONAL CONFERENCE ON GRANULAR COMPUTING, 2006, : 582 - +
[43] The two sides of the theory of rough sets
Yao, Yiyu
KNOWLEDGE-BASED SYSTEMS, 2015, 80 : 67 - 77
[44] Multi-Target Rough Sets and Their Approximation Computation with Dynamic Target Sets
Zheng, Wenbin
Li, Jinjin
Liao, Shujiao
INFORMATION, 2022, 13 (08)
[45] Heuristic genetic algorithm for minimal reduct in decision system based on rough set theory
Dai, JH
Li, YX
2002 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-4, PROCEEDINGS, 2002, : 833 - 836
[46] A Hybrid Genetic Algorithm for Reduct of Attributes in Decision System Based on Rough Set Theory
Dai Jian\|hua 1
Wuhan University Journal of Natural Sciences, 2002, (03) : 285 - 289
[47] Reduct Generation by Formation of Directed Minimal Spanning Tree Using Rough Set Theory
Das, Asit Kumar
Sengupta, Shampa
Chakrabarty, Saikat
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INFORMATION SYSTEMS DESIGN AND INTELLIGENT APPLICATIONS 2012 (INDIA 2012), 2012, 132 : 127 - +
[48] A new algorithm for reduct computation based on gap elimination and attribute contribution
Rodriguez-Diez, Vladimir
Martinez-Trinidad, Jose Fco.
Carrasco-Ochoa, Jesus A.
Lazo-Cortes, Manuel S.
INFORMATION SCIENCES, 2018, 435 : 111 - 123
[49] Concept lattices in rough set theory
Yao, YY
NAFIPS 2004: ANNUAL MEETING OF THE NORTH AMERICAN FUZZY INFORMATION PROCESSING SOCIETY, VOLS 1AND 2: FUZZY SETS IN THE HEART OF THE CANADIAN ROCKIES, 2004, : 796 - 801
[50] Multiple Reducts Computation in Rough Sets with Applications to Ensemble Classification
Bar, Abhimanyu
Prasad, P. S. V. S. Sai
PROCEEDINGS OF ICETIT 2019: EMERGING TRENDS IN INFORMATION TECHNOLOGY, 2020, 605 : 449 - 461

← 1 2 3 4 5 →