基于粗糙集和神经网络理论的规则提取算法

提出了一种基于粗糙集和神经网络组合进行规则提取的方法。首先对初始数据集进行离散化,并利用粗糙集对决策表中的条件属性进行初步约简,然后利用神经网络对数据进行学习和预测,并通过删除网络不能分类的数据来对决策表中的噪声进行过滤,最后再由粗糙集值约简算法进行规则提取。实验表明,该方法相对于传统规则提取算法快速有效,在保留神经网络高鲁棒性的同时,避免了从神经网络中提取规则的困难。     

粗糙集规则匹配算法及其在文本分类中的应用

为提高中文文本分类的效果,提出了一种基于粗糙集理论的规则匹配方法.在对文本特征的提取过程中,对CHI统计方法进行了适当的改进,并对特征项的权值进行了缩放和离散化.结合区分矩阵实现关于粗糙集理论的属性约简和规则提取,并采用规则预检验的方法对规则匹配的决策参数进行优化,以提高中文文本分类的效果.实验结果表明改进后的规则匹配方法分类准确率更高,同时在训练数据较少的情况下也可以取得不错的效果.     

粗集理论在空中目标威胁等级判断中的应用

针对目标进行威胁等级判断时,由于获得的空中目标属性信息的不完全性和不确定性带来的决策困难问题,采用把粗糙集理论引入到空战决策系统中,根据空战冗余信息是可以约简的结论,提出了一种利用粗糙集理论约简求取规则的决策算法。应用SOM网络离散化决策系统输入数据的连续属性值,利用粗集数据分析方法,从数据中提取出规则将输入映射到输出的子空间。通过粗集数据挖掘后提取的规则,不仅规则数目减少,且规则是不完全规则,因此特别适合对空战信息的融合。     

一种基于Web用户不完备信息的规则获取方法研究

Web日志是一个很不完全且存在多样性特点的数据集,在获取决策规则的过程中经常会出现不一致、不完全规则的情况.提到了粗糙集理论,利用粗糙集理论在处理不完全知识上的特有优势来解决此种问题.首先把重要的用户行为特征值离散化作为属性值和值的约简,然后通过粗糙集缺省规则获取算法获得决策规则.其中条件属性的提取主要是一个对用户行为观察和分析的结果,而离散化处理方法就是应用粗糙集理论中的典型方法.这种处理方法有利于最后规则提取的进行,经过实例分析效果良好.     

一种基于CHI值特征选取的粗糙集文本分类规则抽取方法

结合文本分类规则抽取的特点,给出了近似规则的定义。该方法首先利用CHI值进行特征选取并为下一步特征选取提供特征重要性信息,然后使用粗糙集对离散决策表继续进行特征选取,最后用粗糙集抽取出精确规则或近似规则。该方法将CHI值特征选取和粗糙集理论充分结合,避免了用粗糙集对大规模决策表进行特征约简,同时避免了决策表的离散化。该方法提高了文本规则抽取的效率,并使其更趋实用化。实验结果表明了这种方法的有效性和实用性。     

基于GA与RST的分类规则挖掘算法

本文提出了在没有任何领域知识可供借鉴的情况下，利用遗传算法对信息系统的数量型属性进行离散化，利用RST进行分类规则挖掘，将GA与RST相结合进行分类规则挖掘的新算法。该算法不仅有效地解决了利用粗糙集理论进行分类规则挖掘时，数量型属性的离散化问题，而且可挖掘出通用的分类规则。     

粗糙集CMAC神经网络及其在非线性系统辩识中的应用

提出了一种基于粗糙集规则提取的CMAC神经网络非线性系统辩识策略。该策略利用粗糙集理论对数据样本进行数据浓缩，提取初步的映射规则。对初步的规则通过神经网络进行粗映射，利用神经网络的分类逼近能力，建立输入状态空间到输出空间的精确映射，大大提高了神经网络的收敛速度和逼近精度。通过一个非线性系统对该神经网络进行了实验，结果表明，该神经网络具有分类逼近能力强、计算量小等优点。     

基于最佳分类数和粗糙集的故障诊断方法

提出了一种基于最佳分类数和粗糙集理论的汽轮机轴系振动故障诊断方法。该方法利用模糊C均值聚类算法（FCM）把数据的连续属性离散化,以形成隶属度矩阵及属性分类数,根据隶属度矩阵及属性分类数进行划分系数和划分熵的有效性评判,最终找到连续属性的最佳分类数。然后根据最佳分类数对数据的连续属性进行实际的离散化,将离散化后形成的离散数据根据粗糙集理论,进行数据挖掘,得到诊断规则,有效提高了汽轮机轴系振动故障的诊断水平。     

基于时间序列相似搜索和粗糙集的数据挖掘研究

提出了一种能够对含有时间序列数据的数据库信息进行数据挖掘的方法。首先使用时间序列相似搜索方法对其中的时间序列数据进行模式发现，然后将时间序列数据转化为离散型数值，进一步使用粗糙集理论进行数据约简和规则提取。通过使用这种方法能够对含有时序数据的信息进行充分的挖掘并发现其中的规律。     

基于粗糙集的规则的挖掘

随着计算机技术的发展，急剧产生海量的数据。如何从这些数据中提取有用的信息是一个重要的问题。一种新的数据分析方法——粗糙集理论被提出。该理论在分类的意义下定义了模糊性和不确定性的概念，是一种处理不确定和不精确问题的新型数学工具。文中首先对近年兴起的粗糙集的基本理论进行了讨论，在此基础上运用粗糙集理论对从数据库中规则的挖掘方法进行了研究。并通过一个实例详细地说明了具体挖掘过程，该实例说明了基于粗糙集进行规则的挖掘是较简单的。     

一种用于机场气象预测的模糊神经网络模型

针对民用机场多因素气象预测问题的复杂性,该文构建出一种基于粗糙集的模糊神经网络模型。采用粗糙集理论约简属性,挖掘潜在规则,在此基础上建立模糊神经网络模型,并根据规则的统计性质和离散化结果初始化网络参数,采用BP算法训练网络。实例验证,该模型在收敛速度与预测精度上优于传统的神经网络模型。     

Data Mining via Discretization, Generalization and Rough Set Feature Selection

We present a data mining method which integrates discretization, generalization and rough set feature selection. Our method reduces the data horizontally and vertically. In the first phase, discretization and generalization are integrated. Numeric attributes are discretized into a few intervals. The primitive values of symbolic attributes are replaced by high level concepts and some obvious superfluous or irrelevant symbolic attributes are also eliminated. The horizontal reduction is done by merging identical tuples after substituting an attribute value by its higher level value in a pre- defined concept hierarchy for symbolic attributes, or the discretization of continuous (or numeric) attributes. This phase greatly decreases the number of tuples we consider further in the database(s). In the second phase, a novel context- sensitive feature merit measure is used to rank features, a subset of relevant attributes is chosen, based on rough set theory and the merit values of the features. A reduced table is obtained by removing those attributes which are not in the relevant attributes subset and the data set is further reduced vertically without changing the interdependence relationships between the classes and the attributes. Finally, the tuples in the reduced relation are transformed into different knowledge rules based on different knowledge discovery algorithms. Based on these principles, a prototype knowledge discovery system DBROUGH-II has been constructed by integrating discretization, generalization, rough set feature selection and a variety of data mining algorithms. Tests on a telecommunication customer data warehouse demonstrates that different kinds of knowledge rules, such as characteristic rules, discriminant rules, maximal generalized classification rules, and data evolution regularities, can be discovered efficiently and effectively.     

Rough set feature selection and rule induction for prediction of malignancy degree in brain glioma

The degree of malignancy in brain glioma is assessed based on magnetic resonance imaging (MRI) findings and clinical data before operation. These data contain irrelevant features, while uncertainties and missing values also exist. Rough set theory can deal with vagueness and uncertainty in data analysis, and can efficiently remove redundant information. In this paper, a rough set method is applied to predict the degree of malignancy. As feature selection can improve the classification accuracy effectively, rough set feature selection algorithms are employed to select features. The selected feature subsets are used to generate decision rules for the classification task. A rough set attribute reduction algorithm that employs a search method based on particle swarm optimization (PSO) is proposed in this paper and compared with other rough set reduction algorithms. Experimental results show that reducts found by the proposed algorithm are more efficient and can generate decision rules with better classification performance. The rough set rule-based method can achieve higher classification accuracy than other intelligent analysis methods such as neural networks, decision trees and a fuzzy rule extraction algorithm based on Fuzzy Min-Max Neural Networks (FRE-FMMNN). Moreover, the decision rules induced by rough set rule induction algorithm can reveal regular and interpretable patterns of the relations between glioma MRI features and the degree of malignancy, which are helpful for medical experts.     

Hybrid Classifier Based on Rough Sets and Neural Networks

In this paper the methods of objects classification based on rough set theory and artificial neural networks are presented. The results of the experiments based on a hybrid classifier using decision rules and neural network are discussed.     

An overview on rough neural networks

This paper is based on rough set theory and neural networks, and mainly introduces the previous researchers how to use rough set theory, which has the superior ability to rule out redundant, and neural networks, which has the self-organizing and self-learning ability to complement each other’s advantages, in order to obtain rough neural networks with better performance. This paper also details the possibility of the integration of these two theories and the current mainstream fusion method and then takes two more mainstream previous neural networks, back-propagation neural networks and radial basis function neural networks, as an example to integrate with rough set theory. This example describes the fusion method, fusion performance, and its corresponding learning algorithm after fusion in detail.     

基于粗糙集和神经网络集成的贷款风险5级分类

建立了粗糙集与神经网络集成的贷款风险5级分类评价模型,该模型首先利用自组织映射神经网络离散化财务数据并应用遗传算法约简评价指标;基于最小约简指标提取贷款风险5级分类判别规则以及对BP神经网络进行训练;最后使用粗糙集理论判别与规则库匹配的检验样本风险等级,使用神经网络判别不与规则库任何规则匹配的检验样本风险等级.利用贷款企业数据库698家5级分类样本进行实证研究,结果表明,粗糙集与神经网络集成的判别模型预测准确率达到82.07%,是一种有效的贷款风险5级分类评价工具.     

Rough sets for adapting wavelet neural networks as a new classifier system

Classification is an important theme in data mining. Rough sets and neural networks are two techniques applied to data mining problems. Wavelet neural networks have recently attracted great interest because of their advantages over conventional neural networks as they are universal approximations and achieve faster convergence. This paper presents a hybrid system to extract efficiently classification rules from decision table. The neurons of such hybrid network instantiate approximate reasoning knowledge gleaned from input data. The new model uses rough set theory to help in decreasing the computational effort needed for building the network structure by using what is called reduct algorithm and a rules set (knowledge) is generated from the decision table. By applying the wavelets, frequencies analysis, rough sets and dynamic scaling in connection with neural network, novel and reliable classifier architecture is obtained and its effectiveness is verified by the experiments comparing with traditional rough set and neural networks approaches.     

Discovering Maximal Generalized Decision Rules Through Horizontal and Vertical Data Reduction

We present a method to learn maximal generalized decision rules from databases by integrating discretization, generalization and rough set feature selection. Our method reduces the data horizontally and vertically. In the first phase, discretization and generalization are integrated and the numeric attributes are discretized into a few intervals. The primitive values of symbolic attributes are replaced by high level concepts and some obvious superfluous or irrelevant symbolic attributes are also eliminated. Horizontal reduction is accomplished by merging identical tuples after the substitution of an attribute value by its higher level value in a pre-defined concept hierarchy for symbolic attributes, or the discretization of continuous (or numeric) attributes. This phase greatly decreases the number of tuples in the database. In the second phase, a novel context-sensitive feature merit measure is used to rank the features, a subset of relevant attributes is chosen based on rough set theory and the merit values of the features. A reduced table is obtained by removing those attributes which are not in the relevant attributes subset and the data set is further reduced vertically without destroying the interdependence relationships between classes and the attributes. Then rough set-based value reduction is further performed on the reduced table and all redundant condition values are dropped. Finally, tuples in the reduced table are transformed into a set of maximal generalized decision rules. The experimental results on UCI data sets and a real market database demonstrate that our method can dramatically reduce the feature space and improve learning accuracy.     

粗糙集与模糊系统集成的化学模式分类方法及其应用

模糊方法是一种有效的化学模式分类方法,但模糊规则的获取和相关参数的确定较为困难。对此,本文采用粗糙集方法,无需任何先验知识,约简系统,获取最简规则集,在此基础上构建结构合理．适用于分类的模糊-神经网络系统,并根据规则的统计性质和离散化结果初始化网络参数,采用LM方法训练网络；在橄榄油模式分类建模的应用中,该方法训练收敛速度快,所建模型预测性能良好,要优于现代统计方法和前馈神经网络。