具有交流结构的区间模糊联盟合作对策

当前具有模糊联盟的合作对策研究主要基于任意局中人可自由结盟的基本假设,但现实结盟活动中,局中人普遍受到资源或地位等因素的限制,其合作往往具有交流结构限制。因此,基于Choquet模糊延拓研究了具有交流结构的区间模糊多人合作对策,给出了相应区间模糊联盟平均树解,并通过公理化体系对此解进行了研究。通过供应链纵向合作创新收益分配实例应用,并与区间模糊联盟合作对策的Shapley值进行比较,说明该方法的现实有效性。     

模糊联盟图合作对策tau值

针对模糊环境下有限制的联盟合作情况,利用Choquet积分定义了模糊联盟图合作对策tau值,证明了其存在性和其他重要性质,讨论了其与模糊核心的关系,并给出凸模糊联盟图合作对策tau值的计算公式.最后通过一个算例表明了该tau值的有效性和合理性.研究发现,该tau值是传统tau值的拓展.     

A value for games with a priori incompatible players

ABSTRACT

Numerous situations in decision-making deal with a set of agents who need to work together but they have some a priori bilateral problems among them. This paper introduces cooperative games with a priori incompatibilities using particular coalition systems. In these games, there are some red lines between some players, so that the negotiation has two stages. In the first stage, players can only negotiate with those with whom they are compatible. After that, the grand coalition will be formed. A value for these games is defined by using cooperative games with coalition configuration. A characterization of this value is obtained.     

Parallel characterizations of a generalized Shapley value and a generalized Banzhaf value for cooperative games with level structure of cooperation

We present parallel characterizations of two different values in the framework of restricted cooperation games. The restrictions are introduced as a finite sequence of partitions defined on the player set, each of them being coarser than the previous one, hence forming a structure of different levels of a priori unions. On the one hand, we consider a value first introduced in Ref. [18], which extends the Shapley value to games with different levels of a priori unions. On the other hand, we introduce another solution for the same type of games, which extends the Banzhaf value in the same manner. We characterize these two values using logically comparable properties.     

RGB color image encryption based on Choquet fuzzy integral

In recent years, one can see an increasing interest in the security of digital images. This research presents a new RGB color image encryption using keystream generator based on Choquet fuzzy integral (CFI). The properties of the dynamical keystream generator with mathematical analysis are presented in this work. In the proposed method, the CFI is first used to generate pseudo-random keystreams. Then, each of the color pixels is decomposed into three gray-level components. The output of the CFI is used to randomly shift the bits of three gray-level components. Finally, three components of RGB color pixels and the generated keystream are coupled to encrypt the permuted components. Performance aspects of the proposed algorithm such as the entropy analysis, differential analysis, statistical analysis, cipher random analysis, and cipher sensitivity analysis are introduced to evaluate the security of the new scheme. The experimental results reveal the fact that the proposed algorithm is suitable for practical use in protecting the security of digital image information distributed via the Internet.     

基于谈判集的模糊合作博弈的收益分配方案

为了弥补核心作为博弈解可能为空集的缺陷,将经典合作博弈中的谈判集解拓展到模糊合作博弈中,提出了模糊合作博弈的模糊谈判集的概念.探讨模糊网络博弈的模糊谈判集和核心的等价性质,并对相关结论加以证明.研究表明,模糊合作博弈的模糊谈判集是经典合作博弈谈判集的自然拓展,该结果丰富了对模糊合作博弈的解的研究,也表明了模糊网络博弈核心的非空性,进而保证其最优分配方案的存在性.     

基于Choquet积分的深层网数据源选择

提出一种基于Choquet模糊积分的深层网数据源选择方法。通过在1组关键字上的查询结果评价深层网数据源的质量,评价时不仅考虑到关键字间的权重,同时还考虑多个关键字之间存在的交互作用。实验结果表明,该方法有效,且对深层网数据源的评价更接近真实。     

FUZZY MEASURES AND FUZZY INTEGRALS: AN OVERVIEW

This paper provides an overview of fuzzy measures, fuzzy integration theories and Choquet's capacity theory. Belief, plausibility, and possibility measures are characterized as Choquet capacities and as fuzzy measures. The relationship between possibility measures, fuzzy sets, and approximate reasoning is established. Recent results on extensions of fuzzy measures, structural characteristics of fuzzy measures, and convergence of function sequences on fuzzy measure spaces are presented. Fuzzy measure integration concepts due to Sugeno and Choquet and their applications are discussed. An extensive list of references to the literature of fuzzy measures, Sugeno and Choquet integrals, fuzzy probabilities, fuzzy random variables, probabilistic sets, and random sets is provided. Applicalions discussed or referenced include information fusion, information retrieval, approximate reasoning, artificial intelligence, uncertainty theory, and control and decision theory.     

模糊测度下IEEE 802.11的DCF性能优化

提出了一种基于模糊测度的方法,采用Choquet积分模型定量测度IEEE 802.11的MAC协议中各参数及其参数之间的内在关系对系统性能的影响。根据测度结果优化MAC层协议参数集,获得对吞吐量影响最大的参数子集。通过调整子集中的参数,提出一种有效提高WLAN吞吐量的策略。仿真结果表明,根据测度结果只需调整子集中的参数以提高吞吐量,有效改善无线资源利用率。     

多决策树的模糊积分融合在银行信贷管理系统中的应用

为了提高基于数据挖掘的商业银行信贷管理系统的信贷风险评估水平,将多决策树的Choquet模糊积分融合(MTCFF)模型应用到银行信贷管理系统中。基本思想是采用决策树在已知类型的客户数据上进行挖掘,按照决策树剪枝程度不同形成不同的决策树并产生规则,利用所生成的不同决策树的规则,对未知类型的客户数据进行分类,然后让Choquet模糊积分对多棵决策树的分类结果进行融合,形成最优判断。采用UCI数据库中German客户信用卡数据集进行验证,实验证明Choquet模糊积分的非线性融合效果优于单棵决策树的分类效果,也优于其他线性融合方法,并且Choquet模糊积分要优于Sugeno模糊积分。     

准则关联的直觉模糊多准则决策方法

针对准则值为直觉三角模糊数,准则间相互关联的多准则决策问题,提出基于Choquet分的决策方法．该方法首先利用偏好函数定义方案在各准则下的优序关系,若模糊测度已知,则直接利用Choquet积分进行求解;若准则集上的模糊测度未知,则利用部分决策信息和最小方差法建立二次规划模型,求解模糊测度,再利用Choquet分进行决策．最后通过实例表明了该方法的有效性和可行性．     

基于共识与Choquet积分的模糊Petri网可信度确定方法*

针对模糊Petri网可信度确定过程中,决策结果可接受程度较低和未考虑影响因子间关联的问题,提出基于群体共识测度与Choquet积分确定模糊Petri网可信度的方法。设计了基于决策者与群体评估信息偏差修正的自适应共识测度算法,获取可接受程度较高的群体评估信息。构建最大2-可加模糊测度Marichal熵模型求解影响因子间的交互作用系数,根据交互作用系数、默比乌斯变换和模糊测度之间的关系确定模糊测度,利用Choquet积分算子集结群体评估信息得到模糊Petri网可信度。将此方法用于确定燃气轮机故障诊断模糊Petri网输入库所可信度,并与未考虑共识测度和影响因子间关联的方法进行比较,计算结果验证了该方法的有效性和可行性。     

基于Choquet积分的多属性灰靶群决策方法

针对属性间具有关联性且属性值为区间灰数的多属性群决策问题,提出一种基于Choquet 积分的多属性灰靶群决策方法.根据模糊测度和Choquet积分的性质,定义关于区间灰数的Choquet积分信息集成算子,并证明其相关性质;通过灰靶决策方法,对方案集的综合靶心距进行排序.仿真实例验证了所提出方法的合理性.     

A new nonlinear classifier with a penalized signed fuzzy measure using effective genetic algorithm

This paper proposes a new nonlinear classifier based on a generalized Choquet integral with signed fuzzy measures to enhance the classification accuracy and power by capturing all possible interactions among two or more attributes. This generalized approach was developed to address unsolved Choquet-integral classification issues such as allowing for flexible location of projection lines in n-dimensional space, automatic search for the least misclassification rate based on Choquet distance, and penalty on misclassified points. A special genetic algorithm is designed to implement this classification optimization with fast convergence. Both the numerical experiment and empirical case studies show that this generalized approach improves and extends the functionality of this Choquet nonlinear classification in more real-world multi-class multi-dimensional situations.     

多机器人追逃问题中的追捕联盟生成算法

为了解决随着机器人数量的增加,多机器人追逃中的最优联盟求解时间复杂度呈指数增长给实时计算带来的困难,本文在证明机器人追逃问题中的联盟收益独立性的基础上, 根据逃跑者的数量来决定联盟结构中子联盟的数量,提出基于贪婪最优收益的追捕联盟算法．该算法首先根据逃跑机器人的数量确定联盟的个数, 然后根据追捕机器人-逃跑机器人的追逃收益确定各个子联盟及其领导者,最后利用“贪婪最优”算法扩展新成员进入各子联盟直到所有的追捕者全部进入各个联盟． 本算法简化了联盟结构每层的搜索量,总的搜索复杂度为O(m×(n-m)),极大地缩短了算法的搜索时间,实际实验仿真结果也证明了本算法在追捕搜索效率和总追捕消耗时间上的优越性．     

A Rough Set Approach to Estimating the Game Value and the Shapley Value from Data

A value of a game v is a function which to each coalition S assigns the value v(S) of this coalition, meaning the expected pay–off for players in that coalition. A classical approach of von Neumann and Morgenstern [6] had set some formal requirements on v which contemporary theories of value adhere to. A Shapley value of the game with a value v [14] is a functional Φ giving for each player p the value Φ_p(v) estimating the expected pay-off of the player p in the game. Game as well as conflict theory have been given recently much attention on the part of rough and fuzzy set communities [11,8,1,4,7,2]. In particular, problems of plausible strategies [1] in conflicts as well as problems related to Shapley's value [3,2] have been addressed.We confront here the problem of estimating a value as well as Shapley's value of a game from a partial data about the game. We apply to this end the rough set ideas of approximations, defining the lower and the upper value of the game and, respectively, the lower and upper Shapley value. We also define a notion of an exact coalition, on which both values coincide giving the true value of the game; we investigate the structure of the family of exact sets showing its closeness on complements, disjoint sums, and intersections of coalitions covering the set of players. This work sets open a new area of rough set applications in mining constructs from data. The construct mined in this case are values as well as Shapley values of games.     

直觉模糊集的Choquet积分相关测度及其决策应用

Qu给出的直觉模糊集的Choquet积分相关系数的计算公式与相关系数的性质相矛盾.为此,通过一个实例说明Qu定义的直觉模糊Choquet积分相关系数定义存在的问题,并结合相关系数的性质证明,分析问题出现的原因;然后,针对存在的问题,以直觉模糊集的Choquet积分相关指标为基础,给出新的直觉模糊集的Choquet积分信息能量的概念,定义新的直觉模糊集的Choquet积分相关系数,并讨论相关系数的性质;最后,利用新定义的直觉模糊集的Choquet积分相关测度,推导出方案与正理想方案之间的Choquet积分相关系数计算公式,据此提出一种直觉模糊多属性决策方法,并通过实例分析以及方法对比,说明所提出方法的可行性和有效性.     

Choquet模糊积分特征融合的步态识别

研究一种利用Choquet模糊积分对小波矩特征和人体宽度特征进行融合的步态识别算法。该算法对每个步态序列采用背景减除法提取人的二值化的运动轮廓图像序列,利用人体步态周期图像的小波矩特征和宽度特征对提取出的步态轮廓进行描述,得出的小波矩特征和宽度特征根据重要性作为总体特征输入,运用Choquet模糊积分融合选取SVM分类器进行识别,识别结果与最新的线性加权融合识别方法进行比较,结果表明Choquet模糊积分方法有较好的识别效果。