Dominance-based rough set approach as a paradigm of knowledge discovery and granular computing

Dominance-based rough set approach(DRSA) permits representation and analysis of all phenomena involving monotonicity relationship between some measures or perceptions.DRSA has also some merits within granular computing,as it extends the paradigm of granular computing to ordered data,specifies a syntax and modality of information granules which are appropriate for dealing with ordered data,and enables computing with words and reasoning about ordered data.Granular computing with ordered data is a very general paradigm,because other modalities of information constraints,such as veristic,possibilistic and probabilistic modalities,have also to deal with ordered value sets(with qualifiers relative to grades of truth,possibility and probability),which gives DRSA a large area of applications.

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.

Density-based rough set model for hesitant node clustering in overlapping community detection

Overlapping community detection in a network is a challenging issue which attracts lots of attention in recent years.A notion of hesitant node（HN） is proposed. An HN contacts with multiple communities while the communications are not strong or even accidental, thus the HN holds an implicit community structure.However, HNs are not rare in the real world network. It is important to identify them because they can be efficient hubs which form the overlapping portions of communities or simple attached nodes to some communities. Current approaches have difficulties in identifying and clustering HNs. A density-based rough set model（DBRSM） is proposed by combining the virtue of densitybased algorithms and rough set models. It incorporates the macro perspective of the community structure of the whole network and the micro perspective of the local information held by HNs, which would facilitate the further ＂growth＂ of HNs in community. We offer a theoretical support for this model from the point of strength of the trust path. The experiments on the real-world and synthetic datasets show the practical significance of analyzing and clustering the HNs based on DBRSM. Besides, the clustering based on DBRSM promotes the modularity optimization.

Covering-Based Soft Rough Sets

Covering-based rough sets process data organized by a covering of the universe. A soft set is a parameterized family of subsets of the universe. Both theories can deal with the uncertainties of data. Soft sets have not any restrictions on the approximate description of the object,and they might form a covering of the universe. From this viewpoint,we establish a connection between these two theories. Specifically,we propose a complementary parameter for this purpose. With this parameter,the soft covering approximation space is established and the two theories are bridged. Furthermore,we study some relations between the covering and the soft covering approximation space and obtain some significant results. Finally,we define a notion of combine parameter which can help us to simplify the set of parameters and reduce the storage requirement of a soft covering approximation space.

Yarn Quality Prediction and Diagnosis Based on Rough Set and Knowledge-Based Artificial Neural Network

In the spinning process, some key process parameters( i. e.,raw material index inputs) have very strong relationship with the quality of finished products. The abnormal changes of these process parameters could result in various categories of faulty products. In this paper, a hybrid learning-based model was developed for on-line intelligent monitoring and diagnosis of the spinning process. In the proposed model, a knowledge-based artificial neural network( KBANN) was developed for monitoring the spinning process and recognizing faulty quality categories of yarn. In addition,a rough set( RS)-based rule extraction approach named RSRule was developed to discover the causal relationship between textile parameters and yarn quality. These extracted rules were applied in diagnosis of the spinning process, provided guidelines on improving yarn quality,and were used to construct KBANN. Experiments show that the proposed model significantly improve the learning efficiency, and its prediction precision is improved by about 5. 4% compared with the BP neural network model.

Content-Based Image Retrieval：Near Tolerance Rough Set Approach

The problem considered in this paper is how to detect the degree of similarity in the content of digital images useful in image retrieval,i.e.,to what extent is the content of a query image similar to content of other images.The solution to this problem results from the detection of subsets that are rough sets contained in covers of digital images determined by perceptual tolerance relations(PTRs).Such relations are defined within the context of perceptual representative spaces that hearken back to work by J.H.Poincare on representative spaces as models of physical continua.Classes determined by a PTR provide content useful in content-based image retrieval(CBIR).In addition,tolerance classes provide a means of determining when subsets of image covers are tolerance rough sets(TRSs).It is the nearness of TRSs present in image tolerance spaces that provide a promising approach to CBIR,especially in cases such as satellite images or aircraft identification where there are subtle differences between pairs of digital images,making it difficult to quantify the similarities between such images.The contribution of this article is the introduction of the nearness of tolerance rough sets as an effective means of measuring digital image similarities and,as a significant consequence,successfully carrying out CBIR.

基于Rough Set和神经网络的CBR快捷检索方法

检索是CBR中的关键技术,直接影响CBR的推理效率和质量,检索出的案例质量的好坏直接影响着案例重用与修改的难易,该文提出先用粗糙集约简理论去除冗余的案例决策表特征,再用BP神经网络模型来实现相似案例检索,这种检索方法不需要定义案例属性之间的相似度,检索速度快。

个性化决策规则的发现:一种基于Rough Set的方法

为发现用户真正感兴趣的决策规则,利用RS理论和方法设计了个性化决策规则发掘算法.算法分为两步:首先在属性约简中通过提出的理论尽可能去除用户不感兴趣的属性的方法来找出最佳约简;然后在属性值约简中进一步去除与用户无关的属性,从而抽取个性化决策规则.从理论上论证了算法的有效性,给出了实验分析,证实了算法的可行性.

基于RoughSets的图像分割法

介绍了粗集 (RoughSets)的一般概念和理论 ,并提出了一种基于粗集理论中不可分辨关系的图像分割方法 。

Improved Rough Set Algorithms for Optimal Attribute Reduct

Feature selection（FS） aims to determine a minimal feature（attribute） subset from a problem domain while retaining a suitably high accuracy in representing the original features. Rough set theory（RST） has been used as such a tool with much success. RST enables the discovery of data dependencies and the reduction of the number of attributes contained in a dataset using the data alone,requiring no additional information. This paper describes the fundamental ideas behind RST-based approaches,reviews related FS methods built on these ideas,and analyses more frequently used RST-based traditional FS algorithms such as Quickreduct algorithm,entropy based reduct algorithm,and relative reduct algorithm. It is found that some of the drawbacks in the existing algorithms and our proposed improved algorithms can overcome these drawbacks. The experimental analyses have been carried out in order to achieve the efficiency of the proposed algorithms.

优化的Rough Set综合评价算法在房地产开发和销售中的应用

将优化的Rough Set综合评价算法属性的同分辨能力数引入到粗糙集评价,增加了评价的客观性,优化了评价算法,对于房地产开发的决策和综合评价有辅助作用。

一种基于Rough Set的视频镜头检测方法

镜头检测是基于内容的视频检索的重要基础。视频文档具有数据量巨大,抽象程度低等特点,对其进行有效的存储、检索成为需要解决的迫切问题。根据MPEG编码的特点,提出了一种基于Rough Set的镜头检测方法。该方法能有效地区分镜头运动与渐变。实验表明,利用本文方法进行镜头检测能取得较好的效果。

FAULT DIAGNOSIS OF ROTATING MACHINERY USING KNOWLEDGE-BASED FUZZY NEURAL NETWORK

A novel knowledge-based fuzzy neural network （KBFNN） for fault diagnosis is presented. Crude rules were extracted and the corresponding dependent factors and antecedent coverage factors were calculated firstly from the diagnostic sample based on rough sets theory. Then the number of rules was used to construct partially the structure of a fuzzy neural network and those factors were implemented as initial weights, with fuzzy output parameters being optimized by genetic algorithm. Such fuzzy neural network was called KBFNN. This KBFNN was utilized to identify typical faults of rotating machinery. Diagnostic results show that it has those merits of shorter training time and higher right diagnostic level compared to general fuzzy neural networks.

基于加权实例推理的缓倾斜综采工作面液压支架选型研究

为实现地质构造简单的缓倾斜综采工作面液压支架智能化选型,提出了一种基于加权实例推理的液压支架选型方法。首先,建立了液压支架选型实例库;其次,采用粗糙集理论和序关系分析法进行权重构造;另外,将液压支架的条件属性分为3种类型计算相似度;最后通过匹配实例选型。以某煤矿选型方案为例,并以50组液压支架的属性数据进行验证。结果表明,该方法的准确率为88%,能够为液压支架的智能化选型提供较好的参考依据。

一种基于Rough集的知识库冗余性化简研究

专家系统知识库的冗余性是影响系统运行效率和知识库维护的一个重要方面。针对一个具体的专家系统——平面几何智能解题系统,分析了关于知识库规则生成时效率低的问题,采用基于粗糙集的化简方法,简化了系统的知识库,减少了知识库的冗余性,提高了系统的效率。

基于Fuzzy Rough集模型的汉语人称代词消解

指代消解是自然语言处理中重要的研究课题之一。结合基于实例的学习方法,提出了一种基于Fuzzy Rough集模型的中文人称代词消解方法。该方法的第一步过滤掉与人称代词性别和单复数特征不一致的名词短语,构成候选集,然后按照仅涉及浅层语义和语法知识的属性集对其中的每个名词短语进行标记。第二步利用Fuzzy Rough集模型中相关概念选择代表性较强的实例,并对其进行属性值约简,以提高这些实例的泛化能力。以上两步即为学习阶段。第三步即可根据这些实例判断新输入的名词短语是否为代词的先行语。该方法用人民日报语料进行了测试,测试结果表明该方法是有效的。

基于改进邻域粗糙集和优化BPNN的火灾预测算法

针对传统森林火灾检测算法精度低,以及大规模、多特征的火灾数据存在冗余信息等问题,该文提出了一种基于改进邻域粗糙集的优化反向传播神经网络(BPNN)火灾预测方法。首先,考虑到数据集具有高维特征空间和高度特征冗余等特点,设计出一种基于混沌反学习蝙蝠(BA)算法的邻域粗糙集特征选择算法,对火灾原始数据集进行特征寻优,得到约简属性子集;然后,构建BA算法优化的BPNN预测模型,将约简属性子集输入该模型中,得到火灾预测的结果;最后,通过平均分类准确度、F1值、精确度、曲线面积、召回率、平均误差率这6种评价指标,在UCI公开森林火灾数据集上分析和检验模型的分类性能。在2个数据集上的实验结果显示,基于混沌反学习策略的算法准确率为94.3%和52.7%,与邻域粗糙集结合后准确率达到98.1%和59.6%,证明了该文算法具备较高的检测精度。

一种基于Rough集的案例推理模型的构建

利用Rough集理论处理案例推理问题具有不需要外界信息和先验知识的优点,对案例库中冗余属性进行简化,能够起到优化案例库的作用,同时能够依赖于统计知识提炼规则并形成多个有效的案例索引,在进行案例检索时可针对不同的检索问题选择恰当的索引快速检索到相似的案例,并进行推理得出相应的问题解决方案。最后,以稀土萃取分离生产过程的产品纯度和料液处理量等生产指标的智能优化设定控制为例,验证了该模型的可行性和精确性。

基于Rough集的机器学习方法

对于机器学习,知识库的扩充一直是个热门话题,很多人对之投入了大量的精力从各个方面,用各种方法研究。从Rough集理论知识规则+经验的方法,引用第二次学习的概念,实行知识库的扩充。

基于双维压缩与综合活性的案例知识进化研究

知识作为企业价值创造的核心资源,其生命周期在加速缩短,导致知识低效、失效、冗余等问题日益突出,而知识进化可有效缓解前述问题,提升案例库质量、提高知识应用效用,因此,研究提出基于双维空间压缩与综合活性测度的案例知识进化方法。首先采用C4.5-NRS算法约简案例属性集,完成案例库纵向压缩,减少后续计算的工作量和冗余属性的影响;其次,基于改进K-means聚类横向压缩案例空间,并结合聚类中心信息熵圈定待进化案例簇;而后,基于时效活性、应用活性、稀缺活性、熵活性等指标,得到待进化案例知识的综合活性;最后,依据既定阈值确定待进化案例的进化操作。算例结果表明,进化后案例库的平均活性和运行效率均有明显提高。其中,对进化空间实施双维空间压缩,提高了计算效率;通过在保留和删除的二元化操作基础上增加更新、休眠操作,增强活性中等的案例的活性,确保案例库的存量与质量的协同发展。