The information content of rules is categorized into inner mutual information content and outer impartation information content. Actually, the conventional objective interestingness measures based on information theor...The information content of rules is categorized into inner mutual information content and outer impartation information content. Actually, the conventional objective interestingness measures based on information theory are all inner mutual information, which represent the confidence of rules and the mutual information between the antecedent and consequent. Moreover, almost all of these measures lose sight of the outer impartation information, which is conveyed to the user and help the user to make decisions. We put forward the viewpoint that the outer impartation information content of rules and rule sets can be represented by the relations from input universe to output universe. By binary relations, the interaction of rules in a rule set can be easily represented by operators： union and intersection. Based on the entropy of relations, the outer impartation information content of rules and rule sets are well measured. Then, the conditional information content of rules and rule sets, the independence of rules and rule sets and the inconsistent knowledge of rule sets are defined and measured. The properties of these new measures are discussed and some interesting results are proven, such as the information content of a rule set may be bigger than the sum of the information content of rules in the rule set, and the conditional information content of rules may be negative. At last, the applications of these new measures are discussed. The new method for the appraisement of rule mining algorithm, and two rule pruning algorithms, λ-choice and RPClC, are put forward. These new methods and algorithms have predominance in satisfying the need of more efficient decision information.展开更多
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.展开更多
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.展开更多
Spatial relations,reflecting the complex association between geographical phenomena and environments,are very important in the solution of geographical issues. Different spatial relations can be expressed by indicator...Spatial relations,reflecting the complex association between geographical phenomena and environments,are very important in the solution of geographical issues. Different spatial relations can be expressed by indicators which are useful for the analysis of geographical issues. Urbanization,an important geographical issue,is considered in this paper. The spatial relationship indicators concerning urbanization are expressed with a decision table. Thereafter,the spatial relationship indicator rules are extracted based on the application of rough set theory. The extraction process of spatial relationship indicator rules is illustrated with data from the urban and rural areas of Shenzhen and Hong Kong,located in the Pearl River Delta. Land use vector data of 1995 and 2000 are used. The extracted spatial relationship indicator rules of 1995 are used to identify the urban and rural areas in Zhongshan,Zhuhai and Macao. The identification accuracy is approximately 96.3%. Similar procedures are used to extract the spatial relationship indicator rules of 2000 for the urban and rural areas in Zhongshan,Zhuhai and Macao. An identification accuracy of about 83.6% is obtained.展开更多
At present, most of the association rules algorithms are based on the Boolean attribute and single-level association rules mining. But data of the real world has various types, the multi-level and quantitative attribu...At present, most of the association rules algorithms are based on the Boolean attribute and single-level association rules mining. But data of the real world has various types, the multi-level and quantitative attributes are got more and more attention. And the most important step is to mine frequent sets. In this paper, we propose an algorithm that is called fuzzy multiple-level association （FMA） rules to mine frequent sets. It is based on the improved Eclat algorithm that is different to many researchers’ proposed algorithms thatused the Apriori algorithm. We analyze quantitative data’s frequent sets by using the fuzzy theory, dividing the hierarchy of concept and softening the boundary of attributes’ values and frequency. In this paper, we use the vertical-style data and the improved Eclat algorithm to describe the proposed method, we use this algorithm to analyze the data of Beijing logistics route. Experiments show that the algorithm has a good performance, it has better effectiveness and high efficiency.展开更多
There are rules refering to infrequent instances after the procession of attribute reductionand value reduction with traditional methods.A rough set RS based k-exception approach (RSKEA) torule reduction is presented....There are rules refering to infrequent instances after the procession of attribute reductionand value reduction with traditional methods.A rough set RS based k-exception approach (RSKEA) torule reduction is presented.Its main idea lies in a two-phase RS based rule reduction.An ordinarydecision table is attained through general method of RS knowledge reduction in the first phase.Then a k-exception candidate set is nominated according to the decision table.RS rule reduction is employed forthe reformed source data set,which remove all the instances included in the k-exception set.We apply theapproach to the automobile database.Results show that it can reduce the number and complexity of ruleswith adjustable conflict rate,which contributes to approximate rule reduction.展开更多
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 National Natural Science Foundation of China (Grant Nos. 60774049 and 40672195)Natural Science Foundation of Beijing (Grant No. 4062020)+1 种基金National 973 Fundamental Research Project of China (Grant No. 2002CB312200)the Youth Foundation of Beijing Normal University
文摘The information content of rules is categorized into inner mutual information content and outer impartation information content. Actually, the conventional objective interestingness measures based on information theory are all inner mutual information, which represent the confidence of rules and the mutual information between the antecedent and consequent. Moreover, almost all of these measures lose sight of the outer impartation information, which is conveyed to the user and help the user to make decisions. We put forward the viewpoint that the outer impartation information content of rules and rule sets can be represented by the relations from input universe to output universe. By binary relations, the interaction of rules in a rule set can be easily represented by operators： union and intersection. Based on the entropy of relations, the outer impartation information content of rules and rule sets are well measured. Then, the conditional information content of rules and rule sets, the independence of rules and rule sets and the inconsistent knowledge of rule sets are defined and measured. The properties of these new measures are discussed and some interesting results are proven, such as the information content of a rule set may be bigger than the sum of the information content of rules in the rule set, and the conditional information content of rules may be negative. At last, the applications of these new measures are discussed. The new method for the appraisement of rule mining algorithm, and two rule pruning algorithms, λ-choice and RPClC, are put forward. These new methods and algorithms have predominance in satisfying the need of more efficient decision information.
基金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.
基金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.
基金Foundation： National Natural Science Foundation of China, No.40971222 State Key Laboratory of Independent Innova- tion Team Project, No.O88RA203SA+2 种基金 National Natural Science Foundation of China, No.60970014, 60875040 Foundation of Doctoral Program Research of the Ministry of Education of China, No.200801080006 Natural Science Foundation of Shanxi Province, No.2010011021-1
文摘Spatial relations,reflecting the complex association between geographical phenomena and environments,are very important in the solution of geographical issues. Different spatial relations can be expressed by indicators which are useful for the analysis of geographical issues. Urbanization,an important geographical issue,is considered in this paper. The spatial relationship indicators concerning urbanization are expressed with a decision table. Thereafter,the spatial relationship indicator rules are extracted based on the application of rough set theory. The extraction process of spatial relationship indicator rules is illustrated with data from the urban and rural areas of Shenzhen and Hong Kong,located in the Pearl River Delta. Land use vector data of 1995 and 2000 are used. The extracted spatial relationship indicator rules of 1995 are used to identify the urban and rural areas in Zhongshan,Zhuhai and Macao. The identification accuracy is approximately 96.3%. Similar procedures are used to extract the spatial relationship indicator rules of 2000 for the urban and rural areas in Zhongshan,Zhuhai and Macao. An identification accuracy of about 83.6% is obtained.
基金supported by the Fundamental Research Funds for the Central Universities under Grants No.ZYGX2014J051 and No.ZYGX2014J066Science and Technology Projects in Sichuan Province under Grants No.2015JY0178,No.2016FZ0002,No.2014GZ0109,No.2015KZ002 and No.2015JY0030China Postdoctoral Science Foundation under Grant No.2015M572464
文摘At present, most of the association rules algorithms are based on the Boolean attribute and single-level association rules mining. But data of the real world has various types, the multi-level and quantitative attributes are got more and more attention. And the most important step is to mine frequent sets. In this paper, we propose an algorithm that is called fuzzy multiple-level association （FMA） rules to mine frequent sets. It is based on the improved Eclat algorithm that is different to many researchers’ proposed algorithms thatused the Apriori algorithm. We analyze quantitative data’s frequent sets by using the fuzzy theory, dividing the hierarchy of concept and softening the boundary of attributes’ values and frequency. In this paper, we use the vertical-style data and the improved Eclat algorithm to describe the proposed method, we use this algorithm to analyze the data of Beijing logistics route. Experiments show that the algorithm has a good performance, it has better effectiveness and high efficiency.
文摘There are rules refering to infrequent instances after the procession of attribute reductionand value reduction with traditional methods.A rough set RS based k-exception approach (RSKEA) torule reduction is presented.Its main idea lies in a two-phase RS based rule reduction.An ordinarydecision table is attained through general method of RS knowledge reduction in the first phase.Then a k-exception candidate set is nominated according to the decision table.RS rule reduction is employed forthe reformed source data set,which remove all the instances included in the k-exception set.We apply theapproach to the automobile database.Results show that it can reduce the number and complexity of ruleswith adjustable conflict rate,which contributes to approximate rule reduction.
基金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.
