Multi-hierarchical fuzzy judgment and nested dominance relation of rough set theory-based environmental risk evaluation for tailings reservoirs

Environmental risk assessment of tailings reservoir assessment system is complex and has many index factors.In order to accurately judge surrounding environmental risks of tailings reservoirs and determinate the corresponding prevention and control work,multi-hierarchical fuzzy judgment and nested dominance relation of rough set theory are implemented to evaluate them and find out the rules of this evaluation system with 14 representative cases.The methods of multi-hierarchical fuzzy evaluation can overall consider each influence factor of risk assessment system and their mutual impact,and the index weight based on the analytic hierarchy process is relatively reasonable.Rough set theory based on dominance relation reduces each index attribute from the top down,largely simplifies the complexity of the original evaluation system,and considers the preferential information in each index.Furthermore,grey correlation theory is applied to analysis of importance of each reducted condition attribute.The results demonstrate the feasibility of the proposed safety evaluation system and the application potential.

Extracting Decision Rules for Cooperative Team Air Combat Based on Rough Set Theory

In order to reduce redundant features in air combat information and to meet the requirements of real-time decision in combat, rough set theory is introduced to the tactical decision analysis in cooperative team air combat. An algorithm of attribute reduction for extracting key combat information and generating tactical rules from given air combat databases is presented. Then, considering the practical requirements of team combat, a method for reduction of attribute-values under single decision attribute is extended to the reduction under multi-decision attributes. Finally, the algorithm is verified with an example for tactical choices in team air combat. The results show that, the redundant attributes in air combat information can be reduced, and that the main combat attributes, i.e., the information about radar command and medium-range guided missile, can be obtained with the algorithm mentioned above, moreover, the minimal reduced strategy for tactical decision can be generated without losing the result of key information classification. The decision rules extracted agree with the real situation of team air combat.

Automatic web services classification based on rough set theory

With development of web services technology, the number of existing services in the internet is growing day by day. In order to achieve automatic and accurate services classification which can be beneficial for service related tasks, a rough set theory based method for services classification was proposed. First, the services descriptions were preprocessed and represented as vectors. Elicited by the discernibility matrices based attribute reduction in rough set theory and taking into account the characteristic of decision table of services classification, a method based on continuous discernibility matrices was proposed for dimensionality reduction. And finally, services classification was processed automatically. Through the experiment, the proposed method for services classification achieves approving classification result in all five testing categories. The experiment result shows that the proposed method is accurate and could be used in practical web services classification.

Half-global discretization algorithm based on rough set theory

It is being widely studied how to extract knowledge from a decision table based on rough set theory. The novel problem is how to discretize a decision table having continuous attribute. In order to obtain more reasonable discretization results, a discretization algorithm is proposed, which arranges half-global discretization based on the correlational coefficient of each continuous attribute while considering the uniqueness of rough set theory. When choosing heuristic information, stability is combined with rough entropy. In terms of stability, the possibility of classifying objects belonging to certain sub-interval of a given attribute into neighbor sub-intervals is minimized. By doing this, rational discrete intervals can be determined. Rough entropy is employed to decide the optimal cut-points while guaranteeing the consistency of the decision table after discretization. Thought of this algorithm is elaborated through Iris data and then some experiments by comparing outcomes of four discritized datasets are also given, which are calculated by the proposed algorithm and four other typical algorithras for discritization respectively. After that, classification rules are deduced and summarized through rough set based classifiers. Results show that the proposed discretization algorithm is able to generate optimal classification accuracy while minimizing the number of discrete intervals. It displays superiority especially when dealing with a decision table having a large attribute number.

Research on knowledge acquisition method about the IF/THEN rules based on rough set theory

The basic principles of IF/THEN rules in rough set theory are analyzed first, and then the automatic process of knowledge acquisition is given. The numerical data is qualitatively processed by the classification of membership functions and membership degrees to get the normative decision table. The regular method of relations and the reduction algorithm of attributes are studied. The reduced relations are presented by the multi-representvalue method and its algorithm is offered. The whole knowledge acquisition process has high degree of automation and the extracted knowledge is true and reliable.

Autonomous Clustering Using Rough Set Theory

This paper proposes a clustering technique that minimizes the need for subjective human intervention and is based on elements of rough set theory （RST）. The proposed algorithm is unified in its approach to clustering and makes use of both local and global data properties to obtain clustering solutions. It handles single-type and mixed attribute data sets with ease. The results from three data sets of single and mixed attribute types are used to illustrate the technique and establish its efficiency.

Mathematical Morphology View of Topological Rough Sets and Its Applications

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.

New Image Recognition Method Based on Rough-Sets and Fuzzy Theory

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.

Condition Monitoring and Fault Diagnosis Based on Rough Set Theory

In order to raise the efficiency,automatization and intelligentization of condition monitoring and fault diagnosis for complex equipment systems,rough set theory is used to the field. A feature reduction algorithm based on rough set theory is adopted to extract condition information in monitoring and diagnosis for an engine,so that the technology condition monitoring parameters are optimized. The decision tables for each fault source are built and the diagnosis rules rooting in rough set reduction is applied to carry through intelligent fault diagnosis. The cases studied show that rough set method in condition monitoring and fault diagnosis can lighten the work burden in feature selection and afford advantages for autonomic learning and decision during diagnosis.

AN INTRUSION DETECTION SYSTEM BASED ON EVIDENCE THEORY AND ROUGH SET THEORY

In this paper,we propose a novel Intrusion Detection System (IDS) architecture utilizing both the evidence theory and Rough Set Theory (RST). Evidence theory is an effective tool in dealing with uncertainty question. It relies on the expert knowledge to provide evidences,needing the evidences to be independent,and this make it difficult in application. To solve this problem,a hybrid system of rough sets and evidence theory is proposed. Firstly,simplification are made based on Variable Precision Rough Set (VPRS) conditional entropy. Thus,the Basic Belief Assignment (BBA) for all evidences can be calculated. Secondly,Dempster’s rule of combination is used,and a decision-making is given. In the proposed approach,the difficulties in acquiring the BBAs are solved,the correlativity among the evidences is reduced and the subjectivity of evidences is weakened. An illustrative example in an intrusion detection shows that the two theories combination is feasible and effective.

Seismic vulnerability assessment of urban buildings using the rough set theory and weighted linear combination

Seismic vulnerability assessment of urban buildings is among the most crucial procedures to post-disaster response and recovery of infrastructure systems.The present study proceeds to estimate the seismic vulnerability of urban buildings and proposes a new framework training on the two objectives.First,a comprehensive interpretation of the effective parameters of this phenomenon including physical and human factors is done.Second,the Rough Set theory is used to reduce the integration uncertainties,as there are numerous quantitative and qualitative data.Both objectives were conducted on seven distinct earthquake scenarios with different intensities based on distance from the fault line and the epicenter.The proposed method was implemented by measuring seismic vulnerability for the seven specified seismic scenarios.The final results indicated that among the entire studied buildings,71.5%were highly vulnerable as concerning the highest earthquake scenario(intensity=7 MM and acceleration calculated based on the epicenter),while in the lowest earthquake scenario(intensity=5 MM),the percentage of vulnerable buildings decreased to approximately 57%.Also,the findings proved that the distance from the fault line rather than the earthquake center(epicenter)has a significant effect on the seismic vulnerability of urban buildings.The model was evaluated by comparing the results with the weighted linear combination(WLC)method.The accuracy of the proposed model was substantiated according to evaluation reports.Vulnerability assessment based on the distance from the epicenter and its comparison with the distance from the fault shows significant reliable results.

Evaluation and Analysis of Battery Technologies Applied to Grid-Level Energy Storage Systems Based on Rough Set Theory

Interest in the development of grid-level energy storage systems has increased over the years.As one of the most popular energy storage technologies currently available,batteries offer a number of high-value opportunities due to their rapid responses,flexible installation,and excellent performances.However,because of the complexity,multifunctionality,and wide deployment of power grids,trade-offs in battery performance exist,especially when considering economics,environmental effects,and safety.Therefore,establishing a comprehensive assessment of battery technologies is an urgent undertaking.In this work,we present an analysis of rough sets to evaluate the integration of battery systems(e.g.,lead-acid batteries,lithium-ion batteries,nickel/metal-hydrogen batteries,zinc-air batteries,and Na-S batteries)into a power grid.Specifically,technological properties,economic significance,environmental effects,and safety of these battery systems are evaluated on the basis of rough set theory.In addition,some perspectives are provided to promote the development of battery technologies for grid-level energy storage.

Generalization Rough Set Theory

In order to avoid the discretization in the classical rough set theory, a generlization rough set theory is proposed. At first, the degree of general importance of an attribute and attribute subsets are presented. Then, depending on the degree of general importance of attribute, the space distance can be measured with weighted method. At last, a generalization rough set theory based on the general near neighborhood relation is proposed. The proposed theory partitions the universe into the tolerant modules, and forms lower approximation and upper approximation of the set under general near neighborhood relationship, which avoids the discretization in Pawlak's rough set theory.

A Rough Set and GIS Based Approach for Selecting Suitable Shelters during an Evacuation Process

Humanity suffers an ever-present threat of crises. In the event of a crisis, the population in affected areas will be in danger and will need to be evacuated to a safer in order to protect their lives. One of the difficulties in emergency management is quickly and accurately selecting suitably safe areas of refuge. This paper aims to explain an evacuation shelter selection process that uses rough set theory and a geographical information system (GIS). The proposed approach uses rough set theory concepts to classify shelters and selects suitable shelters on the basis of three factors: distance, capacity, and the availability of life requirements. The preparation of data and reporting of results are performed via the GIS environment. The proposed approach was implemented using Masoura,Egypt, as a case study and the re- sults of this implementation are presented.

A game-theoretic perspective on rough set analysis

Determining the correct threshold values for the probabilistic rough set approaches has been a heated issue among the community.Existing techniques offer no way in guaranteeing that the calculated values optimize the classification ability of the decision rules derived from this configuration.This article will formulate a game theoretic approach to calculating these thresholds to ensure correct approximation region size.Using payoff tables created from approximation measures and modified conditional risk strategies,we provide the user with tolerance levels for their loss functions.Using the tolerance values,new thresholds are calculated to provide correct classification regions.This will aid in determining a set of optimal region threshold values for decision making.

Rough Set Theory Based Approach for Fault Diagnosis Rule Extraction of Distribution System

As the first step of service restoration of distribution system,rapid fault diagnosis is a significant task for reducing power outage time,decreasing outage loss,and subsequently improving service reliability and safety.This paper analyzes a fault diagnosis approach by using rough set theory in which how to reduce decision table of data set is a main calculation intensive task.Aiming at this reduction problem,a heuristic reduction algorithm based on attribution length and frequency is proposed.At the same time,the corresponding value reduction method is proposed in order to fulfill the reduction and diagnosis rules extraction.Meanwhile,a Euclid matching method is introduced to solve confliction problems among the extracted rules when some information is lacking.Principal of the whole algorithm is clear and diagnostic rules distilled from the reduction are concise.Moreover,it needs less calculation towards specific discernibility matrix,and thus avoids the corresponding NP hard problem.The whole process is realized by MATLAB programming.A simulation example shows that the method has a fast calculation speed,and the extracted rules can reflect the characteristic of fault with a concise form.The rule database,formed by different reduction of decision table,can diagnose single fault and multi-faults efficiently,and give satisfied results even when the existed information is incomplete.The proposed method has good error-tolerate capability and the potential for on-line fault diagnosis.

Research on the Information Fusion Method of Oil Diagnosis and Vibration Diagnosis Based on the Rough Sets Theory

The improved method has been presented for knowledge reduction in rough sets （R-S） theory, when R-S is used to model the information expression of oil and vibration diagnosis. Therefore, the typical fault simulation tests of rolling bearings have been made, and the application method of R-S has been also analysed in this paper. The diagnosis model of holding rack fault in rolling bearing was presented based on the improved reduction method. It is suited to information fusion to combine information when oil analysis and vibration analysis are combined for fault diagnosis.

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.

Two Hybrid Methods Based on Rough Set Theory for Network Intrusion Detection

In this paper,we propose two intrusion detection methods which combine rough set theory and Fuzzy C-Means for network intrusion detection.The first step consists of feature selection which is based on rough set theory.The next phase is clustering by using Fuzzy C-Means.Rough set theory is an efficient tool for further reducing redundancy.Fuzzy C-Means allows the objects to belong to several clusters simultaneously,with different degrees of membership.To evaluate the performance of the introduced approaches,we apply them to the international Knowledge Discovery and Data mining intrusion detection dataset.In the experimentations,we compare the performance of two rough set theory based hybrid methods for network intrusion detection.Experimental results illustrate that our algorithms are accurate models for handling complex attack patterns in large network.And these two methods can increase the efficiency and reduce the dataset by looking for overlapping categories.

Numerical Characterizations of Covering Rough Sets Based on Evidence Theory

Covering rough sets are improvements of traditional rough sets by considering cover of universe instead of partition.In this paper,we develop several measures based on evidence theory to characterize covering rough sets.First,we present belief and plausibility functions in covering information systems and study their properties.With these measures we characterize lower and upper approximation operators and attribute reductions in covering information systems and decision systems respectively.With these discussions we propose a basic framework of numerical characterizations of covering rough sets.