Results 1 to 10 of about 553 (154)
Accelerated Feature Selection via Discernibility Hashing: A Rough Set Approach [PDF]
As 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]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yiyu Yao
exaly +4 more sources
Discernibility Matrix and Its Application in Logical Optimization
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
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 +3 more sources
In machine learning-based transient stability assessment (TSA) problems, the characteristics of the selected features have a significant impact on the performance of classifiers.
Bingyang Li, Jianmei Xiao, Xihuai Wang
doaj +3 more sources
Heart disease prediction using rough neutrosophic sets and dual-attention neural networks: RNS-OptiDANet [PDF]
IntroductionHeart disease is a major global health problem that highlights the need for effective and accurate prediction methods.MethodsThis paper presents RNS-OptiDANet, a hybrid framework that combines rough set theory (RST), rough neutrosophic sets ...
T. Ashika, G. Hannah Grace
doaj +2 more sources
An Efficient Algorithm for Pawlak Reduction Based on Simplified Discernibility Matrix [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bing-Ru Yang
exaly +2 more sources
Rule Acquisition Algorithm Based on Enriching Discernibility Matrix [PDF]
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
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]
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

