Evaluation of information system disaster recovery ability based on rough set and grey theory

2013 ◽  
Author(s):  
Li Jiaxin ◽  
Li Hui ◽  
Zhang Ru ◽  
Liu Jianyi
Keyword(s):  
Information System ◽  
Rough Set ◽  
Disaster Recovery ◽  
Grey Theory

scholarly journals Multiple Granulation Rough Set Approach to Interval-Valued Intuitionistic Fuzzy Ordered Information Systems

Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 949
Author(s):  
Zhen Li ◽  
Xiaoyan Zhang
Keyword(s):  
Information Theory ◽  
Pattern Recognition ◽  
Information System ◽  
Information Systems ◽  
Rough Set ◽  
Fuzzy Set ◽  
Equivalence Relation ◽  
Target Concept ◽  
Actual Case ◽  
Interval Valued

As a further extension of the fuzzy set and the intuitive fuzzy set, the interval-valued intuitive fuzzy set (IIFS) is a more effective tool to deal with uncertain problems. However, the classical rough set is based on the equivalence relation, which do not apply to the IIFS. In this paper, we combine the IIFS with the ordered information system to obtain the interval-valued intuitive fuzzy ordered information system (IIFOIS). On this basis, three types of multiple granulation rough set models based on the dominance relation are established to effectively overcome the limitation mentioned above, which belongs to the interdisciplinary subject of information theory in mathematics and pattern recognition. First, for an IIFOIS, we put forward a multiple granulation rough set (MGRS) model from two completely symmetry positions, which are optimistic and pessimistic, respectively. Furthermore, we discuss the approximation representation and a few essential characteristics for the target concept, besides several significant rough measures about two kinds of MGRS symmetry models are discussed. Furthermore, a more general MGRS model named the generalized MGRS (GMGRS) model is proposed in an IIFOIS, and some important properties and rough measures are also investigated. Finally, the relationships and differences between the single granulation rough set and the three types of MGRS are discussed carefully by comparing the rough measures between them in an IIFOIS. In order to better utilize the theory to realistic problems, an actual case shows the methods of MGRS models in an IIFOIS is given in this paper.

Incremental Approach for Updating Approximations of Variable Precision Rough Set Based on Dominance Relations

2014 ◽  
Vol 631-632 ◽  
pp. 49-52
Author(s):  
Yan Li ◽  
Jia Jia Hou ◽  
Xiao Qing Liu
Keyword(s):  
Information System ◽  
Rough Set ◽  
Dominance Relation ◽  
Incremental Updating ◽  
Dominance Relations ◽  
Incremental Approach ◽  
Variable Precision ◽  
Variable Precision Rough Set ◽  
Over Time

Variable precision rough set (VPRS) based on dominance relation is an extension of traditional rough set by which can handle preference-ordered information flexibly. This paper focuses on the maintenance of approximations in dominance based VPRS when the objects in an information system vary over time. The incremental updating principles are given as inserting or deleting an object, and some experimental evaluations validates the effectiveness of the proposed method.

scholarly journals Data Mining dalam Akurasi Tingkat Kelayakan Pakai terhadap Peralatan Perangkat Keras

2020 ◽  
pp. 83-88
Author(s):  
Nurhidayat ◽  
Sarjon Defit ◽  
Sumijan
Keyword(s):  
Data Mining ◽  
Information System ◽  
Rough Set ◽  
Access Point ◽  
Learning Processes ◽  
Discernibility Matrix ◽  
Student Work ◽  
Hard Drives ◽  
Good Shape ◽  
Equivalency Class

Hardware is a computer that can be seen and touched in person. Hardware is used to support student work and learning processes. The hardware should always be in good shape. If any damage should be done quickly. The benefits of this study provide a viable level of data against hardware tools. The purpose of this study determines that hardware that is worth using quickly and precisely so easily can be repaired and replaced. Hard-processed action consists of 12 projectors, 2 units of access point, 6 units of monitors, and 20 CPU units. To see the level of appropriateness regarding hard drives requires a rough set algorithm with that stage: information system; Decision system; Equivalency class; Discernibility matrix; Discernibility Matrix module D; Reduction; Generate Rules. The results of the 40 devices of study STMIK Indonesia Padang subtract college have 10 rules of policy on whether the hardware is still viable, repaired or replaced. So using a rough set algorithm is particularly appropriate to apply in a verifiable level of accuracy to fast and precise hardware.

On Quasi Discrete Topological Spaces in Information Systems

2012 ◽  
Vol 3 (2) ◽  
pp. 38-52 ◽  
Author(s):  
Tutut Herawan
Keyword(s):  
Information System ◽  
Information Systems ◽  
Topological Space ◽  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Topological Spaces ◽  
Discrete Topology

This paper presents an alternative way for constructing a topological space in an information system. Rough set theory for reasoning about data in information systems is used to construct the topology. Using the concept of an indiscernibility relation in rough set theory, it is shown that the topology constructed is a quasi-discrete topology. Furthermore, the dependency of attributes is applied for defining finer topology and further characterizing the roughness property of a set. Meanwhile, the notions of base and sub-base of the topology are applied to find attributes reduction and degree of rough membership, respectively.

THE ALGORITHM ON KNOWLEDGE REDUCTION IN INCOMPLETE INFORMATION SYSTEMS

2002 ◽  
Vol 10 (01) ◽  
pp. 95-103 ◽  
Author(s):  
JIYE LIANG ◽  
ZONGBEN XU
Keyword(s):  
Information System ◽  
Information Systems ◽  
Incomplete Information ◽  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Np Hard ◽  
Knowledge Reduction ◽  
Np Hard Problem ◽  
Incomplete Information Systems

Rough set theory is emerging as a powerful tool for reasoning about data, knowledge reduction is one of the important topics in the research on rough set theory. It has been proven that finding the minimal reduct of an information system is a NP-hard problem, so is finding the minimal reduct of an incomplete information system. Main reason of causing NP-hard is combination problem of attributes. In this paper, knowledge reduction is defined from the view of information, a heuristic algorithm based on rough entropy for knowledge reduction is proposed in incomplete information systems, the time complexity of this algorithm is O(|A|2|U|). An illustrative example is provided that shows the application potential of the algorithm.

Sign in / Sign up

Export Citation Format

Share Document