Multi-Granularity Neighborhood Fuzzy Rough Set Model on Two Universes

The two universes multi-granularity fuzzy rough set model is an effective tool for handling uncertainty problems between two domains with the help of binary fuzzy relations. This article applies the idea of neighborhood rough sets to two universes multi-granularity fuzzy rough sets, and discusses the two-universes multi-granularity neighborhood fuzzy rough set model. Firstly, the upper and lower approximation operators are defined in the two universes multi-granularity neighborhood fuzzy rough set model. Secondly, the properties of the upper and lower approximation operators are discussed. Finally, the properties of the two universes multi-granularity neighborhood fuzzy rough set model are verified through case studies.

A Multi-Tuple Rough Set Approach for Information Retrieval

如何处理非精确条件下的数据检索在当前信息社会中已变得越来越为重要．本文介绍了一种基于多元组Ｒｏｕｇｈ集的有效信息检索方法．这种新方法是对普通Ｒｏｕｇｈ集模型的一种推广。

2-Tuple and Rough Set Based Reduction Model for Multi-sensory Evaluation Indicators

In order to lessen adverse influences of excessive evaluative indicators of the initial set in multi-sensory evaluation,a2-tuple and rough set based reduction model is built to simplify the initial set of evaluative indicators. In the model,a great variety of descriptive forms of the multi-sensory evaluation are also taken into consideration. As a result,the method proves effective in reducing redundant indexes and minimizing index overlaps without compromising the integrity of the evaluation system. By applying the model in a multi-sensory evaluation involving community public information service facilities,the research shows that the results are satisfactory when using genetic algorithm optimized BP neural network as a calculation tool. It shows that using the reduced and simplified set of indicators has a better predication performance than the initial set,and 2-tuple and rough set based model offers an efficient way to reduce indicator redundancy and improves prediction capability of the evaluation model.

Approach to stochastic multi-attribute decision problems using rough sets theory

Multi-attribute decision problems where the performances of the alternatives are random variables are considered. The suggested approach grades the probabilities of preference of one alternative over another with respect to the same attribute. Based on the graded probabilistic dominance relation, the pairwise comparison information table is defined. The global preferences of the decision maker can be seen as a rough binary relation. The present paper proposes to approximate this preference relation by means of the graded probabilistic dominance relation with respect to the subsets of attributes. At last, the method is illustrated by an example.

Cost Sensitive Multi-Granulation Preference Relation Rough Set for Ordinal Decision System

The preference analysis is a class of important issues in multi-criteria ordinal decision making.The rough set is an effective approach to handle preference analysis.In order to solve the multi-criteria preference analysis problems,this paper improves the preference relation rough set model and expands it to multi-granulation cases.Cost is also an important issue in the field of decision analysis.Taking the cost into consideration,we also expand the model to the cost sensitive multi-granulation preference relation rough set.Some theorems are represented,and the granule structure selection based on approximation quality is investigated.The experimental results show that the multi-granulation preference rough set approach with the consideration of cost has a better performance in granule structure selection than that without cost consideration.

Rough set based multi-agent system cooperation for industrial supervisory interface system

In this paper, rough set theory is introduced into the interface multi-agent system （MAS） for industrial supervisory system. Taking advantages of rough set in data mining, a cooperation model for MAS is built. Rules for avoiding cooperation conflict are deduced. An optimization algorithm is used to enhance security and real time attributes of the system. An application based on the proposed algorithm and rules are given.

Gear Fault Diagnosis Based on Rough Set and Support Vector Machine

By introducing Rough Set Theory and the principle of Support vector machine,a gear fault diagnosis method based on them is proposed.Firstly,diagnostic decision-making is reduced based on rough set theory,and the noise and redundancy in the sample are removed,then,according to the chosen reduction,a support vector machine multi-classifier is designed for gear fault diagnosis.Therefore,SVM’training data can be reduced and running speed can quicken.Test shows its accuracy and effi- ciency of gear fault diagnosis.

Research on Destriping Based on Rough Set

In order to remove the stripe noises in cotton foreign fiber images by line scanning camera collected, in multi threshold segmentation of rough set, every region’s color is instead of the statistics color of the region. This method can retain the detail information of original image as far as possible, and do well in the stripe noise removal. The roughness of rough set was calculated respectively using directional diagram, Canny operator and Sobel operator. Comparing the three methods, the results indicate that the Canny operator keeps the more details of image, and directional diagram and Sobel operator have the better effects on denoising.

Research on knowledge acquisition method about the IF/THEN rules based on rough set theory

The basic principles of IF/THEN rules in rough set theory are analyzed first, and then the automatic process of knowledge acquisition is given. The numerical data is qualitatively processed by the classification of membership functions and membership degrees to get the normative decision table. The regular method of relations and the reduction algorithm of attributes are studied. The reduced relations are presented by the multi-representvalue method and its algorithm is offered. The whole knowledge acquisition process has high degree of automation and the extracted knowledge is true and reliable.

Synthetic security assessment based on variable consistency dominance-based rough set approach

Security assessment can help understand the security conditions of an information system and yieldresults highly conducive to the solution of security problems in it.Taking the computer networks in a certainuniversity as samples,this paper,with the information system security assessment model as its foundation,proposes a multi-attribute group decision-making (MAGDM) security assessment method based ona variable consistency dominance-based rough set approach (VC-DRSA).This assessment method combinesVC-DRSA with the analytic hierarchy process (AHP),uncovers the inherent information hidden indata via the quality of sorting (QoS),and makes a synthetic security assessment of the information systemafter determining the security attribute weight.The sample findings show that this methoil can effectivelyremove the bottleneck of MAGDM,thus assuming practical significance in information system security assessment.

Dominance-Based Rough Set Approach in Selection of Portfolio of Sustainable Development Projects

In our study, the Dominance-based Rough Set Approach (DRSA) has been proposed to assist the Board of Directors of the Community Futures Development Corporations (CFDC), the sub-region of Abitibi-West (Quebec). The CFDC needs a tool for decision support to select the projects that are proposed by the contractors and partners of its territory. In decision making, a balanced set of 22 indicators is considered. These indicators derive from five perspectives: economic, social, demographic, health and wellness. The DRSA proposal is suitable for the data processing with multiple indicators providing on many examples to infer decision rules related to the preference model. In this paper we show that decision rules developed with the use of rough set theory allow us to simplify the process of selecting a portfolio for sustainable development by reducing a number of redundant indicators and identifying the critical values of selected indicators.

基于平均型聚合函数的多粒度模糊粗糙集

多粒度模糊粗糙集(multi-granulation fuzzy rough set,MGFRS)是一种重要的粗糙集模型。乐观多粒度模糊粗糙集和悲观多粒度模糊粗糙集分别给出了被描述对象的两种极端描述。从数据聚合角度看,将不同粒度值合并为单一粒度值时,乐观MGFRS采用的是取小算子,悲观MGFRS采用的是取大算子。将取小与取大算子拓展为一般的平均型聚合算子,提出了一种新的多粒度模糊粗糙集模型:基于平均型聚合函数的多粒度模糊粗糙集(multi-granulation fuzzy rough set model on the base of average aggregate function,MFA)模型。研究了MFA模型的基本性质,给出了MFA模型与乐观和悲观多粒度模糊粗糙集的关系。同时,基于MFA模型,提出了基于平均型聚合算子的粗糙近似集模型。

基于Spark和NRSCA策略的并行深度森林算法

针对并行深度森林在大数据环境下存在冗余及无关特征过多、两端特征利用率过低、模型收敛速度慢以及级联森林并行效率低等问题,提出了基于Spark和NRSCA策略的并行深度森林算法——PDF-SNRSCA。首先,该算法提出了基于邻域粗糙集和Fisher score的特征选择策略(FS-NRS),通过衡量特征的相关性和冗余度,对特征进行过滤,有效减少了冗余及无关特征的数量;其次,提出了一种随机选择和等距提取的扫描策略(S-RSEE),保证了所有特征能够同概率被利用,解决了多粒度扫描两端特征利用率低的问题;最后,结合Spark框架,实现级联森林并行化训练,提出了基于重要性指数的特征筛选机制(FFM-II),筛选出非关键性特征,平衡增强类向量与原始类向量维度,从而加快模型收敛速度,同时设计了基于SCA的任务调度机制(TSM-SCA),将任务重新分配,保证集群负载均衡,解决了级联森林并行效率低的问题。实验表明,PDF-SNRSCA算法能有效提高深度森林的分类效果,且对深度森林并行化训练的效率也有大幅提升。

广义多粒度双量化邻域粗糙集

针对实数型数据的信息量化问题,引入相对概念和绝对基数构建了广义多粒度双量化邻域粗糙集模型.首先,通过I型和II型广义多粒度上、下邻域特征支撑函数构建两类广义多粒度上、下邻域近似算子并讨论其性质;其次,讨论了两种广义多粒度邻域粗糙集的关系;最后,通过传染病案例实证分析了模型的实用性和有效性.

基于多元组Rough集的不相容决策

Ｒｏｕｇｈ集理论是一种具有模糊边界的集合理论．它被广泛应用于不相容决策表中的规则提取．本文讨论了基于多元组Ｒｏｕｇｈ集的不相容决策方法，并给出了相应的算法，同时也对不相容规则的相容度作了分析．该方法比普通Ｒｏｕｇｈ集方法更简单、更有效．

基于多核模糊条件熵的多类型混合数据属性约简算法

对数据进行有效属性约简是数据挖掘中一个具有挑战性的任务。当前,粗糙集理论是构造属性约简的一种常用方法。然而,现有的属性约简方法都侧重于单类型的数据,对现实环境下多类型混合的数据并不适用。为了解决这一问题,提出一种多核模糊条件熵的多类型混合数据属性约简算法。首先,针对标记型、数值型、区间型和集值型混合的多类型数据,提出了一种多核模糊相似关系。然后,基于这种多核模糊相似关系,定义了一种多核模糊条件熵模型,并讨论了它的单调性和有界性。最后,利用多核模糊条件熵的单调性提出了一种多类型混合数据的属性约简算法。通过UCI数据集的实验分析验证了该算法的有效性。

一种基于遗传算法的Rough集多知识抽取方法

Rough集理论为知识约简提供了一种有效的方法.提出了一种基于遗传算法的Rough集多知识抽取方法.针对决策系统中知识约简的不唯一性,构造了一种多约简算法,创建了多知识.在此基础上,利用遗传算法从一个更高的层次对多知识进行优化,并从中抽取最优知识集.试验结果分析表明,通过遗传算法优化后抽取的多知识较单体知识具有更高的精度,使知识的表示更具广义性.

基于分布式多关联属性的高维数据差分隐私保护方法

针对高维数据发布的过程中存在由多关联属性引发的隐私信息泄露风险问题,在分布式环境下提出一种满足差分隐私保护的多关联属性高维数据发布方法(HDMPDP)。根据数据维度,提出一种基于分布式划分的粗糙集高效降维方法,完成对高维复杂数据特征属性的划分,降低数据维度的同时提高处理效率;设计属性分类准则,利用属性信息熵改进关联分析方法;对得到的属性分别进行加噪,优化噪声添加的方式,减轻关联属性带来的隐私问题。在Spark分布式框架下实现隐私保护数据发布,通过高维数据实验验证了该方法的有效性和隐私保护的安全性。