Results 271 to 280 of about 1,573,882 (289)
Some of the next articles are maybe not open access.

Characterization and algorithm of decision system's core based discernibility matrix

2009 IEEE International Conference on Granular Computing, 2009
Calculating the core of a decision information system is the start of information reduction and a key step of decision rule making. In this paper, we analyze essential characters of core attributes of decision information system according to rough set theory.
Ming-Fen Wu, Ting-Liang Wang
openaire   +1 more source

Incremental Target Recognition Algorithm Based on Improved Discernibility Matrix

2005
An incremental target recognition algorithm based on improved discernibility matrix in rough set theory is presented. Some comparable experiments have been completed in our “Information Fusion System for Communication Interception Information (IFS/CI2)”.
Yong Liu 0007   +3 more
openaire   +2 more sources

Discernibility matrix based dimensionality reduction for EEG signal

2016 IEEE Region 10 Conference (TENCON), 2016
Classification of EEG signals is an important task in Brain Computer Interface (BCI) research. However, the large number of attributes of EEG data is regarded as a curse for classifiers. This paper aims at dimensionality reduction of EEG signals. We use rough set theory to reduce the dimensions of EEG data.
Rajdeep Chatterjee   +3 more
openaire   +1 more source

Finding all the absolute reductions based on discernibility matrix

2005 International Conference on Machine Learning and Cybernetics, 2005
Rough-set-based-method to simplify a decision table is of great importance. We can calculate the absolute reductions and relative reductions and core through the discernibility matrix, but the numeration is very complex and the archival memory is very large.
null Hua Li, null Jie Zhu
openaire   +1 more source

An Efficient Algorithm for Attribute Reduction Based on Discernibility Matrix

2011 International Conference on Intelligent Computation and Bio-Medical Instrumentation, 2011
A definition for reducing discernibility matrix is provided, and a reduction relative of discernibility set is analyzed to reduce the time complexity of attribute reduction algorithm based on traditional matrix. Use iterative idea to select the necessary condition attributes adding to this reduction relative. Optimize the reduction relative by complete
Juan Zhang, Ani Dong, Yi Niu, Huabei Nie
openaire   +1 more source

Discernibility-Matrix Method Based on the Hybrid of Equivalence and Dominance Relations

2011
The attribute set of some information systems is composed of both regular attributes and criteria. In order to obtain information reduction of this type of information systems, equivalence relation should be defined on the regular attributes and dominance relation on the criteria.
Yan Li 0003   +4 more
openaire   +1 more source

Attribute reduction in formal contexts based on a new discernibility matrix

Journal of Applied Mathematics and Computing, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Discernibility matrix based incremental feature selection on fused decision tables

International Journal of Approximate Reasoning, 2020
Xizhao Wang, Suyun Zhao
exaly  

Constructing Discernibility Matrix for Different Reduction Objectives

INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences, 2013
Zhiguo Huang -, Dong Yu -
openaire   +1 more source

Home - About - Disclaimer - Privacy