Results 161 to 170 of about 1,653,449 (187)
Some of the next articles are maybe not open access.

A new algorithm for computing reducts based on the binary discernibility matrix

Intelligent Data Analysis, 2016
Attribute reduction is a very important task in Rough Set Theory. In this context, in recent years several attribute reduction algorithms based on the discernibility matrix have been proposed. In this paper, we go back to the binary discernibility matrix and reformulate some basic concepts that allow us to build on them an algorithm for computing ...
Manuel S. Lazo-Cortés   +3 more
openaire   +2 more sources

Applying Indiscernibility Attribute to Attribute Reduction Based on Discernibility Matrix

2009 International Conference on Environmental Science and Information Application Technology, 2009
Attribute reduction is one of the key problems in Rough Set theory, and many algorithms based on discernibility matrix have been proposed and studied about it. In order to reduce the computational complexity of discernibility matrix method, a fast counting sort algorithm is first introduced for dealing with redundant and inconsistent data in decision ...
Jin Qian, Ping Lv
openaire   +1 more source

The Improved Discernibility Matrix Based on Decision Vector

2013
Skowron’s discernibility matrix is the evolvement of the attribute reduction models under algebra view. Aiming at the generating process of discernibility matrix, this paper simplifies decision system by introducing decision vector, and designs an improved discernibility matrix, which is capable of suiting inconsistency of decision system, as well as ...
Jingfu Li, Denghui Bu
openaire   +1 more source

A Discernibility Matrix Based Algorithm for Feature Selection

2006 International Conference on Computational Intelligence and Security, 2006
An algorithm of reduct computation for feature selection is proposed in the paper, which is a discernibility matrix based method and aims at reducing the number of irrelevant and redundant features in data mining. The method used both significance information of attributes and information of discernibility matrix to define the necessity of heuristic ...
openaire   +1 more source

Rule generating based on relative Discernibility Matrix

2012 International Conference on Computer Science and Information Processing (CSIP), 2012
The concept of relative decision is put forward and the method for finding absolute reduction decision rule through combining rules of relative decisional condition sets is given in this paper. In the process of decision table reduction, the relative Discernibility Matrix between decision categories should be created in order to decide the relative ...
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

A Symbolic Representation for Discernibility Matrix in Rough Set

Advanced Science and Technology Letters, 2014
Generating discernibility matrix consumes huge time and space .To solve this problem, A new Binary Discernibility Matrix (BDM) induced from information table is defined, The concept of Binary Conjunction Matrix(BCM) is then introduced, Finally A novel method for discernibility matrix using Ordered binary decision diagrams(OBDD) is proposed in this ...
openaire   +1 more source

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

Attribute Reduction Algorithm Based on the Simplified Discernibility Matrix of Granularity

2013
This paper gives the definition of discernibility matrix of granularity in decision table and the corresponding attribute reduction and the definition of discernibility matrix of granularity in the simplified decision table and the corresponding attribute reduction.
Zhangyan Xu, Xiaoyu Wang, Wei Zhang
openaire   +2 more sources

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

Home - About - Disclaimer - Privacy