不完备直觉模糊信息系统的属性约简

利用优势关系,可对完备直觉模糊信息系统与决策信息表进行属性约简.将优势关系改进为广义优势关系,在此基础上构建了不完备直觉模糊信息系统与决策信息表的辨识矩阵,得到了求解属性约简与相对约简的具体方法.     

一种新型粗糙集的指标筛选模型及实证分析

针对现有指标筛选方法不能将指标客观数据和指标实际含义同时处理的弊端,研究提出了一种新型粗糙集指标筛选方法,并对绿色经济下的社会可持续发展评价指标体系构建进行了实证分析.方法同时将粗糙集决策表的相对约简理论与信息表的属性约简理论相结合,既保证了筛选的客观性又兼顾了指标的实际含义,其主要做法一是通过布尔推理算法,保证了连续型指标离散化过程中候选断点的最优组合,为粗糙集约简提供了高准确率的信息表数据;二是考虑了指标的实际含义,通过对有因果关系的指标构成的决策表进行相对约简,删除了指标信息间的冗余指标;三是通过对无实际联系的指标构成的信息表进行属性约简,删除了研究指标客观数据中的冗余指标.     

基于相似关系的条件熵属性约简及其算法

不完备决策系统关联于数据分析,其属性约简具有应用意义,并已具有基于容差关系的条件熵研究.基于相似关系,研究不完备决策系统的条件熵属性约简及其算法.利用相似关系确立条件熵,提出等价于广义决策函数保持约简的条件熵保持约简,建立具有误差容忍机制的条件熵容忍约简;针对两种新建属性约简,揭示它们间的扩张关系与强弱关系,构建相应的全局算法与局部算法;最后,提供决策表实例分析,说明基于相似关系的条件熵属性约简及其算法的有效性.相关研究完善了不完备决策系统属性约简,具有理论价值与应用意义.     

决策信息系统的变换及其变换规则形式化

传统的粗糙集分类、约简、规则挖掘方法处理的对象是某个时间点上的静态信息系统,因而获得的知识也是静态的.实际上信息系统通常表现为易变性和过程性,为了挖掘决策信息系统动态变换的趋势和规则,本文扩展了粗糙集中传统的分类、约简、规则挖掘的应用模式,提出决策信息系统基于时间序列单步和过程变换模型, 建立面向决策信息系统变化趋势的类划分机制和相应的语义,对条件属性变迁与决策属性变迁的相关性进行研究,并给出变换规则的形式化表示.     

基于信息熵的属性约简在多属性决策中的应用

属性约简是在信息系统中的一个重要操作.分类是属性约简的基础,且直接在大数据集上进行属性约简往往存在效率低下的问题.以分类为基础提出了一种基于信息熵的信息系统属性约简算法.算法通过信息熵的计算,在属性约简的同时对原信息系统逐层分解,从而实现了属性的约简并缩小了搜索空间.提出了依据信息熵来确定属性的不必要性及简约属性集,应用在多属性决策中所带来的优势.     

基于粒关系包含度矩阵的属性约简算法研究

针对信息系统属性约简问题,通过借助粒关系包含度矩阵这一中间工具,给出一种决策表属性启发式约简算法.首先,计算决策表中条件属性与决策属性之间的粒关系包含度矩阵;然后,将粒关系包含度矩阵中隐含的信息L_B作为启发式算子对决策表进行属性约简;最后,删除冗余属性并设置终止条件,实现决策表的属性约简.通过实例验证了该算法的有效性.     

基于粗糙集的经济预警规则发现

应用粗糙集的理论和方法对经济预警有关数据进行分析,挖掘其中隐含的有用信息,提取规则并对规则进行约简,从而求取表达经济预警信息的最小决策规则,为经济预警有用信息的获取提供一种有效的方法.     

决策系统属性约简的双向算法

提出了决策系统中对象约简的新思想,即在搜索属性约简的同时不断地缩小论域;并设计了一个采用增量式方法计算决策系统的双向约简算法;分析了算法的时间复杂度,最后用一个实例说明了算法的可行性与有效性.     

基于可辨识矩阵的模糊目标系统决策约简算法

在模糊目标信息系统决策约简和可辨识矩阵定义的基础上,讨论了可辨识矩阵的性质以及与决策约简集之间的关系.同时定义一种新的属性重要度,并将此作为启发式信息,设计了一种模糊目标决策信息系统最小决策约简算法,通过实例验证该算法简捷、有效.     

基于粗糙集理论的数据挖掘法在房地产选址决策中的应用

通过构建粗糙集BP神经网络模型,对影响房地产选址决策的指标进行约简,提取影响选址评价的主要指标因素用属性约简算法约简,将降维后的数据送入网络进行学习和训练,最后用训练好的的网络检验测试样本.模型使学习训练的速度和识别率提高了,为房地产企业在房地产选址决策中提供了一种更为有效和实用的新方法.     

Rough sets for pattern classification using pairwise-comparison-based tables

Rough set theory is a useful mathematical tool to deal with vagueness and uncertainty in available information. The results of a rough set approach are usually presented in the form of a set of decision rules derived from a decision table. Because using the original decision table is not the only way to implement a rough set approach, it could be interesting to investigate possible improvement in classification performance by replacing the original table with an alternative table obtained by pairwise comparisons among patterns. In this paper, a decision table based on pairwise comparisons is generated using the preference relation as in the Preference Ranking Organization Methods for Enrichment Evaluations (PROMETHEE) methods, to gauges the intensity of preference for one pattern over another pattern on each criterion before classification. The rough-set-based rule classifier (RSRC) provided by the well-known library for the Rough Set Exploration System (RSES) running under Windows as been successfully used to generate decision rules by using the pairwise-comparisons-based tables. Specifically, parameters related to the preference function on each criterion have been determined using a genetic-algorithm-based approach. Computer simulations involving several real-world data sets have revealed that of the proposed classification method performs well compared to other well-known classification methods and to RSRC using the original tables.     

不完备信息下的灰色粗糙集成决策模型侯亚林

In this paper, for multiple attribute decision-making problem in which attribute values are interval grey numbers and some of them are null values, a decision model based on grey rough sets integration with incomplete information is proposed. We put forward incidence degree coefficient formula for grey interval, by information entropy theory and analysis technique, the method and principle is presented to fill up null values. We also establish the method of grey interval incidence cluster. Because grey system theory and Rough set theory are complementary each other, decision table with preference information is obtained by the result of grey incidence cluster. An algorithm for inducing decision rules based on rough set theory and the dominance relationship is presented. In some extent, this algorithm can deal with decision-making problem in which the attribute values are interval grey numbers and some of them are null values. Contrasted with classical model of cluster decision-making, the algorithm has an advantage of flexibility and compatibility to new information.     

基于粗糙集的突发事件属性约简方法

针对突发事件不完备信息系统中的原始数据存在大量属性冗余的问题,提出一种基于粗糙集的不完备信息系统属性约简方法,以剔除冗余属性,提高知识清晰度。首先对缺失、冗余、噪声以及连续型数据进行预处理;然后进行属性分类,将属性分为条件属性与决策属性,进而建立决策表;最后根据决策表的特征,结合有序加权平均算子的思想,提出一种基于属性重要度的启发式属性约简算法。文末,通过实例验证了方法的正确性与有效性,并利用该方法实现了火灾数据的属性约简。     

改进的简化决策表及属性约简

研究了不一致决策表的简化与属性约简问题,指出目前简化的决策表的局限:在简化的决策表上用现有的属性约简方法与在原决策表上基于正区域的属性约简方法,所得到的结果不一致.进一步对简化的决策表进行转换,得到新的决策表.基于正区域的属性约简,证明了在原决策表上约简与在新的决策表上约简结果相同.从而保证在实际应用中,对新的决策表可以用任意一种属性约简方法.     

Rough sets,decision algorithms and Bayes' theorem

Rough set-based data analysis starts from a data table, called an information system. The information system contains data about objects of interest characterized in terms of some attributes. Often we distinguish in the information system condition and decision attributes. Such information system is called a decision table. The decision table describes decisions in terms of conditions that must be satisfied in order to carry out the decision specified in the decision table. With every decision table a set of decision rules, called a decision algorithm, can be associated. It is shown that every decision algorithm reveals some well-known probabilistic properties, in particular it satisfies the total probability theorem and Bayes' theorem. These properties give a new method of drawing conclusions from data, without referring to prior and posterior probabilities, inherently associated with Bayesian reasoning.     

Rough set based rule induction from two decision tables

We study rule induction from two decision tables as a basis of rough set analysis of more than one decision tables. We regard the rule induction process as enumerating minimal conditions satisfied with positive examples but unsatisfied with negative examples and/or with negative decision rules. From this point of view, we show that seven kinds of rule induction are conceivable for a single decision table. We point out that the set of all decision rules from two decision tables can be split in two levels: a first level decision rule is positively supported by a decision table and does not have any conflict with the other decision table and a second level decision rule is positively supported by both decision tables. To each level, we propose rule induction methods based on decision matrices. Through the discussions, we demonstrate that many kinds of rule induction are conceivable.     

Optimal scale selection for multi-scale decision tables

Human beings often observe objects or deal with data hierarchically structured at different levels of granulations. In this paper, we study optimal scale selection in multi-scale decision tables from the perspective of granular computation. A multi-scale information table is an attribute-value system in which each object under each attribute is represented by different scales at different levels of granulations having a granular information transformation from a finer to a coarser labelled value. The concept of multi-scale information tables in the context of rough sets is introduced. Lower and upper approximations with reference to different levels of granulations in multi-scale information tables are defined and their properties are examined. Optimal scale selection with various requirements in multi-scale decision tables with the standard rough set model and a dual probabilistic rough set model are discussed respectively. Relationships among different notions of optimal scales in multi-scale decision tables are further analyzed.     

Dominance-based fuzzy rough set analysis of uncertain and possibilistic data tables

In this paper, we propose a dominance-based fuzzy rough set approach for the decision analysis of a preference-ordered uncertain or possibilistic data table, which is comprised of a finite set of objects described by a finite set of criteria. The domains of the criteria may have ordinal properties that express preference scales. In the proposed approach, we first compute the degree of dominance between any two objects based on their imprecise evaluations with respect to each criterion. This results in a valued dominance relation on the universe. Then, we define the degree of adherence to the dominance principle by every pair of objects and the degree of consistency of each object. The consistency degrees of all objects are aggregated to derive the quality of the classification, which we use to define the reducts of a data table. In addition, the upward and downward unions of decision classes are fuzzy subsets of the universe. Thus, the lower and upper approximations of the decision classes based on the valued dominance relation are fuzzy rough sets. By using the lower approximations of the decision classes, we can derive two types of decision rules that can be applied to new decision cases.     

基于变精度粗糙集的高校课堂教学质量评价模型

针对传统课堂教学质量评价模型的不足,提出了基于变精度粗糙集的高校课堂教学质量评价模型.在构建课堂教学质量评价指标体系的基础上,建立课堂教学质量评价决策信息表,采用基于属性重要度的启发式算法来求解β近似约简,从而获取课堂教学质量的相关评价规则.算例表明,模型能够在一定程度上克服现有方法的不足,为当前课堂教学评价提供了一种新的途径.     

基于粗糙集的应急案例中概率规则挖掘方法

应急案例作为描述突发事件发生、发展及应对过程的文本,蕴含了潜在的规律与宝贵的经验。为了挖掘应急案例中各要素间潜在的关联关系,构建出基于粗糙集的应急案例中概率规则挖掘方法。首先,构建出应急案例知识五元组,描述应急案例共性特征,并将诸多应急案例信息组织成一张应急案例决策表;然后,应用遗传算法对应急案例决策表进行属性约简,进而获取概率规则;最后,以大兴安岭林区50起重特大火灾案例为例,阐述方法的具体执行过程,并通过两组测试实验证明了方法的可行性和有效性。该方法描述了应急案例的共性本体特征,具有较高的可重用性,有利于为决策者采取应急管理措施提供决策支持。