不完备序区间值决策系统中的可信规则获取

以不完备序区间值决策系统为研究对象,其中不仅包含遗漏型未知区间值,而且属性值域为全序集.给出了未知区间值的三种形式及其填充式区间值的定义,引入灰的白化方法用以构建一个新的填充式不完备序白化值决策系统,并讨论其在优势和弱势关系下的可信规则获取.进一步研究了优势和弱势对象的约简以及其决策类的相对约简问题,给出了相应的判定定理与区分函数,为最终从不完备序区间值决策系统中获取最优可信决策规则提供了新的理论基础与操作手段.、     

基于优势关系的不协调区间值目标信息系统的分布约简

区间值信息系统是单值信息系统的的一种推广,知识约简是粗糙集理论的核心问题之一.在基于优势关系下的不协调区间值信息系统中引入了分布约简和最大分布约简的概念,进一步建立了分布约简和最大分布约简的判定定理和辨识矩阵,从而利用辨识矩阵给出了在优势关系下不协调区间值目标信息系统分布约简的具体方法.     

基于优势关系的不协调区间值目标信息系统的分配约简

区间值信息系统是单值信息系统的一种推广模型,知识约简是粗糙集理论的核心问题之一,在基于优势关系下的不协调区间值目标信息系统中引入了分配约简和近似约简的概念,分别讨论了它们二者之间的关系,进一步给出了知识约简的判断定理和辨识矩阵,从而提供了在优势关系下不协调区间值目标信息系统分配约简的具体方法。     

集值决策表基于邻域关系的属性约简

集值信息系统是完备信息系统的广义形式,它当中的一些对象在某些属性下的取值可能不止一个,反映的是信息的不确定性.本文在集值信息系统上引入对象的邻域关系,并以每个对象的邻域作为基本集,建立了集值信息系统的粗糙集方法.为了简化的知识表示,我们进一步讨论了邻域协调集值决策表的正域约简与邻域不协调集值决策表的近似分布约简,给出了正域约简与近似分布约简的等价刻画条件,并借助区分函数给出了计算正域约简与近似分布约简的方法.     

一类广义区间值模糊粗糙集的公理化刻画

首先在一般区间值模糊关系上定义了两个论域上的一类广义区间值模糊粗糙集.借助区间值模糊集的截集给出区间值模糊粗糙上、下近似算子的一般表示.讨论了各种特殊的区间值模糊关系与区间值模糊近似算子性质之间的等价刻画.最后利用公理化方法刻画区间值模糊粗糙集.描述区间值模糊上、下近似算子的公理集保证了生成相同近似算子的区间值模糊关系的存在性.     

正规区间值模糊集上的三角范数

在正规区间值模糊集空间上 ,通过引进区间数的运算及 t-范数算子 ,给出了扩张运算及序的定义 ,讨论了它们的基本性质 .从而 ,获得了这种区间值模糊集关于 t-范数的一些基本结果 .     

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

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

基于区间值模糊点和区间值模糊集邻属关系的区间值模糊子群

利用区间值模糊集的区间值水平截集的概念,给出了区间值模糊点与区间值模糊集邻属关系的定义,将这种邻属关系应用到区间值模糊代数的研究中,从而给出了(α,β)-区间值模糊子群的定义。通过研究16种(α,β)-区间值模糊子群,指出有意义的是(∈,∈)((∈,∈∨q),(∈∧q,∈))-区间值模糊子群。证明了群G的一个区间值模糊子集A为(∈,∈)((∈,∈∨q)或(∈∧q,∈))-区间值模糊子群的充要条件是对所有的λ=[a1,a2]≤[0.5,0.5],[0.5,0.5]μ=[b1,b2],其区间值水平截集Aλ和Aμ(Aλ或Aμ)为G的三值模糊子群。从而建立了基于区间值模糊点和区间值模糊集邻属关系的新的区间值模糊子群理论。     

一种基于序区间偏好信息的群决策分析方法

针对序区间偏好信息的群决策方案排序问题,本文提出了一种新的分析方法.首先,给出了序区间的有关定义及其性质;然后,通过定义专家群体判断关于方案在排序位置的期望可能度和专家群体判断关于方案的数学期望值,给出了序区间偏好信息的群决策方案排序方法.最后,通过一个算例说明了本文提出的分析方法。     

基于区间值三角模糊数的多属性群决策方法

研究了属性值以区间值三角模糊数表示的群决策问题,对属性值为模糊数的HFGB算子进行扩展,定义了区间值三角模糊数几何加权均值(ITFGWM)算子.同时对Carson定义的均值进行扩展,从而给出了区间值三角模糊数的均值定义.在此基础上,基于ITFGWM算子、均值及可能度,提出了区间值三角模糊数的模糊多属性群决策的新方法,最后给出一个实例进行分析,结果表明了此方法的实用性和可行性.     

Incomplete decision contexts: Approximate concept construction,rule acquisition and knowledge reduction

Incomplete decision contexts are a kind of decision formal contexts in which information about the relationship between some objects and attributes is not available or is lost. Knowledge discovery in incomplete decision contexts is of interest because such databases are frequently encountered in the real world. This paper mainly focuses on the issues of approximate concept construction, rule acquisition and knowledge reduction in incomplete decision contexts. We propose a novel method for building the approximate concept lattice of an incomplete context. Then, we present the notion of an approximate decision rule and an approach for extracting non-redundant approximate decision rules from an incomplete decision context. Furthermore, in order to make the rule acquisition easier and the extracted approximate decision rules more compact, a knowledge reduction framework with a reduction procedure for incomplete decision contexts is formulated by constructing a discernibility matrix and its associated Boolean function. Finally, some numerical experiments are conducted to assess the efficiency of the proposed method.     

基于概念格的决策形式背景属性约简及规则提取

给出了决策形式背景下的属性约简与规则提取方法.为此,针对属性约简中起不同作用的属性,区分了必要属性与不必要属性,给出了各类属性的特征和判别方法;在此基础上得到了决策形式背景下的规则提取与属性约简方法,并通过实例表明了该约简方法的可行性与有效性.     

Attribute reduction based on generalized fuzzy evidence theory in fuzzy decision systems

Attribute reduction is viewed as an important issue in data mining and knowledge representation. This paper studies attribute reduction in fuzzy decision systems based on generalized fuzzy evidence theory. The definitions of several kinds of attribute reducts are introduced. The relationships among these reducts are then investigated. In a fuzzy decision system, it is proved that the concepts of fuzzy positive region reduct, lower approximation reduct and generalized fuzzy belief reduct are all equivalent, the concepts of fuzzy upper approximation reduct and generalized fuzzy plausibility reduct are equivalent, and a generalized fuzzy plausibility consistent set must be a generalized fuzzy belief consistent set. In a consistent fuzzy decision system, an attribute set is a generalized fuzzy belief reduct if and only if it is a generalized fuzzy plausibility reduct. But in an inconsistent fuzzy decision system, a generalized fuzzy belief reduct is not a generalized fuzzy plausibility reduct in general.     

优势关系下不协调目标信息系统的部分一致约简

在基于优势关系下的不协调目标信息系统中引入了部分一致约简的概念, 并得到了部分一致约简的判定定理以及辨识矩阵, 建立了不协调目标信息系统的部分一致约简的具体方法, 同时通过实例验证了该方法的有效性, 从而为优势关系下信息系统的知识发现提供了理论基础.     

区间信度环境下基于偏好熵的随机格序排列方法

针对偏好优劣关系的信度为区间值的决策偏好系统,运用熵理论提出了一种基于区间值分布偏好向量的决策分析方法。首先,将决策者对方案的偏好描述由:优于、劣于、等价和不可比这四种关系拓广为优于、劣于、等价、无法比较但有上确界、无法比较但有下确界、无法比较且有上确界又下确界、不可比七种偏好关系,并结合区间证据的概念和性质给出了决策偏好系统的区间值分布偏好向量与相对熵的概念、性质。然后,构建了基于偏好熵的证据推理非线性优化模型,通过求解模型,并结合优先原则和集结规则将个人偏好集结成群体偏好,给出了该决策方法的具体步骤,举例说明了方法的可行性。     

Dependence-space-based attribute reductions in inconsistent decision information systems

In rough set theory, attribute reduction is an important mechanism for knowledge discovery. This paper mainly deals with attribute reductions of an inconsistent decision information system based on a dependence space. Through the concept of inclusion degree, a generalized decision distribution function is first constructed. A decision distribution relation is then defined. On the basis of this decision distribution relation, a dependence space is proposed, and an equivalence congruence based on the indiscernibility attribute sets is also obtained. Applying the congruences on a dependence space, new approaches to find a distribution consistent set are formulated. The judgement theorems for judging distribution consistent sets are also established by using these congruences and the decision distribution relation.     

形式背景的AE-仿紧性

利用拓扑学的思想定义了形式背景的AE-仿紧性,给出了AE-仿紧背景的充分条件,研究了AE-仿紧背景的若干性质.证明了AE-仿紧性被适当的信息态射所保持,对一类闭嵌入子背景是遗传的.在以形式背景为对象,信息态射为态射的范畴FCC中,给出了两个形式背景乘积对象的表示,证明了两个AE-仿紧背景的乘积对象还是AE-仿紧的.     

决策信息系统中的拓扑学方法

在决策信息系统中引入拓扑结构,借助拓扑学的基本概念(拓扑、内部和闭包等)研究决策问题,用它们刻画决策信息系统中的一些重要概念(决策协调集、决策约简集、下近似协调集、下近似约简集、上近似协调集、上近似约简集),并利用它们把这些重要概念推广到最一般的情况,建立起相应的约简理论.     

Discrete optimization algorithms and problems of decision making in a fuzzy environment

An approach to solving optimization problems with fuzzy coefficients is described. It consists in formulating and analyzing one and the same problem within the framework of mutually related models by constructing equivalent analogs with fuzzy coefficients in objective functions alone. Since the approach is applied within the context of fuzzy discrete optimization problems, modified algorithms of discrete optimization are discussed. These algorithms are based on a combination of formal and heuristic procedures and allow one to obtain quasi-optimal solutions after a small number of steps, thus overcoming the computational complexity posed by the NP-completeness of discrete optimization problems. The subsequent contraction of the decision uncertainty regions is associated with reduction of the problem to multiobjective decision making in a fuzzy environment using techniques based on fuzzy preference relations. The results of the paper are of a universal character and are already being used to solve practical problems in several fields.     

Multicriteria Analysis Represented by Artificial Intelligence Techniques

This paper presents a possible representation of multicriteria analysis by means of artificial intelligence techniques. The decision process activities characterized by the existence of formal and technical knowledge were identified and attention was focused on the area of multicriteria outranking methods. The knowledge characteristics suggested the use of artificial intelligence techniques, based on a conceptualization in which the domain of discourse is the set of the multicriteria methodology concepts used in the analysed area of activities, and the relational set is the union of the admissible relations among the concepts and the relations elicited from experience. The suitable AI techniques were tested by implementing a knowledge-based interface between the outranking methods and a user who was not very familiar with this approach.