4.7 Article

Incremental updating approximations in dominance-based rough sets approach under the variation of the attribute set

Journal

KNOWLEDGE-BASED SYSTEMS
Volume 40, Issue -, Pages 17-26

Publisher

ELSEVIER
DOI: 10.1016/j.knosys.2012.11.002

Keywords

Rough sets; Knowledge discovery; Dominance relation; Incremental updating; Approximations

Funding

  1. National Science Foundation of China [60873108, 61175047, 61100117]
  2. NSAF [U1230117]
  3. Youth Social Science Foundation of the Chinese Education Commission [10YJCZH117, 11YJC630127]
  4. Fundamental Research Funds for the Central Universities [SWJTU11ZT08]
  5. Research Fund of Traction Power State Key Laboratory, Southwest Jiaotong University [2012TPL_T15]

Ask authors/readers for more resources

Dominance-based Rough Sets Approach (DRSA) is a generalized model of the classical Rough Sets Theory (RST) which may handle information with preference-ordered attribute domain. The attribute set in the information system may evolve over time. Approximations of DRSA used to induce decision rules need updating for knowledge discovery and other related tasks. We firstly introduce a kind of dominance matrix to calculate P-dominating sets and P-dominated sets in DRSA. Then we discuss the principles of updating P-dominating sets and P-dominated sets when some attributes are added into or deleted from the attribute set P. Furthermore, we propose incremental approaches and algorithms for updating approximations in DRSA. The proposed incremental approaches effectively reduce the computational time in comparison with the non-incremental approach are validated by experimental evaluations on different data sets from UCI. (C) 2012 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available