A rough set based dynamic maintenance approach for approximations in coarsening and refining attribute values.

International Journal of Intelligent Systems (Impact Factor: 1.41). 10/2010; 25:1005-1026. DOI: 10.1002/int.20436
Source: DBLP

ABSTRACT In rough set theory, upper and lower approximations for a concept will change dynamically as the information system changes over time. How to update approximations based on the original information is an important task that can help improve the efficiency of knowledge discovery. This paper focuses on the approach of dynamically updating approximations when attribute values are coarsened or refined. The main contributions include: (1) defining coarsening and refining attribute values in information systems and introducing the properties and the principles of coarsening and refining attribute values; (2) analyzing the properties for dynamic maintenance in terms of upper and lower approximations with coarsening and refining attribute values; (3) proposing an incremental algorithm for updating the approximations of a concept as coarsening or refining attributes values; and finally (4) validating the efficiency of the proposed approach to handle the dynamic maintenance of the approximations for a given concept. © 2010 Wiley Periodicals, Inc.

  • [Show abstract] [Hide abstract]
    ABSTRACT: Rule induction method based on rough set theory (RST) has received much attention recently since it may generate a minimal set of rules from the decision system for real-life applications by using of attribute reduction and approximations. The decision system may vary with time, e.g., the variation of objects, attributes and attribute values. The reduction and approximations of the decision system may alter on Attribute Values' Coarsening and Refining (AVCR), a kind of variation of attribute values, which results in the alteration of decision rules simultaneously. This paper aims for dynamic maintenance of decision rules w.r.t. AVCR. The definition of minimal discernibility attribute set is proposed firstly, which aims to improve the efficiency of attribute reduction in RST. Then, principles of updating decision rules in case of AVCR are discussed. Furthermore, the rough set-based methods for updating decision rules in the inconsistent decision system are proposed. The complexity analysis and extensive experiments on UCI data sets have verified the effectiveness and efficiency of the proposed methods.
    IEEE Transactions on Knowledge and Data Engineering 12/2014; 26(12):2886-2899. DOI:10.1109/TKDE.2014.2320740 · 1.82 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: As we all known, dynamic updating of rough approximations and reducts are keys to the applications of the rough set theory in real data sets. In recent years, with respect to different requirements, many approaches have been proposed to study such problems. Nevertheless, few of the them are carried out under multigranulation fuzzy environment. To fill such gap, the updating computations of multigranulation fuzzy rough approximations are explored in this paper. By considering the dynamic increasing of fuzzy granular structures, which are induced by fuzzy relations, naive and fast algorithms are presented, respectively. Moreover, both naive and fast forward greedy algorithms are designed for granular structure selection in dynamic updating environment. Experiments on six data sets from UCI show that fast algorithms are more effective for reducing computational time in comparison with naive algorithms.
    12/2014; 5(6):981-990. DOI:10.1007/s13042-014-0242-4
  • [Show abstract] [Hide abstract]
    ABSTRACT: Set-valued information systems are important generalizations of single-valued information systems. In this paper, three relations are proposed for attribute reduction of set-valued information systems. Then, we convert a large-scale set-valued information system into a smaller relation information system. An incremental algorithm is designed to compress dynamic set-valued information systems. Concretely, we mainly address the compression updating from three aspects: variations of attribute set, immigration and emigration of objects and alterations of attribute values. Finally, several illustrative examples are employed to demonstrate that attribute reduction of dynamic set-valued information systems are simplified significantly by our proposed approaches.
    10/2014; 5(5):775-788. DOI:10.1007/s13042-013-0225-x