Accelerated Feature Selection via Discernibility Hashing: A Rough Set Approach [PDF]
EntropyAs a foundational analytical tool, the discernibility matrix plays a pivotal role in the systematic reduction of knowledge in rough set-based systems. Recent advancements in rough set theory have witnessed the proliferation of discernibility matrix-based
Sheng Luo +3 more
doaj +2 more sources
Discernibility matrix simplification for constructing attribute reducts [PDF]
Information Sciences, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yao, Yiyu, Zhao, Yan
openaire +4 more sources
Discernibility Matrix and Its Application in Logical Optimization
Jisuanji kexue yu tansuo, 2021 The simplification of truth table is of great significance to the analysis and design of logic circuits. In this paper, the simplification of truth table is studied, and a method of GDM (granular discernibility matrix) that uses discernibility matrix is ...
YAN Xinyi, WEN Xin, CHEN Zehua
doaj +2 more sources
Soft Incomplete Discernibility Matrix for Decision-Making Problems
IEEE Access, 2018 Many decision-making processes are determined in an incomplete data environment. The analysis of decision-making problems on incomplete soft set data is usually performed by first estimating incomplete values.
Lue Li +3 more
doaj +2 more sources
Soft discernibility matrix and attribute reduction for information systems
Tongxin xuebao, 2009 A new concept of soft discernibility matrix was proposed, and related theorems were given. By using soft discernibility matrix,attribute reductions of incomplete information systems, fuzzy value information systems and vague sets value information ...
YAN De-qin1, LI Ke-qiu2, CHI Zhong-xian2
doaj +3 more sources
Rule Acquisition Algorithm Based on Enriching Discernibility Matrix [PDF]
Jisuanji gongcheng, 2016 Currently,the discernibility matrix method which is based on HU is not only time-consuming but also takes up a lot of storage space,so that the efficiency of the method is not high.Some scholars use the method of pairwise comparisons between elements to ...
ZHU Jinhu,XU Zhangyan,QIAO Lijuan,XIE Xiaojun,WANG Ting
doaj +1 more source
Using Covering Reduction to Identify Reducts for Object-Oriented Concept Lattices
Axioms, 2022 An object-oriented concept lattice, as an important generalization of classic concept lattices, is a bridge between formal concept analysis and rough set theory. This paper presents an application of covering reduction in formal concept analysis.
Guilong Liu
doaj +1 more source
Incremental Attribute Reduction Algorithm Based on Binary Discernibility Matrix [PDF]
Jisuanji gongcheng, 2017 Incremental attribute reduction algorithm is one of the important research contents in the area of dyanmic data mining.To reduce the storage space of binary discernibility matrix,and by combining the advantages of the binary discernibility matrix that it
DING Mianwei,ZHANG Tengfei,MA Fumin
doaj +1 more source
Local Indiscernibility Relation Reduction for Information Tables
IEEE Access, 2022 Attribute reduction comes from machine learning and is an important component of rough set theory. Research on attribute reduction has produced many important achievements.
Xu Li, Jianguo Tang, Jiyong Tang
doaj +1 more source
Incremental Algorithm for Attribute Reduction Based on Positive Region and Discernibility Element [PDF]
Jisuanji gongcheng, 2016 The reduction result should be updated continually with the dynamic changing of data in decision table.In order to improve the efficiency of attribute reduction while ensuring the simplest results,an improved decision table reduction algorithm is ...
LIU Taotao,MA Fumin,ZHANG Tengfei
doaj +1 more source