Pseudo-Semi-Overlap Functions-Based Fuzzy Rough Sets Applied to Image Edge Extraction

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.

Intuitionistic Fuzzy Rough Sets Based on Two Intuitionistic Fuzzy Implicators

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.

Power Aggregation Operators and Similarity Measures Based on Improved Intuitionistic Hesitant Fuzzy Sets and their Applications to Multiple Attribute Decision Making

Intuitionistic hesitant fuzzy set(IHFS)is amixture of two separated notions called intuitionistic fuzzy set(IFS)and hesitant fuzzy set(HFS),as an important technique to cope with uncertain and awkward information in realistic decision issues.IHFS contains the grades of truth and falsity in the formof the subset of the unit interval.The notion of IHFS was defined by many scholars with different conditions,which contain several weaknesses.Here,keeping in view the problems of already defined IHFSs,we will define IHFS in another way so that it becomes compatible with other existing notions.To examine the interrelationship between any numbers of IHFSs,we combined the notions of power averaging(PA)operators and power geometric(PG)operators with IHFSs to present the idea of intuitionistic hesitant fuzzy PA(IHFPA)operators,intuitionistic hesitant fuzzy PG(IHFPG)operators,intuitionistic hesitant fuzzy power weighted average(IHFPWA)operators,intuitionistic hesitant fuzzy power ordered weighted average(IHFPOWA)operators,intuitionistic hesitant fuzzy power ordered weighted geometric(IHFPOWG)operators,intuitionistic hesitant fuzzy power hybrid average(IHFPHA)operators,intuitionistic hesitant fuzzy power hybrid geometric(IHFPHG)operators and examined as well their fundamental properties.Some special cases of the explored work are also discovered.Additionally,the similarity measures based on IHFSs are presented and their advantages are discussed along examples.Furthermore,we initiated a new approach to multiple attribute decision making(MADM)problem applying suggested operators and a mathematical model is solved to develop an approach and to establish its common sense and adequacy.Advantages,comparative analysis,and graphical representation of the presented work are elaborated to show the reliability and effectiveness of the presented works.

Fuzzy Sets and Rough Sets:a Comparison through an Extension of Obtulowicz's Category

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

A novel similarity measure between intuitionistic fuzzy sets based on the mid points of transformed triangular fuzzy numbers with applications to pattern recognition and medical diagnosis

Similarity measure is an essential tool to compare and determine the degree of similarity between intuitionistic fuzzy sets (IFSs). In this paper, a new similarity measure between intuitionistic fuzzy sets based on the mid points of transformed triangular fuzzy numbers is proposed. The proposed similarity measure provides reasonable results not only for the sets available in the literature but also gives very reasonable results, especially for fuzzy sets as well as for most intuitionistic fuzzy sets. To provide supportive evidence, the proposed similarity measure is tested on certain sets available in literature and is also applied to pattern recognition and medical diagnosis problems. It is observed that the proposed similarity measure provides a very intuitive quantification.

Transformation and entropy for fuzzy rough sets

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.

基于Rough sets和Fuzzy sets理论的约简算法

对决策表约简的一些roughsets和fuzzysets相关概念进行了阐述。在应用Rough集对决策系统进行约简的基础上,结合模糊聚类分析方法,论述了这一可行的决策表约简算法。该算法以属性核与属性重要性的代数定义形式为基础,利用聚类分析的模糊处理方法,解决了约简过程。并给出了对一电器公司全国连锁销售数据约简处理结果,得出了能帮助不同级别决策者进行决策的辅助性的规则知识。

Fuzzy rough sets in Sostak sense

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.

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.

Rough similarity degree and rough close degree in rough fuzzy sets and the applications

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.

New judging model of fuzzy cluster optimal dividing based on rough sets theory

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.

Machine intelligence,rough sets and rough-fuzzy granular computing:uncertainty handling in bio-informatics and Web intelligence

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.

On Similarity Measures and Distance Measures of Fuzzy Soft Sets

In this paper we introduce several new similarity measures and distance measures between fuzzy soft sets, these measures are examined based on the set-theoretic approach and the matching function. Comparative studies of these measures are derived. By introducing two general formulas, we propose a new method to define the similarity measures and the distance measures between two fuzzy soft sets with different parameter sets.

NEW METHOD FOR MEASURING FUZZINESS IN ROUGH SETS

A method with the fuzzy entropy for measuring fuzziness to fuzzy problem in rough sets is proposed. A new sort of the fuzzy entropy is given. The calculating formula and the equivalent expression method with the fuzzy entropy in rough sets based on equivalence relation are provided, and the properties of the fuzzy entropy are proved. The fuzzy entropy based on equivalent relation is extended to generalize the fuzzy entropy based on general binary relation, and the calculating formula and the equivalent expression of the generalized fuzzy entropy are also given. Finally, an example illustrates the way for getting the fuzzy entropy. Results show that the fuzzy entropy can conveniently measure the fuzziness in rough sets.

Rough Sets,Their Extensions and Applications

Rough set theory provides a useful mathematical foundation for developing automated computational systems that can help understand and make use of imperfect knowledge. Despite its recency, the theory and its extensions have been widely applied to many problems, including decision analysis, data mining, intelligent control and pattern recognition. This paper presents an outline of the basic concepts of rough sets and their major extensions, covering variable precision, tolerance and fuzzy rough sets. It also shows the diversity of successful applications these theories have entailed, ranging from financial and business, through biological and medicine, to physical, art, and meteorological.

Information rough communication based on both-branch fuzzy set

The concept of rough communication based on both-branch fuzzy set is proposed, in which the loss of information may exist, for each agent there has a different language and can not provide precise communication to each other. The method of information measure in a rough communication based on both-branch fuzzy set is proposed. By using some concepts, such as ｜α｜-both-branch rough communication cut, the relation theorem between rough communication based on both-branch fuzzy concept and rough communication based on classical concept is obtained. Finally, an example of rough communication based on both-branch fuzzy set is given.

基于Rough Sets和模糊神经网络的汉语兼类词词性标注规则的获取方法

文章提出了基于RoughSets的汉语兼类词初始标注规则的获取方法,并通过模糊神经网络(FNN)进行优化,最后再进行简化获取模糊规则;文章以人工标注过的句子作为训练集和测试集,得出了训练集左3、左4、右3、右4个兼类词标注规则库;对同样的训练集和测试集,采用统计二元模型进行标注后,再利用该方法(粗糙模糊神经网络方法,简称RSFNN)进行二次标注,结果表明RSFNN方法优于统计二元模型方法。最后实例说明汉语兼类词词性标注规则的获取方法。

一种新的集合理论Vague Rough sets

将不确定理论Vague集合和Rough集合相结合,提出一种新的集合理论VagueRoughsets.并讨论了其不确定性性质,如模糊度粗糙度等。

Multi-Granularity Neighborhood Fuzzy Rough Set Model on Two Universes

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.