基于模糊粗糙集属性约简的人脸识别技术

提出了一种基于模糊粗糙集的属性约简方法,对经由PCA处理后的人脸特征进行提取,且使用一种神经网络集成的分类器对约简后的人脸数据进行识别.避免了粗糙集约简处理之前必需的离散化而造成的信息丢失,约简结果能更完整地反映原信息系统的分类能力,提高了识别精度.同时经遗传算法增强,降低了计算复杂性.     

粗糙集约简的WNN隐层节点优化方法

在确保网络性能的前提下,如何确定最佳隐层节点,获得最简网络结构是小波神经网络(WNN)应用推广的关键.对此,引入粗糙集理论,提出了基于信息熵的卡方离散化算法和启发式的属性约简递归算法,利用粗糙集约简过程对WNN隐层节点进行精简,并将其应用于飞行器气动力建模.仿真结果表明,采用改进的粗糙集方法设计WNN,不仅能够简化网络结构,而且与未经结构优化的WNN相比,其模型精度和训练速度都得到了实质性改善.     

信息增益混合邻域粗糙集的肺部肿瘤高维特征选择算法

针对冗余属性和不相关属性过多对肺部肿瘤诊断的影响以及Pawlak粗糙集只适合处理离散变量而导致原始信息大量丢失的问题,提出混合信息增益和邻域粗糙集的肺部肿瘤高维特征选择算法(Information gain-neighborhood rough set-support vector machine,IG-NRS-SVM)。该算法首先提取3 000例肺部肿瘤CT图像的104维特征构造决策信息表,借助信息增益结果选出高相关的特征子集,再通过邻域粗糙集剔除高冗余的属性,通过两次属性约简得到最优的特征子集,最后采用网格寻优算法优化的支持向量机构建分类识别模型进行肺部肿瘤良恶性的鉴别。从约简和分类识别两个角度验证方法的可行性与有效性,并与不约简算法、Pawlak粗糙集、信息增益和邻域粗糙集约简算法进行对比。结果表明混合算法精确度优于其他对比算法,精确度达到96.17%,并且有效降低了时间复杂度,对肺部肿瘤计算机辅助诊断具有一定的参考价值。     

基于粗糙集和灰关联理论的雷达辐射源信号识别研究

雷达辐射源信号通过射频、脉冲重复周期、脉宽、天线转速等属性来描述。然而这些属性并不是在每个雷达数据库中都对识别起作用,通过粗糙集理论对其属性进行约简和规则提取,并且确定各属性的权重。对于没有受污染或受污染程度较小的信号可以通过约简规则进行匹配识别,如果受污染程度较为严重或失真的信号或是由粗糙集约简得到多义的规则,则可以计算目标信号各属性与数据库中各信号各属性的灰关联度,并用粗糙集计算得到的各属性权重对各属性得到的关联系数进行加权求和,得到关联度最大者为识别结果。仿真结果表明,基于粗糙集和灰关联理论的雷达辐射源信号识别方法能够有效地缩减识别过程,得到满意的识别结果。     

粗糙集约简的神经网络遥感分类应用

近年来,随着人工神经网络系统理论的发展,神经网络技术日益成为遥感数字图像分类处理的有效手段。但是该方法不能降低维数、时间开销大,针对这些不足提出一种基于粗糙集约简的神经网络方法。本文对RapidEye影像进行分析并提取纹理特征,利用粗糙集理论对纹理特征与光谱特征属性进行约简,得到的约简属性作为输入属性,利用神经网络法对影像分类。结果表明该方法具有较好的分类精度。     

基于粗糙集-神经网络的入侵检测方法研究

提出了一种融合粗糙集与神经网络的入侵检测方法。首先用粗糙集约简属性、简化神经网络设计,然后通过神经网络进行入侵检测。实验结果表明该方法优于其他同类方法。     

基于关系数据库的粗糙集约简改进算法

以粗糙集约简和关系数据库为研究对象,提出了一种带有数据预处理和新启发式信息值的粗糙集约简改进算法.通过应用了该改进算法的DBRuduct工具进行实验,实验数据表明决策表的对象个数和约简计算时间之间成近似线性的关系;以Rosetta中的遗传算法求得的约简作为实验参照,该算法不但可以在含有不一致数据的情况下获得正确的核属性,而且还使约简算法求得的约简更加趋向于最小约简.     

基于粗糙集约简的神经网络集成及其遥感图像分类应用

为降低集成特征选择方法的计算复杂性,提出了一种基于粗糙集约简的神经网络集成分类方法。该方法首先通过结合遗传算法求约简和重采样技术的动态约简技术,获得稳定的、泛化能力较强的属性约简集;然后,基于不同约简设计BP网络作为待集成的基分类器,并依据选择性集成思想,通过一定的搜索策略,找到具有最佳泛化性能的集成网络;最后通过多数投票法实现神经网络集成分类。该方法在某地区Landsat 7波段遥感图像的分类实验中得到了验证,由于通过粗糙集约简,过滤掉了大量分类性能欠佳的特征子集,和传统的集成特征选择方法相比,该方法时     

基于粗糙集约简的神经网络集成及其遥感图像分类应用

为降低集成特征选择方法的计算复杂性,提出了一种基于粗糙集约简的神经网络集成分类方法。该方法首先通过结合遗传算法求约简和重采样技术的动态约简技术,获得稳定的、泛化能力较强的属性约简集;然后,基于不同约简设计BP网络作为待集成的基分类器,并依据选择性集成思想,通过一定的搜索策略,找到具有最佳泛化性能的集成网络;最后通过多数投票法实现神经网络集成分类。该方法在某地区Landsat 7波段遥感图像的分类实验中得到了验证,由于通过粗糙集约简,过滤掉了大量分类性能欠佳的特征子集,和传统的集成特征选择方法相比,该方法时间开销少,计算复杂性低,具有满意的分类性能。     

一种基于粗糙约简的分形几何容错故障诊断方法

针对故障诊断中计算量大,模式分类复杂的问题,提出了一种基于粗糙集的分形容错故障诊断方法。首先对可能的诊断属性用粗糙集约简的方法进行故障特征提取;然后计算所采集的故障数据的分形维数,并用回归辨识方法得到维数序列的数学模型;利用所建立的数学模型可完成对故障的分类和故障程度的辨识。仿真结果表明了该方法的有效性。该方法解决了单独利用分形几何方法无法对故障程度进行辨识的问题,简化了计算,并为高可靠性设备的故障诊断提供了新的思路。     

Three-way decision reduction in neighborhood systems

Rough set reduction has been used as an important preprocessing tool for pattern recognition, machine learning and data mining. As the classical Pawlak rough sets can just be used to evaluate categorical features, a neighborhood rough set model is introduced to deal with numerical data sets. Three-way decision theory proposed by Yao comes from Pawlak rough sets and probability rough sets for trading off different types of classification error in order to obtain a minimum cost ternary classifier. In this paper, we discuss reduction questions based on three-way decisions and neighborhood rough sets. First, the three-way decision reducts of positive region preservation, boundary region preservation and negative region preservation are introduced into the neighborhood rough set model. Second, three condition entropy measures are constructed based on three-way decision regions by considering variants of neighborhood classes. The monotonic principles of entropy measures are proved, from which we can obtain the heuristic reduction algorithms in neighborhood systems. Finally, the experimental results show that the three-way decision reduction approaches are effective feature selection techniques for addressing numerical data sets.     

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.     

Enhancing evolutionary instance selection algorithms by means of fuzzy rough set based feature selection

In recent years, fuzzy rough set theory has emerged as a suitable tool for performing feature selection. Fuzzy rough feature selection enables us to analyze the discernibility of the attributes, highlighting the most attractive features in the construction of classifiers. However, its results can be enhanced even more if other data reduction techniques, such as instance selection, are considered.In this work, a hybrid evolutionary algorithm for data reduction, using both instance and feature selection, is presented. A global process of instance selection, carried out by a steady-state genetic algorithm, is combined with a fuzzy rough set based feature selection process, which searches for the most interesting features to enhance both the evolutionary search process and the final preprocessed data set. The experimental study, the results of which have been contrasted through nonparametric statistical tests, shows that our proposal obtains high reduction rates on training sets which greatly enhance the behavior of the nearest neighbor classifier.     

基于信度区间的故障特征约简方法

多源信息融合故障诊断方法可以有效提高设备故障的确诊率,但同时需要使用由不同传感器获取的多种故障特征数据.此时若将所有特征的数据用于诊断,则计算量过大,诊断的实时性差.对此,将证据理论与粗糙集相结合,提出基于信度区间的属性约简定理及相应的故障特征(属性)约简方法,力图利用约简后的重要特征进行快速诊断.利用随机模糊变量和K均值对特征数据进行离散化处理,通过压缩二进制矩阵获取核属性,再将属性的信度区间大小作为迭代约简过程中属性的选取标准,向核属性中添加重要属性,最终获得属性约简结果.最后进行电机转子的特征融合诊断实验,通过与经典的粗糙集简约方法对比验证所提出方法的有效性.     

应用粗糙集提取柴油机故障数据特征

根据柴油机故障数据的特点,采用粗糙集理论对其进行特征提取研究。由于实际测量的参数大多为连续数据,而粗糙集只能处理离散数据,提出了一种适用于粗糙集的SOM网络离散化方法;给出一种基于简化差别矩阵的快速属性约简算法;以6135D型柴油机故障诊断数据为例进行特征提取,成功地将原始8个属性约简为3个,为后续研究工作打下了基础。     

数据挖掘中基于Rough Set方法研究

随着数据挖掘的兴起,有许多分类和预测的方法。数据挖掘研究的实旌对象多为关系型数据库,这给粗糙集方法的应用带来了极大的方便。关系表可被看作为粗糙集理论中的决策表,而利用粗糙集理论来处理数据挖掘有着传统挖掘工具所不具有的优点。粗糙集理论是一种处理不确定和不精确问题的数学工具,文中通过实例介绍了粗糙集的基本理论,并通过实例详细介绍了在基于对决策表属性约简的基础上采用了可变精度粗糙模型实现规则的获取。该实例说明了对于不完备的信息系统,应用粗糙集理论进行数据挖掘是非常有效的。     

An efficient accelerator for attribute reduction from incomplete data in rough set framework

Feature selection (attribute reduction) from large-scale incomplete data is a challenging problem in areas such as pattern recognition, machine learning and data mining. In rough set theory, feature selection from incomplete data aims to retain the discriminatory power of original features. To address this issue, many feature selection algorithms have been proposed, however, these algorithms are often computationally time-consuming. To overcome this shortcoming, we introduce in this paper a theoretic framework based on rough set theory, which is called positive approximation and can be used to accelerate a heuristic process for feature selection from incomplete data. As an application of the proposed accelerator, a general feature selection algorithm is designed. By integrating the accelerator into a heuristic algorithm, we obtain several modified representative heuristic feature selection algorithms in rough set theory. Experiments show that these modified algorithms outperform their original counterparts. It is worth noting that the performance of the modified algorithms becomes more visible when dealing with larger data sets.     

A Distance Measure Approach to Exploring the Rough Set Boundary Region for Attribute Reduction

Feature Selection (FS) or Attribute Reduction techniques are employed for dimensionality reduction and aim to select a subset of the original features of a data set which are rich in the most useful information. The benefits of employing FS techniques include improved data visualization and transparency, a reduction in training and utilization times and potentially, improved prediction performance. Many approaches based on rough set theory up to now, have employed the dependency function, which is based on lower approximations as an evaluation step in the FS process. However, by examining only that information which is considered to be certain and ignoring the boundary region, or region of uncertainty, much useful information is lost. This paper examines a rough set FS technique which uses the information gathered from both the lower approximation dependency value and a distance metric which considers the number of objects in the boundary region and the distance of those objects from the lower approximation. The use of this measure in rough set feature selection can result in smaller subset sizes than those obtained using the dependency function alone. This demonstrates that there is much valuable information to be extracted from the boundary region. Experimental results are presented for both crisp and real-valued data and compared with two other FS techniques in terms of subset size, runtimes, and classification accuracy.     

基于信息熵的粗糙集属性应急数据去重挖掘算法研究

粗糙集属性应急数据存在冗余特征,降低挖掘效率,提出基于信息熵的粗糙集属性应急数据去重挖掘算法.将粗糙集理论和信息熵相结合,离散化处理应急数据,离散化完成后,约简对于决策表的条件信息熵大小不产生任何影响的属性,设定决策属性集合和条件属性集合,选取将同约简属性集合B的属性组合数目最小的熵值实现约简,去除冗余特征,完成应急数据去重挖掘.以大型船舶应急数据为研究对象展开数据去重挖掘,结果表明:可有效去重挖掘到船舶旋回性相关应急数据,利用数据增比特征能够分析到各因素对船舶旋回性的影响,并且所研究算法的挖掘效率较高,在数据量为1400条时,耗时仅为0.33 s.     

Positive approximation: An accelerator for attribute reduction in rough set theory

Feature selection is a challenging problem in areas such as pattern recognition, machine learning and data mining. Considering a consistency measure introduced in rough set theory, the problem of feature selection, also called attribute reduction, aims to retain the discriminatory power of original features. Many heuristic attribute reduction algorithms have been proposed however, quite often, these methods are computationally time-consuming. To overcome this shortcoming, we introduce a theoretic framework based on rough set theory, called positive approximation, which can be used to accelerate a heuristic process of attribute reduction. Based on the proposed accelerator, a general attribute reduction algorithm is designed. Through the use of the accelerator, several representative heuristic attribute reduction algorithms in rough set theory have been enhanced. Note that each of the modified algorithms can choose the same attribute reduct as its original version, and hence possesses the same classification accuracy. Experiments show that these modified algorithms outperform their original counterparts. It is worth noting that the performance of the modified algorithms becomes more visible when dealing with larger data sets.