Algorithm to compute core based on new binary discernibility matrix

A more efficient algorithm for attribute reduction based on the binary discernible matrix;

A simpler method,based on binary discernible matrix and binary matrix which is created according to different objects belong to the same decision category,is put forward.

Then we give a heuristic attribute reduction algorithm based on binary discernible matrix.

Reduction approach to detected data of liver function based on binary discernibility matrix;

Algorithm for decision rules reduction based on binary discernibility matrix;

Feature selection combining new document frequency with binary discernibility matrix

Research of Attribute Reduction Based on Binary Discernable Matrix;

In order to correct some problems of computing the core of a decision table,an improved binary discernable matrix definition based on distribution function for computing the core was put forward in this paper.

This paper introduces calculation and application of knowledge granulation by using binary discernable matrix.

Algorithm for attribute reduction based on improved binary discernibility matrix;

First, with a counterexample we point out in this paper an error in reference [4] for calculating the core of a decision table in the context of rough set based on the binary discernibility matrix defined by R.