Discernibility Matrix Enriching and Boolean-And Algorithm for Attributes Reduction

2014 ◽  
pp. 667-676
Author(s):  
ZhangYan Xu ◽  
Ting Wang ◽  
JinHu Zhu ◽  
XiaFei Zhang
Keyword(s):  
Discernibility Matrix

Application of an attribute reduction algorithm based on discernibility matrix in PBNM

2014 ◽  
Author(s):  
Shuo Feng ◽  
Haiying Chu ◽  
Xuyang Wang ◽  
Yuanka Liang ◽  
Xianwei Shi ◽  
...  
Keyword(s):  
Attribute Reduction ◽  
Reduction Algorithm ◽  
Discernibility Matrix

Attribute reduction in fuzzy multi-covering decision systems via observational- consistency and fuzzy discernibility

2021 ◽  
pp. 1-15
Author(s):  
Rongde Lin ◽  
Jinjin Li ◽  
Dongxiao Chen ◽  
Jianxin Huang ◽  
Yingsheng Chen
Keyword(s):  
Rough Set ◽  
Attribute Reduction ◽  
Recursive Method ◽  
Redundant Information ◽  
Reduction Algorithm ◽  
Discernibility Matrix ◽  
Decision Systems ◽  
Theoretical Tool ◽  
Lower Ratio ◽  
Covering Rough Set

Fuzzy covering rough set model is a popular and important theoretical tool for computation of uncertainty, and provides an effective approach for attribute reduction. However, attribute reductions derived directly from fuzzy lower or upper approximations actually still occupy large of redundant information, which leads to a lower ratio of attribute-reduced. This paper introduces a kind of parametric observation sets on the approximations, and further proposes so called parametric observational-consistency, which is applied to attribute reduction in fuzzy multi-covering decision systems. Then the related discernibility matrix is developed to provide a way of attribute reduction. In addition, for multiple observational parameters, this article also introduces a recursive method to gradually construct the multiple discernibility matrix by composing the refined discernibility matrix and incremental discernibility matrix based on previous ones. In such case, an attribute reduction algorithm is proposed. Finally, experiments are used to demonstrate the feasibility and effectiveness of our proposed method.

scholarly journals Data Mining dalam Akurasi Tingkat Kelayakan Pakai terhadap Peralatan Perangkat Keras

2020 ◽  
pp. 83-88
Author(s):  
Nurhidayat ◽  
Sarjon Defit ◽  
Sumijan
Keyword(s):  
Data Mining ◽  
Information System ◽  
Rough Set ◽  
Access Point ◽  
Learning Processes ◽  
Discernibility Matrix ◽  
Student Work ◽  
Hard Drives ◽  
Good Shape ◽  
Equivalency Class

Hardware is a computer that can be seen and touched in person. Hardware is used to support student work and learning processes. The hardware should always be in good shape. If any damage should be done quickly. The benefits of this study provide a viable level of data against hardware tools. The purpose of this study determines that hardware that is worth using quickly and precisely so easily can be repaired and replaced. Hard-processed action consists of 12 projectors, 2 units of access point, 6 units of monitors, and 20 CPU units. To see the level of appropriateness regarding hard drives requires a rough set algorithm with that stage: information system; Decision system; Equivalency class; Discernibility matrix; Discernibility Matrix module D; Reduction; Generate Rules. The results of the 40 devices of study STMIK Indonesia Padang subtract college have 10 rules of policy on whether the hardware is still viable, repaired or replaced. So using a rough set algorithm is particularly appropriate to apply in a verifiable level of accuracy to fast and precise hardware.

Sign in / Sign up

Export Citation Format

Share Document