As an extension of overlap functions, pseudo-semi-overlap functions are a crucial class of aggregation functions. Therefore, (I, PSO)-fuzzy rough sets are introduced, utilizing pseudo-semi-overlap functions, and furth...As an extension of overlap functions, pseudo-semi-overlap functions are a crucial class of aggregation functions. Therefore, (I, PSO)-fuzzy rough sets are introduced, utilizing pseudo-semi-overlap functions, and further extended for applications in image edge extraction. Firstly, a new clustering function, the pseudo-semi-overlap function, is introduced by eliminating the symmetry and right continuity present in the overlap function. The relaxed nature of this function enhances its applicability in image edge extraction. Secondly, the definitions of (I, PSO)-fuzzy rough sets are provided, using (I, PSO)-fuzzy rough sets, a pair of new fuzzy mathematical morphological operators (IPSOFMM operators) is proposed. Finally, by combining the fuzzy C-means algorithm and IPSOFMM operators, a novel image edge extraction algorithm (FCM-IPSO algorithm) is proposed and implemented. Compared to existing algorithms, the FCM-IPSO algorithm exhibits more image edges and a 73.81% decrease in the noise introduction rate. The outstanding performance of (I, PSO)-fuzzy rough sets in image edge extraction demonstrates their practical application value.展开更多
The main goal of informal computing is to overcome the limitations of hypersensitivity to defects and uncertainty while maintaining a balance between high accuracy,accessibility,and cost-effectiveness.This paper inves...The main goal of informal computing is to overcome the limitations of hypersensitivity to defects and uncertainty while maintaining a balance between high accuracy,accessibility,and cost-effectiveness.This paper investigates the potential applications of intuitionistic fuzzy sets(IFS)with rough sets in the context of sparse data.When it comes to capture uncertain information emanating fromboth upper and lower approximations,these intuitionistic fuzzy rough numbers(IFRNs)are superior to intuitionistic fuzzy sets and pythagorean fuzzy sets,respectively.We use rough sets in conjunction with IFSs to develop several fairly aggregation operators and analyze their underlying properties.We present numerous impartial laws that incorporate the idea of proportionate dispersion in order to ensure that the membership and non-membership activities of IFRNs are treated equally within these principles.These operations lead to the development of the intuitionistic fuzzy rough weighted fairly aggregation operator(IFRWFA)and intuitionistic fuzzy rough ordered weighted fairly aggregation operator(IFRFOWA).These operators successfully adjust to membership and non-membership categories with fairness and subtlety.We highlight the unique qualities of these suggested aggregation operators and investigate their use in the multiattribute decision-making field.We use the intuitionistic fuzzy rough environment’s architecture to create a novel strategy in situation involving several decision-makers and non-weighted data.Additionally,we developed a novel technique by combining the IFSs with quaternion numbers.We establish a unique connection between alternatives and qualities by using intuitionistic fuzzy quaternion numbers(IFQNs).With the help of this framework,we can simulate uncertainty in real-world situations and address a number of decision-making problems.Using the examples we have released,we offer a sophisticated and systematically constructed illustrative scenario that is intricately woven with the complexity ofmedical evaluation in order to thoroughly assess the relevance and efficacy of the suggested methodology.展开更多
The two universes multi-granularity fuzzy rough set model is an effective tool for handling uncertainty problems between two domains with the help of binary fuzzy relations. This article applies the idea of neighborho...The two universes multi-granularity fuzzy rough set model is an effective tool for handling uncertainty problems between two domains with the help of binary fuzzy relations. This article applies the idea of neighborhood rough sets to two universes multi-granularity fuzzy rough sets, and discusses the two-universes multi-granularity neighborhood fuzzy rough set model. Firstly, the upper and lower approximation operators are defined in the two universes multi-granularity neighborhood fuzzy rough set model. Secondly, the properties of the upper and lower approximation operators are discussed. Finally, the properties of the two universes multi-granularity neighborhood fuzzy rough set model are verified through case studies.展开更多
To study the problem of knowledge translation in fuzzy approximation spaces, the concept of rough communication of crisp set in fuzzy approximation spaces is proposed. In a rough communication of crisp set in fuzzy ap...To study the problem of knowledge translation in fuzzy approximation spaces, the concept of rough communication of crisp set in fuzzy approximation spaces is proposed. In a rough communication of crisp set in fuzzy approximation spaces, the problem of uncertainty exists, for each agent has a different language and cannot provide precise communication to each other. By means of some concepts, such as CF rough communication cut, which is a bridge between fuzzy concept and crisp concept, cut analysis of CF rough communication is made, and the relation theorem between CF rough communication and rough communication of crisp concept is obtained. Finally, in order to give an intuitive analysis of the relation between CF rough communication and rough communication of crisp concept, an example is given.展开更多
The presence of numerous uncertainties in hybrid decision information systems(HDISs)renders attribute reduction a formidable task.Currently available attribute reduction algorithms,including those based on Pawlak attr...The presence of numerous uncertainties in hybrid decision information systems(HDISs)renders attribute reduction a formidable task.Currently available attribute reduction algorithms,including those based on Pawlak attribute importance,Skowron discernibility matrix,and information entropy,struggle to effectively manages multiple uncertainties simultaneously in HDISs like the precise measurement of disparities between nominal attribute values,and attributes with fuzzy boundaries and abnormal values.In order to address the aforementioned issues,this paper delves into the study of attribute reduction withinHDISs.First of all,a novel metric based on the decision attribute is introduced to solve the problem of accurately measuring the differences between nominal attribute values.The newly introduced distance metric has been christened the supervised distance that can effectively quantify the differences between the nominal attribute values.Then,based on the newly developed metric,a novel fuzzy relationship is defined from the perspective of“feedback on parity of attribute values to attribute sets”.This new fuzzy relationship serves as a valuable tool in addressing the challenges posed by abnormal attribute values.Furthermore,leveraging the newly introduced fuzzy relationship,the fuzzy conditional information entropy is defined as a solution to the challenges posed by fuzzy attributes.It effectively quantifies the uncertainty associated with fuzzy attribute values,thereby providing a robust framework for handling fuzzy information in hybrid information systems.Finally,an algorithm for attribute reduction utilizing the fuzzy conditional information entropy is presented.The experimental results on 12 datasets show that the average reduction rate of our algorithm reaches 84.04%,and the classification accuracy is improved by 3.91%compared to the original dataset,and by an average of 11.25%compared to the other 9 state-of-the-art reduction algorithms.The comprehensive analysis of these research results clearly indicates that our algorithm is highly effective in managing the intricate uncertainties inherent in hybrid data.展开更多
This paper presents a general framework for the study of relation-based intuitionistic fuzzy rough sets determined by two intuitionistic fuzzy implicators.By employing two intuitionistic fuzzy implicators I and J,I -l...This paper presents a general framework for the study of relation-based intuitionistic fuzzy rough sets determined by two intuitionistic fuzzy implicators.By employing two intuitionistic fuzzy implicators I and J,I -lower and J-upper approximations of intuitionistic fuzzy sets with respect to an intuitionistic fuzzy approximation space are first defined.Properties of(I,J) -intuitionistic fuzzy rough approximation operators are then examined.The connections between special types of intuitionistic fuzzy relations and properties of (I,J)-intuitionistic fuzzy approximation operators are also established.展开更多
A new method for translating a fuzzy rough set to a fuzzy set is introduced and the fuzzy approximation of a fuzzy rough set is given. The properties of the fuzzy approximation of a fuzzy rough set are studied and a f...A new method for translating a fuzzy rough set to a fuzzy set is introduced and the fuzzy approximation of a fuzzy rough set is given. The properties of the fuzzy approximation of a fuzzy rough set are studied and a fuzzy entropy measure for fuzzy rough sets is proposed. This measure is consistent with similar considerations for ordinary fuzzy sets and is the result of the fuzzy approximation of fuzzy rough sets.展开更多
A new image recognition method based on fuzzy rough sets theory is proposed, and its implementation discussed. The performance of this method as applied to ferrography image recognition is evaluated. It is shown that...A new image recognition method based on fuzzy rough sets theory is proposed, and its implementation discussed. The performance of this method as applied to ferrography image recognition is evaluated. It is shown that the new method gives better results than fuzzy or rough sets method when used alone.展开更多
In this paper,we defined the fuzzy operator Φ_(λ) in a fuzzy ideal approximation space(X,R,I)associated with a fuzzy rough set λ in Sostak sense.Associated with Φ_(λ),there are fuzzy ideal interior and closure op...In this paper,we defined the fuzzy operator Φ_(λ) in a fuzzy ideal approximation space(X,R,I)associated with a fuzzy rough set λ in Sostak sense.Associated with Φ_(λ),there are fuzzy ideal interior and closure operators int_(Φ)^(λ) and cl_(Φ)^(λ),respectively.r-fuzzy separation axioms,r-fuzzy connectedness and r-fuzzy compactness in fuzzy ideal approximation spaces are defined and compared with the relative notions in r-fuzzy approximation spaces.There are many differences when studying these notions related with a fuzzy ideal different from studying these notions in usual fuzzy approximation spaces.Lastly,using a fuzzy grill,we will get the same results given during the context.展开更多
To investigate the judging problem of optimal dividing matrix among several fuzzy dividing matrices in fuzzy dividing space, correspondingly, which is determined by the various choices of cluster samples in the totali...To investigate the judging problem of optimal dividing matrix among several fuzzy dividing matrices in fuzzy dividing space, correspondingly, which is determined by the various choices of cluster samples in the totality sample space, two algorithms are proposed on the basis of the data analysis method in rough sets theory： information system discrete algorithm （algorithm 1） and samples representatives judging algorithm （algorithm 2）. On the principle of the farthest distance, algorithm 1 transforms continuous data into discrete form which could be transacted by rough sets theory. Taking the approximate precision as a criterion, algorithm 2 chooses the sample space with a good representative. Hence, the clustering sample set in inducing and computing optimal dividing matrix can be achieved. Several theorems are proposed to provide strict theoretic foundations for the execution of the algorithm model. An applied example based on the new algorithm model is given, whose result verifies the feasibility of this new algorithm model.展开更多
Based on rough similarity degree of rough sets and close degree of fuzzy sets, the definitions of rough similarity degree and rough close degree of rough fuzzy sets are given, which can be used to measure the similar ...Based on rough similarity degree of rough sets and close degree of fuzzy sets, the definitions of rough similarity degree and rough close degree of rough fuzzy sets are given, which can be used to measure the similar degree between two rough fuzzy sets. The properties and theorems are listed. Using the two new measures, the method of clustering in the rough fuzzy system can be obtained. After clustering, the new fuzzy sample can be recognized by the principle of maximal similarity degree.展开更多
This paper combines interval-valued intuitionistic fuzzy sets and rough sets.It studies rougheness in interval-valued intuitionistic fuzzy sets and proposes one kind of interval-valued intuitionistic fuzzy-rough sets ...This paper combines interval-valued intuitionistic fuzzy sets and rough sets.It studies rougheness in interval-valued intuitionistic fuzzy sets and proposes one kind of interval-valued intuitionistic fuzzy-rough sets models under the equivalence relation in crisp sets.That extends the classical rough set defined by Pawlak.展开更多
This paper is a purely mathematical one dealing with a common possible foundation of Fuzzy Set Theory and Rough Set Theory.It begins with a generalization of Obtulowicz's paper,rough sets and Heyting algebra value...This paper is a purely mathematical one dealing with a common possible foundation of Fuzzy Set Theory and Rough Set Theory.It begins with a generalization of Obtulowicz's paper,rough sets and Heyting algebra valued sets,published in Bull.Polish Acad Sc.(math),198.In this paper Obtulowicz proposes a special subcategory展开更多
Machine intelligence,is out of the system by the artificial intelligence shown.It is usually achieved by the average computer intelligence.Rough sets and Information Granules in uncertainty management and soft computi...Machine intelligence,is out of the system by the artificial intelligence shown.It is usually achieved by the average computer intelligence.Rough sets and Information Granules in uncertainty management and soft computing and granular computing is widely used in many fields,such as in protein sequence analysis and biobasis determination,TSM and Web service classification Etc.展开更多
Variable precision rough set (VPRS) is an extension of rough set theory (RST). By setting threshold value β , VPRS looses the strict definition of approximate boundary in RST. Confident threshold value for β is disc...Variable precision rough set (VPRS) is an extension of rough set theory (RST). By setting threshold value β , VPRS looses the strict definition of approximate boundary in RST. Confident threshold value for β is discussed and the method for deriving decision making rules from an information system is given by an example. An approach to fuzzy measures of knowledge is proposed by applying VPRS to fuzzy sets. Some properties of this measure are studied and a pair of lower and upper approximation operato...展开更多
文摘As an extension of overlap functions, pseudo-semi-overlap functions are a crucial class of aggregation functions. Therefore, (I, PSO)-fuzzy rough sets are introduced, utilizing pseudo-semi-overlap functions, and further extended for applications in image edge extraction. Firstly, a new clustering function, the pseudo-semi-overlap function, is introduced by eliminating the symmetry and right continuity present in the overlap function. The relaxed nature of this function enhances its applicability in image edge extraction. Secondly, the definitions of (I, PSO)-fuzzy rough sets are provided, using (I, PSO)-fuzzy rough sets, a pair of new fuzzy mathematical morphological operators (IPSOFMM operators) is proposed. Finally, by combining the fuzzy C-means algorithm and IPSOFMM operators, a novel image edge extraction algorithm (FCM-IPSO algorithm) is proposed and implemented. Compared to existing algorithms, the FCM-IPSO algorithm exhibits more image edges and a 73.81% decrease in the noise introduction rate. The outstanding performance of (I, PSO)-fuzzy rough sets in image edge extraction demonstrates their practical application value.
基金funded by King Khalid University through a large group research project under Grant Number R.G.P.2/449/44.
文摘The main goal of informal computing is to overcome the limitations of hypersensitivity to defects and uncertainty while maintaining a balance between high accuracy,accessibility,and cost-effectiveness.This paper investigates the potential applications of intuitionistic fuzzy sets(IFS)with rough sets in the context of sparse data.When it comes to capture uncertain information emanating fromboth upper and lower approximations,these intuitionistic fuzzy rough numbers(IFRNs)are superior to intuitionistic fuzzy sets and pythagorean fuzzy sets,respectively.We use rough sets in conjunction with IFSs to develop several fairly aggregation operators and analyze their underlying properties.We present numerous impartial laws that incorporate the idea of proportionate dispersion in order to ensure that the membership and non-membership activities of IFRNs are treated equally within these principles.These operations lead to the development of the intuitionistic fuzzy rough weighted fairly aggregation operator(IFRWFA)and intuitionistic fuzzy rough ordered weighted fairly aggregation operator(IFRFOWA).These operators successfully adjust to membership and non-membership categories with fairness and subtlety.We highlight the unique qualities of these suggested aggregation operators and investigate their use in the multiattribute decision-making field.We use the intuitionistic fuzzy rough environment’s architecture to create a novel strategy in situation involving several decision-makers and non-weighted data.Additionally,we developed a novel technique by combining the IFSs with quaternion numbers.We establish a unique connection between alternatives and qualities by using intuitionistic fuzzy quaternion numbers(IFQNs).With the help of this framework,we can simulate uncertainty in real-world situations and address a number of decision-making problems.Using the examples we have released,we offer a sophisticated and systematically constructed illustrative scenario that is intricately woven with the complexity ofmedical evaluation in order to thoroughly assess the relevance and efficacy of the suggested methodology.
文摘The two universes multi-granularity fuzzy rough set model is an effective tool for handling uncertainty problems between two domains with the help of binary fuzzy relations. This article applies the idea of neighborhood rough sets to two universes multi-granularity fuzzy rough sets, and discusses the two-universes multi-granularity neighborhood fuzzy rough set model. Firstly, the upper and lower approximation operators are defined in the two universes multi-granularity neighborhood fuzzy rough set model. Secondly, the properties of the upper and lower approximation operators are discussed. Finally, the properties of the two universes multi-granularity neighborhood fuzzy rough set model are verified through case studies.
基金supported by the Natural Science Foundation of Shandong Province (Y2006A12)the Scientific Research Development Project of Shandong Provincial Education Department (J06P01)+2 种基金the Science and Technology Foundation of Universityof Jinan (XKY0808 XKY0703)the Doctoral Foundation of University of Jinan (B0633).
文摘To study the problem of knowledge translation in fuzzy approximation spaces, the concept of rough communication of crisp set in fuzzy approximation spaces is proposed. In a rough communication of crisp set in fuzzy approximation spaces, the problem of uncertainty exists, for each agent has a different language and cannot provide precise communication to each other. By means of some concepts, such as CF rough communication cut, which is a bridge between fuzzy concept and crisp concept, cut analysis of CF rough communication is made, and the relation theorem between CF rough communication and rough communication of crisp concept is obtained. Finally, in order to give an intuitive analysis of the relation between CF rough communication and rough communication of crisp concept, an example is given.
基金Anhui Province Natural Science Research Project of Colleges and Universities(2023AH040321)Excellent Scientific Research and Innovation Team of Anhui Colleges(2022AH010098).
文摘The presence of numerous uncertainties in hybrid decision information systems(HDISs)renders attribute reduction a formidable task.Currently available attribute reduction algorithms,including those based on Pawlak attribute importance,Skowron discernibility matrix,and information entropy,struggle to effectively manages multiple uncertainties simultaneously in HDISs like the precise measurement of disparities between nominal attribute values,and attributes with fuzzy boundaries and abnormal values.In order to address the aforementioned issues,this paper delves into the study of attribute reduction withinHDISs.First of all,a novel metric based on the decision attribute is introduced to solve the problem of accurately measuring the differences between nominal attribute values.The newly introduced distance metric has been christened the supervised distance that can effectively quantify the differences between the nominal attribute values.Then,based on the newly developed metric,a novel fuzzy relationship is defined from the perspective of“feedback on parity of attribute values to attribute sets”.This new fuzzy relationship serves as a valuable tool in addressing the challenges posed by abnormal attribute values.Furthermore,leveraging the newly introduced fuzzy relationship,the fuzzy conditional information entropy is defined as a solution to the challenges posed by fuzzy attributes.It effectively quantifies the uncertainty associated with fuzzy attribute values,thereby providing a robust framework for handling fuzzy information in hybrid information systems.Finally,an algorithm for attribute reduction utilizing the fuzzy conditional information entropy is presented.The experimental results on 12 datasets show that the average reduction rate of our algorithm reaches 84.04%,and the classification accuracy is improved by 3.91%compared to the original dataset,and by an average of 11.25%compared to the other 9 state-of-the-art reduction algorithms.The comprehensive analysis of these research results clearly indicates that our algorithm is highly effective in managing the intricate uncertainties inherent in hybrid data.
基金supported by grants from the National Natural Science Foundation of China(Nos.61075120, 60673096 and 60773174)the Natural Science Foundation of Zhejiang Province in China(No.Y107262).
文摘This paper presents a general framework for the study of relation-based intuitionistic fuzzy rough sets determined by two intuitionistic fuzzy implicators.By employing two intuitionistic fuzzy implicators I and J,I -lower and J-upper approximations of intuitionistic fuzzy sets with respect to an intuitionistic fuzzy approximation space are first defined.Properties of(I,J) -intuitionistic fuzzy rough approximation operators are then examined.The connections between special types of intuitionistic fuzzy relations and properties of (I,J)-intuitionistic fuzzy approximation operators are also established.
基金the National Natural Science Foundation of China (60364001, 70461001)Hainan ProvincialNatural Science Foundation of China (80401).
文摘A new method for translating a fuzzy rough set to a fuzzy set is introduced and the fuzzy approximation of a fuzzy rough set is given. The properties of the fuzzy approximation of a fuzzy rough set are studied and a fuzzy entropy measure for fuzzy rough sets is proposed. This measure is consistent with similar considerations for ordinary fuzzy sets and is the result of the fuzzy approximation of fuzzy rough sets.
文摘A new image recognition method based on fuzzy rough sets theory is proposed, and its implementation discussed. The performance of this method as applied to ferrography image recognition is evaluated. It is shown that the new method gives better results than fuzzy or rough sets method when used alone.
文摘In this paper,we defined the fuzzy operator Φ_(λ) in a fuzzy ideal approximation space(X,R,I)associated with a fuzzy rough set λ in Sostak sense.Associated with Φ_(λ),there are fuzzy ideal interior and closure operators int_(Φ)^(λ) and cl_(Φ)^(λ),respectively.r-fuzzy separation axioms,r-fuzzy connectedness and r-fuzzy compactness in fuzzy ideal approximation spaces are defined and compared with the relative notions in r-fuzzy approximation spaces.There are many differences when studying these notions related with a fuzzy ideal different from studying these notions in usual fuzzy approximation spaces.Lastly,using a fuzzy grill,we will get the same results given during the context.
文摘To investigate the judging problem of optimal dividing matrix among several fuzzy dividing matrices in fuzzy dividing space, correspondingly, which is determined by the various choices of cluster samples in the totality sample space, two algorithms are proposed on the basis of the data analysis method in rough sets theory： information system discrete algorithm （algorithm 1） and samples representatives judging algorithm （algorithm 2）. On the principle of the farthest distance, algorithm 1 transforms continuous data into discrete form which could be transacted by rough sets theory. Taking the approximate precision as a criterion, algorithm 2 chooses the sample space with a good representative. Hence, the clustering sample set in inducing and computing optimal dividing matrix can be achieved. Several theorems are proposed to provide strict theoretic foundations for the execution of the algorithm model. An applied example based on the new algorithm model is given, whose result verifies the feasibility of this new algorithm model.
基金the Fujian Provincial Natural Science Foundation of China (Z0510492006J0391)
文摘Based on rough similarity degree of rough sets and close degree of fuzzy sets, the definitions of rough similarity degree and rough close degree of rough fuzzy sets are given, which can be used to measure the similar degree between two rough fuzzy sets. The properties and theorems are listed. Using the two new measures, the method of clustering in the rough fuzzy system can be obtained. After clustering, the new fuzzy sample can be recognized by the principle of maximal similarity degree.
基金supported by grants from the National Natural Science Foundation of China(Nos.10971185 and 10971186)the Natural Science Foundation of Fujiang Province in China(No.2008F5066).
文摘This paper combines interval-valued intuitionistic fuzzy sets and rough sets.It studies rougheness in interval-valued intuitionistic fuzzy sets and proposes one kind of interval-valued intuitionistic fuzzy-rough sets models under the equivalence relation in crisp sets.That extends the classical rough set defined by Pawlak.
文摘This paper is a purely mathematical one dealing with a common possible foundation of Fuzzy Set Theory and Rough Set Theory.It begins with a generalization of Obtulowicz's paper,rough sets and Heyting algebra valued sets,published in Bull.Polish Acad Sc.(math),198.In this paper Obtulowicz proposes a special subcategory
文摘Machine intelligence,is out of the system by the artificial intelligence shown.It is usually achieved by the average computer intelligence.Rough sets and Information Granules in uncertainty management and soft computing and granular computing is widely used in many fields,such as in protein sequence analysis and biobasis determination,TSM and Web service classification Etc.
文摘Variable precision rough set (VPRS) is an extension of rough set theory (RST). By setting threshold value β , VPRS looses the strict definition of approximate boundary in RST. Confident threshold value for β is discussed and the method for deriving decision making rules from an information system is given by an example. An approach to fuzzy measures of knowledge is proposed by applying VPRS to fuzzy sets. Some properties of this measure are studied and a pair of lower and upper approximation operato...
