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 me...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.展开更多
The Rough Sets Theory is used in data mining with emphasis on the treatment of uncertain or vague information. In the case of classification, this theory implicitly calculates reducts of the full set of attributes, el...The Rough Sets Theory is used in data mining with emphasis on the treatment of uncertain or vague information. In the case of classification, this theory implicitly calculates reducts of the full set of attributes, eliminating those that are redundant or meaningless. Such reducts may even serve as input to other classifiers other than Rough Sets. The typical high dimensionality of current databases precludes the use of greedy methods to find optimal or suboptimal reducts in the search space and requires the use of stochastic methods. In this context, the calculation of reducts is typically performed by a genetic algorithm, but other metaheuristics have been proposed with better performance. This work proposes the innovative use of two known metaheuristics for this calculation, the Variable Neighborhood Search, the Variable Neighborhood Descent, besides a third heuristic called Decrescent Cardinality Search. The last one is a new heuristic specifically proposed for reduct calculation. Considering some databases commonly found in the literature of the area, the reducts that have been obtained present lower cardinality, i.e., a lower number of attributes.展开更多
The method and steps of acquiring evaluation rules based on the knowledge reduction theory of rough sets is discussed, and the distilling process and approach for the evaluation rules of mechanical product structure d...The method and steps of acquiring evaluation rules based on the knowledge reduction theory of rough sets is discussed, and the distilling process and approach for the evaluation rules of mechanical product structure design is described by using hydraulic torque converter as an example. Practice shows that this approach to a certain extent simplifies the knowledge base structure and reasoning process in comparison with the case-based reasoning method in the aspect of setting up evaluation rule base and carrying out reasoning to realize the mechanical product evaluation.展开更多
During the procedure of fault diagnosis for large-scale complicated equipment, the existence of redundant and fuzzy information results in the difficulty of knowledge access. Aiming at this characteristic, this paper ...During the procedure of fault diagnosis for large-scale complicated equipment, the existence of redundant and fuzzy information results in the difficulty of knowledge access. Aiming at this characteristic, this paper brought forth the Rough Set （RS） theory to the field of fault diagnosis. By means of the RS theory which is predominant in the way of dealing with fuzzy and uncertain information, knowledge access about fault diagnosis was realized. The foundation ideology of the RS theory was exhausted in detail, an amended RS algorithm was proposed, and the process model of knowledge access based on the amended RS algorithm was researched. Finally, we verified the correctness and the practicability of this method during the procedure of knowledge access.展开更多
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 co...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.展开更多
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 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 clusterin...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.展开更多
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 safe...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.展开更多
To improve the efficiency of the attribute reduction, we present an attribute reduction algorithm based on background knowledge and information entropy by making use of background knowledge from research fields. Under...To improve the efficiency of the attribute reduction, we present an attribute reduction algorithm based on background knowledge and information entropy by making use of background knowledge from research fields. Under the condition of known background knowledge, the algorithm can not only greatly improve the efficiency of attribute reduction, but also avoid the defection of information entropy partial to attribute with much value. The experimental result verifies that the algorithm is effective. In the end, the algorithm produces better results when applied in the classification of the star spectra data.展开更多
Objective:This study aims to achieve an empirical evaluation on the functional performances of urban community health care services in fi ve administrative districts of Nanchang city in China.Methods:In order to incre...Objective:This study aims to achieve an empirical evaluation on the functional performances of urban community health care services in fi ve administrative districts of Nanchang city in China.Methods:In order to increase effectiveness,data collected from fi ve administrative districts of Nanchang city were processed to exclude redundant information.Rough set reduction theory was brought in to evaluate the performances of community health care services in these districts through calculating key indices’weighed importance.Results:Comprehensive evaluation showed the score rankings from high to low as Qing-yunpu district,Xihu district,Qingshanhu district,Donghu district,and Wanli district.Conclusion:The objective performance evaluation had actually reflected the general situation(including social-economic status)of community health care services in these administrative districts of Nanchang.Attention and practical works of community health service management were needed to build a more harmonious and uniform community health care service system for residents in these districts of Nanchang.展开更多
Rough set philosophy hinges on the granularity of data, which is used to build all its basic concepts, like approximations, dependencies, reduction etc. Genetic Algorithms provides a general frame to optimize problem ...Rough set philosophy hinges on the granularity of data, which is used to build all its basic concepts, like approximations, dependencies, reduction etc. Genetic Algorithms provides a general frame to optimize problem solution of complex system without depending on the domain of problem.It is robust to many kinds of problems.The paper combines Genetic Algorithms and rough sets theory to compute granular of knowledge through an example of information table. The combination enable us to compute granular of knowledge effectively.It is also useful for computer auto-computing and information processing.展开更多
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 se...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.展开更多
The variation design of complex products has such features as multivariate association, weak theory coupling and implicit knowledge iteration. However, present CAD soft wares are still restricted to making decisions o...The variation design of complex products has such features as multivariate association, weak theory coupling and implicit knowledge iteration. However, present CAD soft wares are still restricted to making decisions only according to current design status in dynamic navigation which leads to the huge drain of the knowledge hidden in design process. In this paper, a method of acquisition and active navigation of knowledge particles throughout product variation design process is put forward. The multi-objective decision information model of the variation design is established via the definition of condition attribute set and decision attribute set in finite universe. The addition and retrieval of the variation semantics is achieved through bidirectional association between the transplantable structures and variation design semantics. The mapping relationships between the topology lapping geometry elements set and constraint relations set family is built by means of geometry feature analysis. The acquisition of knowledge particles is implemented by attribute reduction based on rough set theory to make multi-objective decision of variation design. The topology lapping status of transplantable substructures is known from DOF reduction. The active navigation of knowledge particles is realized through embedded event-condition-action（ECA） rules. The independent prototype system taking Alan, Charles, Ian＇s system（ACIS） as kernel has been developed to verify the proposed method by applying variation design of complex mechanical products. The test results demonstrate that the navigation decision basis can be successfully extended from static isolated design status to dynamic continuous design process so that it more flexibly adapts to the different designers and various variation design steps. It is of profound significance for enhancing system intelligence as well as improving design quality and efficiency.展开更多
Rough set theory is relativly new to area of soft computing to handle the uncertain big data efficiently. It also provides a powerful way to calculate the importance degree of vague and uncertain big data to help in d...Rough set theory is relativly new to area of soft computing to handle the uncertain big data efficiently. It also provides a powerful way to calculate the importance degree of vague and uncertain big data to help in decision making. Risk assessment is very important for safe and reliable investment. Risk management involves assessing the risk sources and designing strategies and procedures to mitigate those risks to an acceptable level. In this paper, we emphasize on classification of different types of risk factors and find a simple and effective way to calculate the risk exposure.. The study uses rough set method to classify and judge the safety attributes related to investment policy. The method which based on intelligent knowledge accusation provides an innovative way for risk analysis. From this approach, we are able to calculate the significance of each factor and relative risk exposure based on the original data without assigning the weight subjectively.展开更多
基金the National Natural Science Foundation of China (50275113).
文摘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.
文摘The Rough Sets Theory is used in data mining with emphasis on the treatment of uncertain or vague information. In the case of classification, this theory implicitly calculates reducts of the full set of attributes, eliminating those that are redundant or meaningless. Such reducts may even serve as input to other classifiers other than Rough Sets. The typical high dimensionality of current databases precludes the use of greedy methods to find optimal or suboptimal reducts in the search space and requires the use of stochastic methods. In this context, the calculation of reducts is typically performed by a genetic algorithm, but other metaheuristics have been proposed with better performance. This work proposes the innovative use of two known metaheuristics for this calculation, the Variable Neighborhood Search, the Variable Neighborhood Descent, besides a third heuristic called Decrescent Cardinality Search. The last one is a new heuristic specifically proposed for reduct calculation. Considering some databases commonly found in the literature of the area, the reducts that have been obtained present lower cardinality, i.e., a lower number of attributes.
文摘The method and steps of acquiring evaluation rules based on the knowledge reduction theory of rough sets is discussed, and the distilling process and approach for the evaluation rules of mechanical product structure design is described by using hydraulic torque converter as an example. Practice shows that this approach to a certain extent simplifies the knowledge base structure and reasoning process in comparison with the case-based reasoning method in the aspect of setting up evaluation rule base and carrying out reasoning to realize the mechanical product evaluation.
基金supported by the Shanghai Science and Technology Development Foundation(No.005111070)
文摘During the procedure of fault diagnosis for large-scale complicated equipment, the existence of redundant and fuzzy information results in the difficulty of knowledge access. Aiming at this characteristic, this paper brought forth the Rough Set （RS） theory to the field of fault diagnosis. By means of the RS theory which is predominant in the way of dealing with fuzzy and uncertain information, knowledge access about fault diagnosis was realized. The foundation ideology of the RS theory was exhausted in detail, an amended RS algorithm was proposed, and the process model of knowledge access based on the amended RS algorithm was researched. Finally, we verified the correctness and the practicability of this method during the procedure of knowledge access.
基金Preliminary research foundation of national defense
文摘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.
基金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.
文摘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.
基金Project Supported by National Natural Science Foundation of China （50607023）, Natural Science Femdation of CQ CSTC （2006BB2189）
文摘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.
基金Supported by the National Natural Science Foundation of China（No. 60573075）, the National High Technology Research and Development Program of China （No. 2003AA133060） and the Natural Science Foundation of Shanxi Province （No. 200601104）.
文摘To improve the efficiency of the attribute reduction, we present an attribute reduction algorithm based on background knowledge and information entropy by making use of background knowledge from research fields. Under the condition of known background knowledge, the algorithm can not only greatly improve the efficiency of attribute reduction, but also avoid the defection of information entropy partial to attribute with much value. The experimental result verifies that the algorithm is effective. In the end, the algorithm produces better results when applied in the classification of the star spectra data.
基金the National Natural Science Foundation of China in 2011[71163016]the Technology Project of Provincial Education Department of Jiangxi in 2013[GJJ13559].
文摘Objective:This study aims to achieve an empirical evaluation on the functional performances of urban community health care services in fi ve administrative districts of Nanchang city in China.Methods:In order to increase effectiveness,data collected from fi ve administrative districts of Nanchang city were processed to exclude redundant information.Rough set reduction theory was brought in to evaluate the performances of community health care services in these districts through calculating key indices’weighed importance.Results:Comprehensive evaluation showed the score rankings from high to low as Qing-yunpu district,Xihu district,Qingshanhu district,Donghu district,and Wanli district.Conclusion:The objective performance evaluation had actually reflected the general situation(including social-economic status)of community health care services in these administrative districts of Nanchang.Attention and practical works of community health service management were needed to build a more harmonious and uniform community health care service system for residents in these districts of Nanchang.
文摘Rough set philosophy hinges on the granularity of data, which is used to build all its basic concepts, like approximations, dependencies, reduction etc. Genetic Algorithms provides a general frame to optimize problem solution of complex system without depending on the domain of problem.It is robust to many kinds of problems.The paper combines Genetic Algorithms and rough sets theory to compute granular of knowledge through an example of information table. The combination enable us to compute granular of knowledge effectively.It is also useful for computer auto-computing and information processing.
基金supported by a grant of NSFC(70871036)a grant of National Basic Research Program of China(2009CB219801-3)
文摘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.
基金supported by National Hi-tech Research and Development Program of China (863 Program, Grant No. 2006AA04Z114) National Natural Science Foundation of China (Grant No. 50775201)
文摘The variation design of complex products has such features as multivariate association, weak theory coupling and implicit knowledge iteration. However, present CAD soft wares are still restricted to making decisions only according to current design status in dynamic navigation which leads to the huge drain of the knowledge hidden in design process. In this paper, a method of acquisition and active navigation of knowledge particles throughout product variation design process is put forward. The multi-objective decision information model of the variation design is established via the definition of condition attribute set and decision attribute set in finite universe. The addition and retrieval of the variation semantics is achieved through bidirectional association between the transplantable structures and variation design semantics. The mapping relationships between the topology lapping geometry elements set and constraint relations set family is built by means of geometry feature analysis. The acquisition of knowledge particles is implemented by attribute reduction based on rough set theory to make multi-objective decision of variation design. The topology lapping status of transplantable substructures is known from DOF reduction. The active navigation of knowledge particles is realized through embedded event-condition-action（ECA） rules. The independent prototype system taking Alan, Charles, Ian＇s system（ACIS） as kernel has been developed to verify the proposed method by applying variation design of complex mechanical products. The test results demonstrate that the navigation decision basis can be successfully extended from static isolated design status to dynamic continuous design process so that it more flexibly adapts to the different designers and various variation design steps. It is of profound significance for enhancing system intelligence as well as improving design quality and efficiency.
文摘Rough set theory is relativly new to area of soft computing to handle the uncertain big data efficiently. It also provides a powerful way to calculate the importance degree of vague and uncertain big data to help in decision making. Risk assessment is very important for safe and reliable investment. Risk management involves assessing the risk sources and designing strategies and procedures to mitigate those risks to an acceptable level. In this paper, we emphasize on classification of different types of risk factors and find a simple and effective way to calculate the risk exposure.. The study uses rough set method to classify and judge the safety attributes related to investment policy. The method which based on intelligent knowledge accusation provides an innovative way for risk analysis. From this approach, we are able to calculate the significance of each factor and relative risk exposure based on the original data without assigning the weight subjectively.
