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.

Analysis on decision-making model of plan evaluation based on grey relation projection and combination weight algorithm

In military service joint operations, when there are more operational forces, more multifarious materials are consumed, the support is more complex and fuzzy, the deployment of personnel is more rapid, and the support provided by wartime military material support powers can be more effective. When the principles,requirements, influencing factors and goals of military material support forces are deployed in wartime, an evaluation indicator system is established. Thus, a new combined empowerment method based on an analytic hierarchy process（AHP） is developed to calculate the subjective weights, and the rough entropy method is used to calculate the objective weights. Combination weights can be obtained by calculating the weight preference coefficient error, which is determined by combining the cooperative game method and the minimum deviation into objectives. This approach can determine the grey relation projection coefficient and synthesize the measure scheme superiority to finally optimize the deployment plan using the grey relation projection decision-making method. The results show that the method is feasible and effective;it can provide a more scientific and practical decision-making basis for the military material support power deployment in wartime.

Information Measures of Roughness of Knowledge and Rough Sets for Incomplete Information Systems

In this paper we address information measures of roughness of knowledge and rough sets for incomplete information systems. The definition of rough entropy of knowledge and its important properties are given. In particular, the relationship between rough entropy of knowledge and the Hartley measure of uncertainty is established. We show that rough entropy of know1edge decreases monotonously as granularity of information become smaller. This gives an information interpretation for roughness of knowledge. Based on rough entropy of knowledge and roughness of rough set. a definition of rough entropy of rough set is proposed, and we show that rough entropy of rough set decreases monotonousIy as granularity of information become smaller. This gives more accurate measure for roughness of rough set.

Attribute reduction in interval-valued information systems based on information entropies

Interval-valued data appear as a way to represent the uncertainty affecting the observed values. Dealing with interval-valued information systems is helpful to generalize the applications of rough set theory. Attribute reduction is a key issue in analysis of interval-valued data. Existing attribute reduction methods for single-valued data are unsuitable for interval-valued data. So far, there have been few studies on attribute reduction methods for interval-valued data. In this paper, we propose a framework for attribute reduction in interval-valued data from the viewpoint of information theory. Some information theory concepts, including entropy, conditional entropy, and joint entropy, are given in interval-valued information systems. Based on these concepts, we provide an information theory view for attribute reduction in interval-valued information systems. Consequently, attribute reduction algorithms are proposed. Experiments show that the proposed framework is effective for attribute reduction in interval-valued information systems.