Rough sets and intelligent data analysis
Information Sciences—Informatics and Computer Science: An International Journal
Topological approaches to covering rough sets
Information Sciences: an International Journal
Rough Set Theory for Topological Spaces in Information Systems
AMS '09 Proceedings of the 2009 Third Asia International Conference on Modelling & Simulation
Topological solution of missing attribute values problem in incomplete information tables
Information Sciences: an International Journal
Constructive and algebraic methods of the theory of rough sets
Information Sciences: an International Journal
Rough set theory for topological spaces
International Journal of Approximate Reasoning
A rough set approach for selecting clustering attribute
Knowledge-Based Systems
A general definition of an attribute reduct
RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
Rough implication operator based on strong topological rough algebras
Information Sciences: an International Journal
Data clustering using variable precision rough set
Intelligent Data Analysis
Applying variable precision rough set model for clustering student suffering study's anxiety
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
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.