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

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

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

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

区间值信息系统上决策规则的获取与优化

以区间值信息系统上的变精度相容关系所确定的极大变精度相容类作为的基本知识,在相似水平不变的情形下,提出了极大变精度相容类的属性描述、相对约简、决策规则及相对最优决策规则等概念.最后,针对极大变精度相容类,定义了一种基于区分矩阵的区分函数,并通过计算区分函数的析取范式得到获取区间值信息系统相对最优决策规则的具体操作方法.     

基于粗糙集的模糊决策算法

给出一种从连续决策表中提取模糊决策规则的规则提取算法。首先,转化连续属性值为模糊值;然后,给出两个不同对象的模糊属性值关于相应连续属性的相似度;其次,给出了λ相似关系与λ相似类的定义。根据λ相似关系,给出粗糙-模糊空间中的下近似与上近似概念;最后,结合模糊集与粗糙集理论的思想,给出一种从连续值域决策表获取决策规则的算法,并通过实例说明该算法的有效性。     

多尺度优势模糊目标决策系统的粗糙集、最优尺度选择及约简

多尺度决策系统的知识获取是当今的研究热点之一。然而,在处理实际数据时,多尺度决策系统中的条件属性值之间可能存在优劣关系,决策属性取值可能为模糊数。针对这一类多尺度决策系统的知识获取问题,本文构建了多尺度优势模糊目标粗糙集模型,给出了该模型的最优尺度选择算法,并讨论了获取所有最优尺度约简的分辨矩阵法和获取一个最优尺度约简的简便算法。最后将本文提出的多尺度优势模糊粗糙集模型、最优尺度选择和规则获取算法应用于计算机审计风险评估,得到较为合理的评估规则。     

区间值信息系统在变精度优势关系下的粗集模型

借助于属性区间值的优势程度在区间值信息系统中定义了一种具有变精度的优势关系,给出了这种变精度优势关系下的属性约简与判定,得到了区间值信息系统上属性约简的具体操作方法.考虑对象的属性值具有优劣顺序,基于变精度优势度提出了对象排序的方法.     

一种基于相似度比较的模糊属性约简方法

属性约简是粗糙集理论的重要研究内容,本文基于模糊信息系统,一方面,通过模糊相似关系定义了条件相似度以及决策相似度,建立了关于条件相似度与决策相似度的相对比较矩阵,给出了属性约简集的新定义;另一方面,结合知识的粒度、分辨度、关联度确定了条件属性对决策属性的重要度,由此,提出了一种基于相似度比较的模糊属性约简方法。     

集值信息系统在相容关系下的属性约简

借助于属性集值的相似程度在集值信息系统上定义了一种新的相客关系,给出了这种相客关系下集值信息系统的属性约简与判定,得到了集值信息系统属性约简的具体探作方法,并讨论了相似水平对集值信息系统的属性约简的影响.     

区间值优势关系系统中属性约简及规则提取方法北大核心

本文以包含偏序关系的区间值决策系统为研究对象,对连续属性值进行模糊化处理,构造一种模糊优势关系粗糙集模型,并讨论了其相关性质。基于新模型提出一种不确定性度量-模糊粗糙熵,并以此为启发信息构造一种启发式约简算法,同时给出了该算法的时间复杂度分析结果。由该算法所得到的决策规则集具备较高的准确度和覆盖度,从而保证了数据预测、分类的准确性和合理性。通过实例分析,证明该算法是区间值优势关系系统中规则获取的有效方法。     

相似关系粗集理论与相似关系信息系统

粗集理论认为知识表现为人们对对象的分类能力 ,从而用等价关系定义上 (下 )逼近并用于信息系统中知识的简约和归纳学习的研究。本文针对现实中数据局限导致等价关系弱化为相似关系 ,用相似关系代替等价关系建立粗集理论并以它为基础建立相似关系信息系统 ,进而在此类系统中研究知识简约与静态学习。文中还作为特例来讨论属性相似关系信息系统 ,作为推广而研究模糊相似关系信息系统及其近似系统     

Extended rough set model based on known same probability dominant valued tolerance relation

Classical rough set theory is based on the conventional indiscernibility relation. It is not suitable for analyzing incomplete information. Some successful extended rough set models based on different non-equivalence relations have been proposed. The data-driven valued tolerance relation is such a non-equivalence relation. However, the calculation method of tolerance degree has some limitations. In this paper, known same probability dominant valued tolerance relation is proposed to solve this problem. On this basis, an extended rough set model based on known same probability dominant valued tolerance relation is presented. Some properties of the new model are analyzed. In order to compare the classification performance of different generalized indiscernibility relations, based on the category utility function in cluster analysis, an incomplete category utility function is proposed, which can measure the classification performance of different generalized indiscernibility relations effectively. Experimental results show that the known same probability dominant valued tolerance relation can get better classification results than other generalized indiscernibility relations.     

Neighborhood based decision-theoretic rough set models

As an extension of Pawlak rough set model, decision-theoretic rough set model (DTRS) adopts the Bayesian decision theory to compute the required thresholds in probabilistic rough set models. It gives a new semantic interpretation of the positive, boundary and negative regions by using three-way decisions. DTRS has been widely discussed and applied in data mining and decision making. However, one limitation of DTRS is its lack of ability to deal with numerical data directly. In order to overcome this disadvantage and extend the theory of DTRS, this paper proposes a neighborhood based decision-theoretic rough set model (NDTRS) under the framework of DTRS. Basic concepts of NDTRS are introduced. A positive region related attribute reduct and a minimum cost attribute reduct in the proposed model are defined and analyzed. Experimental results show that our methods can get a short reduct. Furthermore, a new neighborhood classifier based on three-way decisions is constructed and compared with other classifiers. Comparison experiments show that the proposed classifier can get a high accuracy and a low misclassification cost.     

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.     

Diverse reduct subspaces based co-training for partially labeled data

Rough set theory is an effective supervised learning model for labeled data. However, it is often the case that practical problems involve both labeled and unlabeled data, which is outside the realm of traditional rough set theory. In this paper, the problem of attribute reduction for partially labeled data is first studied. With a new definition of discernibility matrix, a Markov blanket based heuristic algorithm is put forward to compute the optimal reduct of partially labeled data. A novel rough co-training model is then proposed, which could capitalize on the unlabeled data to improve the performance of rough classifier learned only from few labeled data. The model employs two diverse reducts of partially labeled data to train its base classifiers on the labeled data, and then makes the base classifiers learn from each other on the unlabeled data iteratively. The classifiers constructed in different reduct subspaces could benefit from their diversity on the unlabeled data and significantly improve the performance of the rough co-training model. Finally, the rough co-training model is theoretically analyzed, and the upper bound on its performance improvement is given. The experimental results show that the proposed model outperforms other representative models in terms of accuracy and even compares favorably with rough classifier trained on all training data labeled.     

Rough sets theory for multicriteria decision analysis

The original rough set approach proved to be very useful in dealing with inconsistency problems following from information granulation. It operates on a data table composed of a set U of objects (actions) described by a set Q of attributes. Its basic notions are: indiscernibility relation on U, lower and upper approximation of either a subset or a partition of U, dependence and reduction of attributes from Q, and decision rules derived from lower approximations and boundaries of subsets identified with decision classes. The original rough set idea is failing, however, when preference-orders of attribute domains (criteria) are to be taken into account. Precisely, it cannot handle inconsistencies following from violation of the dominance principle. This inconsistency is characteristic for preferential information used in multicriteria decision analysis (MCDA) problems, like sorting, choice or ranking. In order to deal with this kind of inconsistency a number of methodological changes to the original rough sets theory is necessary. The main change is the substitution of the indiscernibility relation by a dominance relation, which permits approximation of ordered sets in multicriteria sorting. To approximate preference relations in multicriteria choice and ranking problems, another change is necessary: substitution of the data table by a pairwise comparison table, where each row corresponds to a pair of objects described by binary relations on particular criteria. In all those MCDA problems, the new rough set approach ends with a set of decision rules playing the role of a comprehensive preference model. It is more general than the classical functional or relational model and it is more understandable for the users because of its natural syntax. In order to workout a recommendation in one of the MCDA problems, we propose exploitation procedures of the set of decision rules. Finally, some other recently obtained results are given: rough approximations by means of similarity relations, rough set handling of missing data, comparison of the rough set model with Sugeno and Choquet integrals, and results on equivalence of a decision rule preference model and a conjoint measurement model which is neither additive nor transitive.     

A rough set approach to intuitionistic fuzzy soft set based decision making

The soft set theory, originally proposed by Molodtsov, can be used as a general mathematical tool for dealing with uncertainty. Since its appearance, there has been some progress concerning practical applications of soft set theory, especially the use of soft sets in decision making. The intuitionistic fuzzy soft set is a combination of an intuitionistic fuzzy set and a soft set. The rough set theory is a powerful tool for dealing with uncertainty, granuality and incompleteness of knowledge in information systems. Using rough set theory, this paper proposes a novel approach to intuitionistic fuzzy soft set based decision making problems. Firstly, by employing an intuitionistic fuzzy relation and a threshold value pair, we define a new rough set model and examine some fundamental properties of this rough set model. Then the concepts of approximate precision and rough degree are given and some basic properties are discussed. Furthermore, we investigate the relationship between intuitionistic fuzzy soft sets and intuitionistic fuzzy relations and present a rough set approach to intuitionistic fuzzy soft set based decision making. Finally, an illustrative example is employed to show the validity of this rough set approach in intuitionistic fuzzy soft set based decision making problems.     

可用性观点下的烟叶质量粗糙集评价方法

通过对现代卷烟产业中烟叶质量新需求的理解和归纳,构建了可用性观点下的烟叶质量综合评价新指标体系。考虑到实际烟叶质量评价中的数据的复杂性和问题求解的特殊性,将基于等价关系的Pawlak粗糙集模型扩展为基于上、下近似相似关系的扩展粗糙集模型,并设计了相应的可用性观点下烟叶质量粗糙集智能评价模型,在实现了不依赖主观先验信息求取各指标客观权重的同时,进一步引入了专家的主观权重信息,以达到对烟叶“可用性”需求的动态调整。文章首次尝试了基于定量化解决途径来应用和阐释烟叶的“可用性”概念,文末的实证分析验证了本文方法的可行性和一定程度的优越性。     

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

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.