Rough set analysis of a general type of fuzzy data using transitive aggregations of fuzzy similarity relations

2003 ◽  
Vol 139 (3) ◽  
pp. 635-660 ◽  
Author(s):  
J.M. Fernández Salido ◽  
S. Murakami
2000 ◽  
pp. 149-173 ◽  
Author(s):  
Salvatore Greco ◽  
Benedetto Matarazzo ◽  
Roman Slowinski

Author(s):  
ROLLY INTAN ◽  
MASAO MUKAIDONO

In 1982, Pawlak proposed the concept of rough sets with a practical purpose of representing indiscernibility of elements or objects in the presence of information systems. Even if 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 real-world applications. Here, coverings of, or nonequivalence relations on, the universe can be considered to represent a more realistic model instead of a partition in which a generalized model of rough sets was proposed. In this paper, first a weak fuzzy similarity relation is introduced as a more realistic relation in representing the relationship between two elements of data in real-world applications. Fuzzy conditional probability relation is considered as a concrete example of the weak fuzzy similarity relation. Coverings of the universe is provided by fuzzy conditional probability relations. Generalized concepts of rough approximations and rough membership functions are proposed and defined based on coverings of the universe. Such generalization is considered as a kind of fuzzy rough set. A more generalized fuzzy rough set approximation of a given fuzzy set is proposed and discussed as an alternative to provide interval-value fuzzy sets. Their properties are examined.


Author(s):  
Angelo Ciaramella ◽  
Angelo Riccio ◽  
Stefano Galmarini ◽  
Giulio Giunta ◽  
Slawomir Potempski

Author(s):  
Roy Gelbard ◽  
Avichai Meged

Representing and consequently processing fuzzy data in standard and binary databases is problematic. The problem is further amplified in binary databases where continuous data is represented by means of discrete ‘1’ and ‘0’ bits. As regards classification, the problem becomes even more acute. In these cases, we may want to group objects based on some fuzzy attributes, but unfortunately, an appropriate fuzzy similarity measure is not always easy to find. The current paper proposes a novel model and measure for representing fuzzy data, which lends itself to both classification and data mining. Classification algorithms and data mining attempt to set up hypotheses regarding the assigning of different objects to groups and classes on the basis of the similarity/distance between them (Estivill-Castro & Yang, 2004) (Lim, Loh & Shih, 2000) (Zhang & Srihari, 2004). Classification algorithms and data mining are widely used in numerous fields including: social sciences, where observations and questionnaires are used in learning mechanisms of social behavior; marketing, for segmentation and customer profiling; finance, for fraud detection; computer science, for image processing and expert systems applications; medicine, for diagnostics; and many other fields. Classification algorithms and data mining methodologies are based on a procedure that calculates a similarity matrix based on similarity index between objects and on a grouping technique. Researches proved that a similarity measure based upon binary data representation yields better results than regular similarity indexes (Erlich, Gelbard & Spiegler, 2002) (Gelbard, Goldman & Spiegler, 2007). However, binary representation is currently limited to nominal discrete attributes suitable for attributes such as: gender, marital status, etc., (Zhang & Srihari, 2003). This makes the binary approach for data representation unattractive for widespread data types. The current research describes a novel approach to binary representation, referred to as Fuzzy Binary Representation. This new approach is suitable for all data types - nominal, ordinal and as continuous. We propose that there is meaning not only to the actual explicit attribute value, but also to its implicit similarity to other possible attribute values. These similarities can either be determined by a problem domain expert or automatically by analyzing fuzzy functions that represent the problem domain. The added new fuzzy similarity yields improved classification and data mining results. More generally, Fuzzy Binary Representation and related similarity measures exemplify that a refined and carefully designed handling of data, including eliciting of domain expertise regarding similarity, may add both value and knowledge to existing databases.


Author(s):  
Mohamed El Alaoui ◽  
Khalid El Yassini

Similarity is an ambiguous term that can be interpreted differently depending on the context of use. In this chapter, the authors review some of its uses before focusing on decision making. Ignoring the uncertainty of human knowledge would be denying a major attribute. Thus, they linked it to the fuzzy context. However, even taking this aspect into consideration, the opinion itself must be relevant. Therefore, the more a decision is similar to other opinions, the more it is coherent. Hence, there is a need to measure the similarity between each couple of expressed opinions.


2019 ◽  
Vol 24 (6) ◽  
pp. 4675-4691 ◽  
Author(s):  
Shivani Singh ◽  
Shivam Shreevastava ◽  
Tanmoy Som ◽  
Gaurav Somani

Author(s):  
Yoshifumi Kusunoki ◽  
◽  
Masahiro Inuiguchi

In this paper, we study rough set models in information tables with missing values. The variable precision rough set model proposed by Ziarko tolerates misclassification error using a membership function in complete information tables. We generalize the variable precision rough set in information tables with missing values. Because of incompleteness, the membership degree of each objects becomes an interval value. We define six different approximate regions using the lower and upper bounds of membership functions. The properties of the proposed rough set model are investigated. Moreover we show that the proposed model is a generalization of rough set models based on similarity relations.


2014 ◽  
Vol 533 ◽  
pp. 237-241
Author(s):  
Xiao Jing Liu ◽  
Wei Feng Du ◽  
Xiao Min

The measure of the significance of the attribute and attribute reduction is one of the core content of rough set theory. The classical rough set model based on equivalence relation, suitable for dealing with discrete-valued attributes. Fuzzy-rough set theory, integrating fuzzy set and rough set theory together, extending equivalence relation to fuzzy relation, can deal with fuzzy-valued attributes. By analyzing three problems of FRAR which is a fuzzy decision table attribute reduction algorithm having extensive use, this paper proposes a new reduction algorithm which has better overcome the problem, can handle larger fuzzy decision table. Experimental results show that our reduction algorithm is much quicker than the FRAR algorithm.


Sign in / Sign up

Export Citation Format

Share Document