Results 1 to 10 of about 1,653,449 (187)

A Quick Algorithm for Binary Discernibility Matrix Simplification using Deterministic Finite Automata

open access: yesInformation, 2018
The binary discernibility matrix, originally introduced by Felix and Ushio, is a binary matrix representation for storing discernible attributes that can distinguish different objects in decision systems. It is an effective approach for feature selection,
Nan Zhang   +3 more
doaj   +4 more sources

Accelerated Feature Selection via Discernibility Hashing: A Rough Set Approach [PDF]

open access: yesEntropy
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   +3 more sources

Soft discernibility matrix and attribute reduction for information systems

open access: yesTongxin 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   +4 more sources

Rule Acquisition Algorithm Based on Enriching Discernibility Matrix [PDF]

open access: yesJisuanji 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   +2 more sources

Using Covering Reduction to Identify Reducts for Object-Oriented Concept Lattices

open access: yesAxioms, 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   +2 more sources

Discernibility Matrix Simplification for Constructing Attribute Reducts [PDF]

open access: yesInformation Sciences, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yiyu Yao
exaly   +4 more sources

Soft Incomplete Discernibility Matrix for Decision-Making Problems

open access: yesIEEE 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   +3 more sources

Discernibility Matrix and Its Application in Logical Optimization

open access: yesJisuanji 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

Heart disease prediction using rough neutrosophic sets and dual-attention neural networks: RNS-OptiDANet [PDF]

open access: yesFrontiers in Artificial Intelligence
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]

open access: yesFuzzy Information and Engineering, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang-Yan Xu, Bing-Ru Yang
exaly   +2 more sources

Home - About - Disclaimer - Privacy