Corpus ID: 11349005

Knowledge reduction of dynamic covering decision information systems with varying attribute values

  title={Knowledge reduction of dynamic covering decision information systems with varying attribute values},
  author={Mingjie Cai},
  • Mingjie Cai
  • Published 2015
  • Computer Science, Mathematics
  • ArXiv
Knowledge reduction of dynamic covering information systems involves with the time in practical situations. In this paper, we provide incremental approaches to computing the type-1 and type-2 characteristic matrices of dynamic coverings because of varying attribute values. Then we present incremental algorithms of constructing the second and sixth approximations of sets by using characteristic matrices. We employ experimental results to illustrate that the incremental approaches are effective… Expand
1 Citations
Matrix-based dynamic updating rough fuzzy approximations for data mining
Experimental results on six UCI datasets shown that the proposed dynamic algorithm achieves significantly higher efficiency than the static algorithm and the combination of two reference incremental algorithms. Expand


Characteristic matrixes-based knowledge reduction in dynamic covering decision information systems
Motivated by the need for knowledge reduction of dynamic covering decision information systems due to variations in the object sets, incremental approaches for computing type-1 and type-2 characteristic matrixes of dynamic coverings are presented. Expand
Fast approach to knowledge acquisition in covering information systems using matrix operations
This work proposes fast approaches to knowledge acquisition in covering information systems by employing novel matrix operations that can dramatically reduce the time consumptions for computing set approximations and reducts of a covering information system. Expand
Dynamic maintenance of approximations in set-valued ordered decision systems under the attribute generalization
This paper proposes incremental approaches for updating approximations dynamically in set-valued ordered decision systems under the attribute generalization, which involves several modifications to relevant matrices without having to retrain from the start on all accumulated training data. Expand
A rough set-based incremental approach for learning knowledge in dynamic incomplete information systems
Three matrices (support matrix, accuracy matrix and coverage matrix) under four different extended relations (tolerance relation, similarity relation, limited tolerance relation and characteristic relation) are introduced to incomplete information systems for inducing knowledge dynamically. Expand
Incremental approaches for updating approximations in set-valued ordered information systems
Two incremental algorithms for updating the approximations in disjunctive/conjunctive set-valued information systems are proposed and results indicate the incremental approaches significantly outperform non-incremental approaches with a dramatic reduction in the computational speed. Expand
Dynamic Maintenance of Decision Rules with Rough Set Under Characteristic Relation
Rough sets for knowledge update have been successfully applied in data mining. Methods for incremental updating decision rules based on the indiscernibility, tolerance relation and similarityExpand
Dynamic Maintenance of Approximations in Dominance‐Based Rough Set Approach under the Variation of the Object Set
The principles of incrementally updating P‐dominating sets and P‐dominated sets are discussed and an incremental approach for updating approximations of DRSA is proposed and shown to outperforms the original nonincremental approach. Expand
Updating attribute reduction in incomplete decision systems with the variation of attribute set
Positive region-based attribute reduction algorithm to solve the attribute reduction problem efficiently in the incomplete decision systems with dynamically varying attribute set is focused on. Expand
Incremental updating approximations in dominance-based rough sets approach under the variation of the attribute set
The principles of updating P-dominating sets and P-dominated sets when some attributes are added into or deleted from the attribute set P are discussed and incremental approaches and algorithms for updating approximations in DRSA are proposed. Expand
Matrix-based set approximations and reductions in covering decision information systems
It is claimed that by using the minimal and maximal descriptions, the total number of discernibility sets that need to be computed in the new discernibility matrix can be dramatically reduced, thus dramatically reducing the computational time for finding all reducts and one optimal reduct of a covering decision system. Expand