Advances in the Dempster-Shafer theory of evidence
Fuzzy sets and fuzzy logic: theory and applications
Fuzzy sets and fuzzy logic: theory and applications
Fuzzy Functional Dependency and Its Application to Approximate Data Querying
IDEAS '00 Proceedings of the 2000 International Symposium on Database Engineering & Applications
Interpreting Fuzzy Membership Functions in the Theory of Rough Sets
RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
Conditional Probability Relations in Fuzzy Relational Database
RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
A comparative study of fuzzy sets and rough sets
Information Sciences: an International Journal
Generalization of Rough sets and its applications in information system
Intelligent Data Analysis
Multiple-source approximation systems: membership functions and indiscernibility
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
A study of multiple-source approximation systems
Transactions on rough sets XII
| Hi-index | 0.00 |
In 1982, Pawlak proposed the concept of rough sets with practical purpose of representing indiscernibility of elements. Even it is easy to analyze, the rough set theory built on a partition induced by equivalence relation may not provide a realistic view of relationships between elements in the real-world application. Here, coverings of, or non-equivalence relations on, the universe can be considered to represent a more realistic model instead of partition in which a generalized model of rough sets was proposed. In this paper, based on a-coverings of the universe, a generalized concept of rough membership functions is proposed and defined into three values, minimum, maximum and average. Their properties are examined.