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.展开更多
Recently,much interest has been given tomulti-granulation rough sets (MGRS), and various types ofMGRSmodelshave been developed from different viewpoints. In this paper, we introduce two techniques for the classificati...Recently,much interest has been given tomulti-granulation rough sets (MGRS), and various types ofMGRSmodelshave been developed from different viewpoints. In this paper, we introduce two techniques for the classificationof MGRS. Firstly, we generate multi-topologies from multi-relations defined in the universe. Hence, a novelapproximation space is established by leveraging the underlying topological structure. The characteristics of thenewly proposed approximation space are discussed.We introduce an algorithmfor the reduction ofmulti-relations.Secondly, a new approach for the classification ofMGRS based on neighborhood concepts is introduced. Finally, areal-life application from medical records is introduced via our approach to the classification of MGRS.展开更多
For neighborhood rough set attribute reduction algorithms based on dependency degree,a neighborhood computation method incorporating attribute weight values and a neighborhood rough set attribute reduction algorithm u...For neighborhood rough set attribute reduction algorithms based on dependency degree,a neighborhood computation method incorporating attribute weight values and a neighborhood rough set attribute reduction algorithm using discernment as the heuristic information was proposed.The reduction algorithm comprehensively considers the dependency degree and neighborhood granulation degree of attributes,allowing for a more accurate measurement of the importance degrees of attributes.Example analyses and experimental results demonstrate the feasibility and effectiveness of the algorithm.展开更多
This article focuses on the relationship between mathematical morphology operations and rough sets,mainly based on the context of image retrieval and the basic image correspondence problem.Mathematical morphological p...This article focuses on the relationship between mathematical morphology operations and rough sets,mainly based on the context of image retrieval and the basic image correspondence problem.Mathematical morphological procedures and set approximations in rough set theory have some clear parallels.Numerous initiatives have been made to connect rough sets with mathematical morphology.Numerous significant publications have been written in this field.Others attempt to show a direct connection between mathematical morphology and rough sets through relations,a pair of dual operations,and neighborhood systems.Rough sets are used to suggest a strategy to approximatemathematicalmorphology within the general paradigm of soft computing.A single framework is defined using a different technique that incorporates the key ideas of both rough sets and mathematical morphology.This paper examines rough set theory from the viewpoint of mathematical morphology to derive rough forms of themorphological structures of dilation,erosion,opening,and closing.These newly defined structures are applied to develop algorithm for the differential analysis of chest X-ray images from a COVID-19 patient with acute pneumonia and a health subject.The algorithm and rough morphological operations show promise for the delineation of lung occlusion in COVID-19 patients from chest X-rays.The foundations of mathematical morphology are covered in this article.After that,rough set theory ideas are taken into account,and their connections are examined.Finally,a suggested image retrieval application of the concepts from these two fields is provided.展开更多
Attribute reduction,as one of the essential applications of the rough set,has attracted extensive attention from scholars.Information granulation is a key step of attribute reduction,and its efficiency has a significa...Attribute reduction,as one of the essential applications of the rough set,has attracted extensive attention from scholars.Information granulation is a key step of attribute reduction,and its efficiency has a significant impact on the overall efficiency of attribute reduction.The information granulation of the existing neighborhood rough set models is usually a single layer,and the construction of each information granule needs to search all the samples in the universe,which is inefficient.To fill such gap,a new neighborhood rough set model is proposed,which aims to improve the efficiency of attribute reduction by means of two-layer information granulation.The first layer of information granulation constructs a mapping-equivalence relation that divides the universe into multiple mutually independent mapping-equivalence classes.The second layer of information granulation views each mapping-equivalence class as a sub-universe and then performs neighborhood informa-tion granulation.A model named mapping-equivalence neighborhood rough set model is derived from the strategy of two-layer information granulation.Experimental results show that compared with other neighborhood rough set models,this model can effectively improve the efficiency of attribute reduction and reduce the uncertainty of the system.The strategy provides a new thinking for the exploration of neighborhood rough set models and the study of attribute reduction acceleration problems.展开更多
Attribute reduction is a hot topic in rough set research. As an extension of rough sets, neighborhood rough sets can effectively solve the problem of information loss after data discretization. However, traditional gr...Attribute reduction is a hot topic in rough set research. As an extension of rough sets, neighborhood rough sets can effectively solve the problem of information loss after data discretization. However, traditional greedy-based neighborhood rough set attribute reduction algorithms have a high computational complexity and long processing time. In this paper, a novel attribute reduction algorithm based on attribute importance is proposed. By using conditional information, the attribute reduction problem in neighborhood rough sets is discussed, and the importance of attributes is measured by conditional information gain. The algorithm iteratively removes the attribute with the lowest importance, thus achieving the goal of attribute reduction. Six groups of UCI datasets are selected, and the proposed algorithm SAR is compared with L<sub>2</sub>-ELM, LapTELM, CTSVM, and TBSVM classifiers. The results demonstrate that SAR can effectively improve the time consumption and accuracy issues in attribute reduction.展开更多
In this paper,a counterpart of definability is studied in texture spaces.The concept of textural complete field is defined and the relations with textural definable sets are investigated.If a texture is discrete,then ...In this paper,a counterpart of definability is studied in texture spaces.The concept of textural complete field is defined and the relations with textural definable sets are investigated.If a texture is discrete,then textural definability coincides with definability.Using this fact,we obtain some basic results for definability in rough set algebras.Further,we discuss on definability for fuzzy rough sets considering textural fuzzy direlations.展开更多
Based on S-rough sets(singular rough sets), this paper presents function S-rough sets (function singular rough sets)and its mathematical structures and features. Function S-rough sets has two forms: function one ...Based on S-rough sets(singular rough sets), this paper presents function S-rough sets (function singular rough sets)and its mathematical structures and features. Function S-rough sets has two forms: function one direction S-rough sets (function one direction singular rough sets) and function two direction S-rough sets (function two direction singular rough sets). This paper advances the relationship theorem of function S-rough sets and S-rough sets. Function S-rough sets is the general form of S-rough sets, and S-rough sets is the special ease of function S-rough sets. In this paper, applications of function S-rough sets in rough law mining-discovery of system are given. Function S-rough sets is a new research direction of rough sets and rough system.展开更多
Function S-rough sets (function singular rough sets) is defined on a -function equivalence class [u]. Function S-rough sets is the extension form of S-rough sets. By using the function S-rough sets, this paper gives...Function S-rough sets (function singular rough sets) is defined on a -function equivalence class [u]. Function S-rough sets is the extension form of S-rough sets. By using the function S-rough sets, this paper gives rough law generation model of a-function equivalence class, discussion on law mining and law discovery in systems, and application of law mining and law discovery in communication system. Function S-rough sets is a new theory and method in law mining research.展开更多
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.展开更多
In rough set theory, crisp and/or fuzzy binary relations play an important role in both constructive and axiomatic considerations of various generalized rough sets. This paper considers the uniqueness problem of the ...In rough set theory, crisp and/or fuzzy binary relations play an important role in both constructive and axiomatic considerations of various generalized rough sets. This paper considers the uniqueness problem of the (fuzzy) relation in some generalized rough set model. Our results show that by using the axiomatic approach, the (fuzzy) relation determined by (fuzzy) approximation operators is unique in some (fuzzy) double-universe model.展开更多
In this paper,we present a proposed method for generating a soft rough approximation as a modification and generalization of Zhaowen et al.approach.Comparisons were obtained between our approach and the previous study...In this paper,we present a proposed method for generating a soft rough approximation as a modification and generalization of Zhaowen et al.approach.Comparisons were obtained between our approach and the previous study and also.Eventually,an application on Coronavirus(COVID-19)has been presented,illustrated using our proposed concept,and some influencing results for symptoms of Coronavirus patients have been deduced.Moreover,following these concepts,we construct an algorithm and apply it to a decision-making problem to demonstrate the applicability of our proposed approach.Finally,a proposed approach that competes with others has been obtained,as well as realistic results for patients with Coronavirus.Moreover,we used MATLAB programming to obtain the results;these results are consistent with those of theWorld Health Organization and an accurate proposal competing with the method of Zhaowen et al.has been studied.Therefore,it is recommended that our proposed concept be used in future decision making.展开更多
The preference analysis is a class of important issues in multi-criteria ordinal decision making.The rough set is an effective approach to handle preference analysis.In order to solve the multi-criteria preference ana...The preference analysis is a class of important issues in multi-criteria ordinal decision making.The rough set is an effective approach to handle preference analysis.In order to solve the multi-criteria preference analysis problems,this paper improves the preference relation rough set model and expands it to multi-granulation cases.Cost is also an important issue in the field of decision analysis.Taking the cost into consideration,we also expand the model to the cost sensitive multi-granulation preference relation rough set.Some theorems are represented,and the granule structure selection based on approximation quality is investigated.The experimental results show that the multi-granulation preference rough set approach with the consideration of cost has a better performance in granule structure selection than that without cost consideration.展开更多
This paper gives the definition of λ-cut sets and studies the structure of fuzzy rough sets. Based on the concept of rough sets, this paper proposes the representation theorem of fuzzy rough sets.
Dominance-based rough set approach(DRSA) permits representation and analysis of all phenomena involving monotonicity relationship between some measures or perceptions.DRSA has also some merits within granular computin...Dominance-based rough set approach(DRSA) permits representation and analysis of all phenomena involving monotonicity relationship between some measures or perceptions.DRSA has also some merits within granular computing,as it extends the paradigm of granular computing to ordered data,specifies a syntax and modality of information granules which are appropriate for dealing with ordered data,and enables computing with words and reasoning about ordered data.Granular computing with ordered data is a very general paradigm,because other modalities of information constraints,such as veristic,possibilistic and probabilistic modalities,have also to deal with ordered value sets(with qualifiers relative to grades of truth,possibility and probability),which gives DRSA a large area of applications.展开更多
In order to increase intrusion detection rate and decrease false positive detection rate,a novel intrusion detection algorithm based on rough set and artificial immune( RSAI-IDA) is proposed.Using artificial immune in...In order to increase intrusion detection rate and decrease false positive detection rate,a novel intrusion detection algorithm based on rough set and artificial immune( RSAI-IDA) is proposed.Using artificial immune in intrusion detection,anomaly actions are detected adaptively,and with rough set,effective antibodies can be obtained. A scheme,in which antibodies are partly generated randomly and others are from the artificial immune algorithm,is applied to ensure the antibodies diversity. Finally,simulations of RSAI-IDA and comparisons with other algorithms are given. The experimental results illustrate that the novel algorithm achieves more effective performances on anomaly intrusion detection,where the algorithm's time complexity decreases,the true positive detection rate increases,and the false positive detection rate is decreased.展开更多
The coveting rough sets theory is a generalization of traditional rough set theory, and can also describe information with incompleteness and fuzziness in information systems. In this paper, we first provide the defin...The coveting rough sets theory is a generalization of traditional rough set theory, and can also describe information with incompleteness and fuzziness in information systems. In this paper, we first provide the definitions of several upper and lower covering approximation operators on the covering approximation space. Then, we study the properties of these operators. Finally, we propose the mutual relations between approximation operators and similar relations of the operator ( I ) based on the covering rough sets.展开更多
Soft computing is a combination of methods that complement each other when dealing with ambiguous real life decision systems. Rough Set Theory (RST) is a technique used in soft computing that enhances the idea of clas...Soft computing is a combination of methods that complement each other when dealing with ambiguous real life decision systems. Rough Set Theory (RST) is a technique used in soft computing that enhances the idea of classical sets to deal with incomplete knowledge and provides a mechanism for concept approximation. It uses reducts to isolate key attributes affecting outcomes in decision systems. The paper summarizes two algorithms for reduct calculation. Moreover, to automate the application of RST, different software packages are available. The paper provides a survey of packages that are most frequently used to perform data analysis based on Rough Sets. For benefit of researchers, a comparison of based on functionalities of those software is also provided.展开更多
文摘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.
文摘Recently,much interest has been given tomulti-granulation rough sets (MGRS), and various types ofMGRSmodelshave been developed from different viewpoints. In this paper, we introduce two techniques for the classificationof MGRS. Firstly, we generate multi-topologies from multi-relations defined in the universe. Hence, a novelapproximation space is established by leveraging the underlying topological structure. The characteristics of thenewly proposed approximation space are discussed.We introduce an algorithmfor the reduction ofmulti-relations.Secondly, a new approach for the classification ofMGRS based on neighborhood concepts is introduced. Finally, areal-life application from medical records is introduced via our approach to the classification of MGRS.
基金Anhui Provincial University Research Project(Project Number:2023AH051659)Tongling University Talent Research Initiation Fund Project(Project Number:2022tlxyrc31)+1 种基金Tongling University School-Level Scientific Research Project(Project Number:2021tlxytwh05)Tongling University Horizontal Project(Project Number:2023tlxyxdz237)。
文摘For neighborhood rough set attribute reduction algorithms based on dependency degree,a neighborhood computation method incorporating attribute weight values and a neighborhood rough set attribute reduction algorithm using discernment as the heuristic information was proposed.The reduction algorithm comprehensively considers the dependency degree and neighborhood granulation degree of attributes,allowing for a more accurate measurement of the importance degrees of attributes.Example analyses and experimental results demonstrate the feasibility and effectiveness of the algorithm.
文摘This article focuses on the relationship between mathematical morphology operations and rough sets,mainly based on the context of image retrieval and the basic image correspondence problem.Mathematical morphological procedures and set approximations in rough set theory have some clear parallels.Numerous initiatives have been made to connect rough sets with mathematical morphology.Numerous significant publications have been written in this field.Others attempt to show a direct connection between mathematical morphology and rough sets through relations,a pair of dual operations,and neighborhood systems.Rough sets are used to suggest a strategy to approximatemathematicalmorphology within the general paradigm of soft computing.A single framework is defined using a different technique that incorporates the key ideas of both rough sets and mathematical morphology.This paper examines rough set theory from the viewpoint of mathematical morphology to derive rough forms of themorphological structures of dilation,erosion,opening,and closing.These newly defined structures are applied to develop algorithm for the differential analysis of chest X-ray images from a COVID-19 patient with acute pneumonia and a health subject.The algorithm and rough morphological operations show promise for the delineation of lung occlusion in COVID-19 patients from chest X-rays.The foundations of mathematical morphology are covered in this article.After that,rough set theory ideas are taken into account,and their connections are examined.Finally,a suggested image retrieval application of the concepts from these two fields is provided.
基金supported by the National Natural Science Foundation of China (Nos.62006099,62076111)the Key Laboratory of Oceanographic Big Data Mining&Application of Zhejiang Province (No.OBDMA202104).
文摘Attribute reduction,as one of the essential applications of the rough set,has attracted extensive attention from scholars.Information granulation is a key step of attribute reduction,and its efficiency has a significant impact on the overall efficiency of attribute reduction.The information granulation of the existing neighborhood rough set models is usually a single layer,and the construction of each information granule needs to search all the samples in the universe,which is inefficient.To fill such gap,a new neighborhood rough set model is proposed,which aims to improve the efficiency of attribute reduction by means of two-layer information granulation.The first layer of information granulation constructs a mapping-equivalence relation that divides the universe into multiple mutually independent mapping-equivalence classes.The second layer of information granulation views each mapping-equivalence class as a sub-universe and then performs neighborhood informa-tion granulation.A model named mapping-equivalence neighborhood rough set model is derived from the strategy of two-layer information granulation.Experimental results show that compared with other neighborhood rough set models,this model can effectively improve the efficiency of attribute reduction and reduce the uncertainty of the system.The strategy provides a new thinking for the exploration of neighborhood rough set models and the study of attribute reduction acceleration problems.
文摘Attribute reduction is a hot topic in rough set research. As an extension of rough sets, neighborhood rough sets can effectively solve the problem of information loss after data discretization. However, traditional greedy-based neighborhood rough set attribute reduction algorithms have a high computational complexity and long processing time. In this paper, a novel attribute reduction algorithm based on attribute importance is proposed. By using conditional information, the attribute reduction problem in neighborhood rough sets is discussed, and the importance of attributes is measured by conditional information gain. The algorithm iteratively removes the attribute with the lowest importance, thus achieving the goal of attribute reduction. Six groups of UCI datasets are selected, and the proposed algorithm SAR is compared with L<sub>2</sub>-ELM, LapTELM, CTSVM, and TBSVM classifiers. The results demonstrate that SAR can effectively improve the time consumption and accuracy issues in attribute reduction.
基金supported by the Turkish Scientific and Technological Research Council under the project TBAG 109T683.
文摘In this paper,a counterpart of definability is studied in texture spaces.The concept of textural complete field is defined and the relations with textural definable sets are investigated.If a texture is discrete,then textural definability coincides with definability.Using this fact,we obtain some basic results for definability in rough set algebras.Further,we discuss on definability for fuzzy rough sets considering textural fuzzy direlations.
基金This project was surpported by the Natural Science Foundation of Shandong Province of China (Y2004A94)
文摘Based on S-rough sets(singular rough sets), this paper presents function S-rough sets (function singular rough sets)and its mathematical structures and features. Function S-rough sets has two forms: function one direction S-rough sets (function one direction singular rough sets) and function two direction S-rough sets (function two direction singular rough sets). This paper advances the relationship theorem of function S-rough sets and S-rough sets. Function S-rough sets is the general form of S-rough sets, and S-rough sets is the special ease of function S-rough sets. In this paper, applications of function S-rough sets in rough law mining-discovery of system are given. Function S-rough sets is a new research direction of rough sets and rough system.
基金This project was supported by Natural Science Foundation of Shandong Province of China (Y2004A04), Natural ScienceFoundation of Fujian of China (Z051049) and Education Foundation of Fujian of China (JA04268),.
文摘Function S-rough sets (function singular rough sets) is defined on a -function equivalence class [u]. Function S-rough sets is the extension form of S-rough sets. By using the function S-rough sets, this paper gives rough law generation model of a-function equivalence class, discussion on law mining and law discovery in systems, and application of law mining and law discovery in communication system. Function S-rough sets is a new theory and method in law mining research.
基金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.
基金Supported by the National Natural Science Foundation of China(11171308,61379018,51305400)
文摘In rough set theory, crisp and/or fuzzy binary relations play an important role in both constructive and axiomatic considerations of various generalized rough sets. This paper considers the uniqueness problem of the (fuzzy) relation in some generalized rough set model. Our results show that by using the axiomatic approach, the (fuzzy) relation determined by (fuzzy) approximation operators is unique in some (fuzzy) double-universe model.
基金This research received funding from Taif University,Researchers Supporting and Project Number(TURSP-2020/207),Taif University,Taif,Saudi Arabia.
文摘In this paper,we present a proposed method for generating a soft rough approximation as a modification and generalization of Zhaowen et al.approach.Comparisons were obtained between our approach and the previous study and also.Eventually,an application on Coronavirus(COVID-19)has been presented,illustrated using our proposed concept,and some influencing results for symptoms of Coronavirus patients have been deduced.Moreover,following these concepts,we construct an algorithm and apply it to a decision-making problem to demonstrate the applicability of our proposed approach.Finally,a proposed approach that competes with others has been obtained,as well as realistic results for patients with Coronavirus.Moreover,we used MATLAB programming to obtain the results;these results are consistent with those of theWorld Health Organization and an accurate proposal competing with the method of Zhaowen et al.has been studied.Therefore,it is recommended that our proposed concept be used in future decision making.
基金supported in part by Natural Science Foundation of Education Department of Sichuan Province under Grant No.12ZA178Key Technology Support Program of Sichuan Province under Grant No.2015GZ0102+1 种基金Science and Technology Project of Chongqing Municipal Education Commission under Grant No.KJ1400407Chongqing Science and Technology Commission Project under Grant No.cstc2014jcyj A10051
文摘The preference analysis is a class of important issues in multi-criteria ordinal decision making.The rough set is an effective approach to handle preference analysis.In order to solve the multi-criteria preference analysis problems,this paper improves the preference relation rough set model and expands it to multi-granulation cases.Cost is also an important issue in the field of decision analysis.Taking the cost into consideration,we also expand the model to the cost sensitive multi-granulation preference relation rough set.Some theorems are represented,and the granule structure selection based on approximation quality is investigated.The experimental results show that the multi-granulation preference rough set approach with the consideration of cost has a better performance in granule structure selection than that without cost consideration.
基金Supported by the National Natural Science Foundation of China (No. 69803007)
文摘This paper gives the definition of λ-cut sets and studies the structure of fuzzy rough sets. Based on the concept of rough sets, this paper proposes the representation theorem of fuzzy rough sets.
文摘Dominance-based rough set approach(DRSA) permits representation and analysis of all phenomena involving monotonicity relationship between some measures or perceptions.DRSA has also some merits within granular computing,as it extends the paradigm of granular computing to ordered data,specifies a syntax and modality of information granules which are appropriate for dealing with ordered data,and enables computing with words and reasoning about ordered data.Granular computing with ordered data is a very general paradigm,because other modalities of information constraints,such as veristic,possibilistic and probabilistic modalities,have also to deal with ordered value sets(with qualifiers relative to grades of truth,possibility and probability),which gives DRSA a large area of applications.
基金Supported by the National Natural Science Foundation of China(No.61502436)the Science and Technology Project of Henan Province(No.152102210146)the Doctoral Fund for the Central Universities(No.2014BSJJ084)
文摘In order to increase intrusion detection rate and decrease false positive detection rate,a novel intrusion detection algorithm based on rough set and artificial immune( RSAI-IDA) is proposed.Using artificial immune in intrusion detection,anomaly actions are detected adaptively,and with rough set,effective antibodies can be obtained. A scheme,in which antibodies are partly generated randomly and others are from the artificial immune algorithm,is applied to ensure the antibodies diversity. Finally,simulations of RSAI-IDA and comparisons with other algorithms are given. The experimental results illustrate that the novel algorithm achieves more effective performances on anomaly intrusion detection,where the algorithm's time complexity decreases,the true positive detection rate increases,and the false positive detection rate is decreased.
基金The National Natural Science Foundation of China(No.60474022)
文摘The coveting rough sets theory is a generalization of traditional rough set theory, and can also describe information with incompleteness and fuzziness in information systems. In this paper, we first provide the definitions of several upper and lower covering approximation operators on the covering approximation space. Then, we study the properties of these operators. Finally, we propose the mutual relations between approximation operators and similar relations of the operator ( I ) based on the covering rough sets.
文摘Soft computing is a combination of methods that complement each other when dealing with ambiguous real life decision systems. Rough Set Theory (RST) is a technique used in soft computing that enhances the idea of classical sets to deal with incomplete knowledge and provides a mechanism for concept approximation. It uses reducts to isolate key attributes affecting outcomes in decision systems. The paper summarizes two algorithms for reduct calculation. Moreover, to automate the application of RST, different software packages are available. The paper provides a survey of packages that are most frequently used to perform data analysis based on Rough Sets. For benefit of researchers, a comparison of based on functionalities of those software is also provided.