面向属性的决策规则挖掘算法的研究与应用

粗集理论是一种新型处理模糊和不确定知识的数学工具,其中属性约简是它的核心内容。粗集理论的主要思想是在保持分类能力不变的前提下,通过属性约简,导出问题的决策或分类规则。深入研究粗集理论,在属性约简过程中加入了启发式信息,大大提高了挖掘效率,得出了一种新的决策规则挖掘算法。实例分析表明,该算法能够发现良好的决策规则。     

基于扩展贝叶斯分类算法的网络安全状态在线定量评价

准确了解计算机网络的安全状态非常重要,大多数计算机网络安全评估系统都无法对数据进行彻底地分析,这成为获取计算机网络安全状态的瓶颈。针对这一问题,提出了一种基于扩展贝叶斯分类算法的计算机网络安全评估规则的算法模型,研究了计算机网络安全评估的扩展贝叶斯分类知识系统描述,给出了扩展贝叶斯分类属性约简的方法,通过简化的网络安全评估数据集验证了提出的决策规则挖掘方法。实验结果表明,该网络安全评估方法是可行、有效的,获得的决策规则符合实际。     

基于关联规则数据挖掘技术的电网故障诊断

在实际的电网故障诊断中,面临如何从海量数据找到真正对于诊断结果有帮助的关键数据以及当故障信息存在不完整或不确定性,甚至关键信息丢失时,会导致故障诊断难以得出正确结论的问题。针对此问题,将关联规则数据挖掘DLG(Direct Large temsests Generation）算法引入到电网故障诊断中。首先以保护、断路器作为条件属性,故障区域作为决策属性,考察各种故障情况并建立原始决策表,然后利用关联规则挖掘进行属性约简,通过修改阈值进行交互式挖掘,直接提取最佳属性约简组合,然后利用最佳属性约简组合形成的约简决策表和关联规则交互式挖掘,针对各种情况的故障信息进行诊断推理。运用C编写了基于该方法的故障诊断软件, 采用四母线配电网系统作为仿真对象,算例结果表明该算法在一定电网规模和保护动作信息不完备的情况下,故障诊断正确性高、容错性好,实用性强。     

基于关联规则数据挖掘技术的电网故障诊断

在实际的电网故障诊断中,面临如何从海量数据找到真正对于诊断结果有帮助的关键数据以及当故障信息存在不完整或不确定性,甚至关键信息丢失时,会导致故障诊断难以得出正确结论的问题.针对此问题,将关联规则数据挖掘DLG(Direct Large temsests Generation)算法引入到电网故障诊断中.首先以保护、断路器作为条件属性,故障区域作为决策属性,考察各种故障情况并建立原始决策表,然后利用关联规则挖掘进行属性约简,通过修改阈值进行交互式挖掘,直接提取最佳属性约简组合,然后利用最佳属性约简组合形成的约简决策表和关联规则交互式挖掘,针对各种情况的故障信息进行诊断推理.运用C编写了基于该方法的故障诊断软件, 采用四母线配电网系统作为仿真对象,算例结果表明该算法在一定电网规模和保护动作信息不完备的情况下,故障诊断正确性高、容错性好,实用性强.     

历史数据驱动下基于粗糙集的AVC系统关键参数挖掘方法

自动电压控制(AVC)系统中的参数设置过程繁琐且设置结果无依据,以历史大数据为基础,通过对历史数据的挖掘指导系统关键参数的设置。首先,给出一种基于强化正域的属性综合约简策略对关联属性进行约简;然后,采用基于最优分类的属性变换策略将连续属性离散化,并给出一种基于数据预处理的集合近似匹配策略,用于计算不同曲线间的相似度;最后,提出一种基于粗糙集的AVC系统关键参数辨识框架,对历史大数据进行挖掘。基于真实电网数据进行算例分析,挖掘结果表明所提辨识框架能自动给出合理的参数设置结果;实际应用结果表明,相比于传统方法,基于历史大数据的挖掘结果取得了更好的控制效果。     

基于粗糙集约简技术的输电线路运行风险评估

知识约简是粗糙集理论中获取决策规则的重要方式。结合知识约简的概念和定义,介绍了Semi- Naive-Scaler属性离散化算法,给出了基于可辨识矩阵的属性约简算法,并采用了基于可辨识矩阵的二值化数据过滤和贪心算法相结合的规则约简算法。通过属性约简和规则约简,得出决策规则。最后在输电线路运行风险评估方面给出了应用算例。     

基于粗糙集和小生境遗传算法的电网故障诊断规则提取

用粗糙集理论进行电网的故障诊断,关键是对知识表的约简.本文以粗糙集理论中的决策表为主要工具,首先将继电保护和断路器的动作信号作为对故障分类的条件属性集,故障区域作为对故障分类的决策属性,建立决策表,然后利用小生境遗传算法适合于进行多峰值函数优化的特点,提出了一种基于小生境遗传算法的粗糙集属性约简方法,用于求解决策表的多个约简,进而进行值约简后抽取出诊断规则.算例结果说明了本算法的正确性和可行性.     

基于粗糙集约简技术的输电线路运行风险评估

知识约简是粗糙集理论中获取决策规则的重要方式.结合知识约简的概念和定义,介绍了Semi- Naive-Scaler属性离散化算法,给出了基于可辨识矩阵的属性约简算法,并采用了基于可辨识矩阵的二值化数据过滤和贪心算法相结合的规则约简算法.通过属性约简和规则约简,得出决策规则.最后在输电线路运行风险评估方面给出了应用算例.     

基于粗糙集理论的变压器故障诊断方法

将一种基于粗糙集理论的信息熵约简方法应用于变压器故障诊断问题中。首先应用粗糙集理论将电力变压器故障历史数据进行分析统计,建立决策表,然后采用信息熵约简算法对其进行条件属性约简,求取一组最小约简知识系统,并采用粗糙集约简方法对新系统进行简化,得到一组故障诊断的最小决策规则集。方法大大减小了编码的工作量,避免了约简属性组合查询及缺少关键属性时规则匹配所带来的不便,所以运算速度也会相对加快。最后结合实例分析,证明该方法的简便及有效性。     

变压器故障诊断的粗集决策新方法

通过分析DGA新导则在实际应用存在的问题,将粗集理论与DGA相结合,提出变压器故障诊断的粗集决策方法。在保证离散化结果性能要求的前提下,使用改进的贪心算法进行连续属性的离散化。最后通过规则提取,得到变压器故障类型的决策规则,结果表明方法是有较高的准确率。     

基于粗糙集理论的输电线路状态评估

提出一种基于粗糙集理论的输电线路状态评估方法。利用粗糙集理论建立决策表,采用基于可辨识矩阵的属性约简算法对决策表进行约简,得到决策规则,并研究了条件属性的重要度,最后给出实例验证。结果表明,该方法能够有效地约简规则,评估结果合理。     

融合粗糙集和模糊聚类的连续数据知识发现

知识自动获取是困扰基于知识的系统普遍推广应用的瓶颈，粗糙集理论是一种从历史数据中发现规则知识的数学工具。该文针对粗糙集方法应用于电厂与电力系统数据挖掘中存在的连续属性离散化问题，提出了基于模糊聚类的离散化方法。采用模糊C平均(FCM)算法离散连续属性，获得各类的聚类中心以及属性值隶属于各聚类中心的隶属度矩阵，得到离散化的数据。将粗糙集方法应用于离散化后的数据挖掘隐含在历史数据中的知识。最后进一步讨论了置信度、支持度等指标对规则的评价方法。给出的汽轮机轴系振动故障诊断规则获取算例验证了整个知识发现方案的可行性。     

Acquisition of optimal attribute subset through genetic algorithm using GNP‐based class association rule mining

Attribute selection is a technique to prune less relevant information and discover high‐quality knowledge. It is especially useful for the classification of a large database, because the preprocessing of data increases the possibility that predictor attributes given to the mining algorithm become more relevant to the class attribute. In this paper, a method to acquire the optimal attribute subset for the genetic network programming (GNP) based class association rule mining has been proposed, and this attribute selection process using genetic algorithm (GA) leads to a higher accuracy for classification. Class association rule mining through GNP is conducted with a small subset of data rather than the original large number of attributes; thus simple but important rules are obtained for classification while the local optimal problem is avoided. Simulation results with educational data show that the classification accuracy is largely improved from 52.73 to 74.54%, when classification is made using the optimal attribute subset. © 2014 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.     

基于信息熵最优约简算法的电网故障诊断模型

介绍粗糙集理论及信息熵约简方法,应用粗糙集理论对电网故障样本数据进行分析统计,建立决策表,采用信息熵约简算法对其进行条件属性约简,得到一组最小知识系统,再用粗糙集值约简方法对其进行简化,得到一组故障诊断的最小决策规则集,结合模型进行分析,证明该方法简便、快速、有效。     

基于粗糙集与模糊规则的变压器故障诊断方法

引入了一种基于粗糙集约简并结合模糊规则的方法进行变压器故障诊断。该方法从变压器故障判别表出发,首先使用粗糙集理论进行决策表约简,在保持故障判别表分类能力不变的条件下,去除了变压器故障诊断知识中大量的冗余特征,然后结合模糊集合理论和模糊推理,计算出各个约简后的决策规则的模糊隶属度,最终得到故障类型的判断。实例表明,本方法可以有效地进行模糊推理并得到正确的诊断结果。     

Parallel mining and application of fuzzy association rules

Quantitative attributes are partitioned into several fuzzy sets by using fuzzy c-means algorithm. Fuzzy c-means algorithm can embody the actual distribution of the data, and fuzzy sets can soften the partition boundary. Then, we improve the search technology of apriori algorithm and present the algorithm for mining fuzzy association rules. As the database size becomes larger and larger, a better way is to mine fuzzy association rules in parallel. In the parallel mining algorithm, quantitative attributes are partitioned into several fuzzy sets by using parallel fuzzy c-means algorithm. Boolean parallel algorithm is improved to discover frequent fuzzy attribute set, and the fuzzy association rules with at least a minimum confidence are generated on all processors. The experiment results implemented on the distributed linked PC/workstation show that the parallel mining algorithm has fine scaleup, sizeup and speedup. Last, we discuss the application of fuzzy association rules in the classification. The example shows that the accuracy of classification systems of the fuzzy association rules is better than that of the two popular classification methods: C4.5 and CBA. __________ Translated from Journal of Southeast University (Natural Science Edition), 2005, 35(2): 165–170 (in Chinese)     

Evolutionary selection of interesting class association rules using genetic relation algorithm

During the last years, several association rule‐based classification methods have been proposed, these algorithms may quickly generate accurate rules. However, the generated rules are often very large in terms of the number of rules and usually complex and hardly understandable for users. Among all the rules generated by the algorithms, only some of them are likely to be of any interest to the domain expert analyzing the data. Most of the rules are either redundant, irrelevant or obvious. In this paper, a new method for selecting the interesting class association rules is proposed by an evolutionary method named genetic relation algorithm. The algorithm evaluates the relevance and interestingness of the discovered association rules by the relationships between the rules in each generation using a specific measure of distance among them giving a reduced set of rules as the result in the final generation. This small rule set has the following properties: (i) accurate as it has at least the same classification accuracy as the complete association rule set, (ii) interesting because of the diversity of rules and (iii) comprehensible because it is more understandable for the users as the number of attributes involved in the rules is also small. The efficiency of the proposed method is compared with other conventional methods including genetic network programming‐based mining using ten databases and the experimental results show that it outperforms others keeping a good balance between the classification accuracy and the comprehensibility of the rules. © 2011 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.