A Multi-Tuple Rough Set Approach for Information Retrieval

How to deal with the imprecise information retrieval has become more and more important in the present information society. An efficient and effective method of information retrieval based on multi tuple rough set is discussed in this paper. The new approach is considered as a generalization of the original rough set model for flexible information retrieval. The imprecise query results can be obtained by multi tuple approximations.

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.

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.

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.

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.

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

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

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

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

多Agent系统中基于Rough集的推理

定义了多 Agent系统中的推理模型 .建立了在该模型下的 Rough集和基于 Rough集方法的 Rough包含计算或称集合连接计算 .在知识发现和数据挖掘中 ,集合之间往往不是给出它们的相等性 ,而是讨论它们之间的Rough包含或连接 .因为在不同的 Agent中集合之间关系的精确和一致解释往往是不容易获得的 .一般说来 ,一条基于决策表上的规则 ,满足前提公式个体的集合包含于满足结论公式个体的集合常常是用一种支持值和信赖系数来说明 Rough包含或连接的程度 .在分布式环境中多 Agent的情况下计算 Rough包含或连接的程度常常要求提供一个多 Agent之间互学习的界面 ,所以定义了一个多 Agent系统下的推理模型或称近似空间 ,它就是被用作互学习和计算的界面 ,因此在界面上定义了一种合成运算和包含程度计算 .从而可以实现在分布式环境下 ,由多 A-gent互相协作完成可定义集合的近似和集合之间的 Rough包含或连接程度的计算 .最后 ,通过实例说明了在分布式环境下 ,多

基于Rough集的磨削参数决策系统

本文分析了 5层模糊神经网络的优缺点 ,提出了基于Rough集构造模糊神经网络的方法 ,并应用于多传感器的磨削参数决策系统 。

基于Rough集的磨削状态监测系统

磨削加工过程中工况辨别对于提高磨削的生产效率及安全生产有重要意义。综合分析多种磨削状态监测系统 ,提出了基于Rough集构造模糊神经网络的方法 ,并应用多传感器融合技术构造新的磨削状态监测系统 ,达到控制磨削加工质量的目的。

一种应用Rough集的多属性决策方法

将Rough集应用于多属性决策问题,通过引入属性的综合客观权重给出一种依据已有决策案例进行决策的新算法。其基本思想是:首先根据已有决策案例建立决策表;然后应用条件属性关于决策属性的重要度、决策案例的局部权重和全局权重等概念确定各属性的综合客观权重;再通过经验因子来调整综合客观权重和主观权重的比例,得到各属性的最终权重;最后利用所得权重计算待决策对象的决策属性值,以此进行决策。文中通过对实例的分析,说明了该算法的实用性。

基于多粒度概率粗糙集与MULTIMOORA的q-RO模糊多属性群决策

为了探索q-RO(q-rung orthopair)模糊信息系统中具备稳定决策结果的多属性群决策方法,依据多粒度概率粗糙集与MULTIMOORA(multi-objective optimization by ratio analysis plus the full MULTIplicative form)建立了一种新的q-RO模糊多粒度计算模型,并用于求解多属性群决策问题。结合q-RO模糊概率粗糙集与多粒度粗糙集,提出了多粒度q-RO模糊概率粗糙集模型。利用离差最大化法计算属性权重与决策者权重,进一步建立了基于多粒度概率粗糙集与MULTIMOORA的q-RO模糊多属性群决策方法,该方法考虑了决策风险与容错能力,可提供稳定的决策结果。通过2个实际算例验证了所建立方法的可行性与有效性。

F-粗糙集的拓展与应用

F-粗糙集是第1个动态粗糙集模型,具有良好的兼容性、表达能力以及动态性,但绝大多数粗糙集模型动态性不足.为了明晰粗糙集模型的动态性,拓展F-粗糙集的应用,综述了F-粗糙集研究的现状和发展,证明了多粒度粗糙集、多粒度邻域粗糙集和多尺度信息系统中的粗糙集可以用F-粗糙集表示.此外,还研究了F-粗糙集的可拓性,并建议将其他粗糙集模型与F-粗糙集相结合,使它们在处理动态数据、增量数据和海量数据时具有更强的能力.研究结果将提高其他粗糙集模型的动态性,有利于粗糙集进一步应用到大数据领域.

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

多粒度模糊粗糙集(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模型,提出了基于平均型聚合算子的粗糙近似集模型。