基于模糊分类关联规则的分类系统

为了构建高性能的分类系统，应用模糊集软化数量型属性的划分边界，提出了模糊分类关联规则的挖掘算法。由于模糊集能很好地贴近人类的思维方式，因此挖掘得到的模糊分类关联规则易于被人理解．接着提出了基于模糊分类关联规则的分类系统，并采用遗传优化算法训练分类系统．实例分析的结果表明，基于模糊分类关联规则的分类系统具有较好的精度和可解释性．     

基于属性重要性的关联分类方法

提出了基于属性重要性的关联分类方法.与传统算法不同的是根据属性重要性程度生成类别关联规则;并且在构造分类器时改进了CBA算法中对于具有相同支持度、置信度规则选择时的随机性.实验结果证明,用该方法得到的分类规则与传统的关联分类算法相比,复杂度低,且有效提高了分类效果.     

Machine learning approach to model sport training

The aim of this study was to use a machine learning approach combining fuzzy modeling with an immune algorithm to model sport training, in particular swimming. A proposed algorithm mines the available data and delivers the results in a form of a set of fuzzy rules “IF (fuzzy conditions) THEN (class)”. Fuzzy logic is a powerful method to cope with continuous data, to overcome problem of overlapping class definitions, and to improve the rule comprehensibility. Sport training is modeled at the level of microcycle and training unit by 12 independent attributes. The data was collected in two months (February-March 2008), among swimmers from swimming sections in Wroc?aw, Poland. The swimmers had minimum of 7 years of training and reached the II class level in swimming classification from 2005 to 2008. The goal of the performed experiments was to find the rules answering the question - how does the training unit influence swimmer’s feelings while being in water the next day? The fuzzy rules were inferred for two different scales of the class to be predicted. The effectiveness of the learned set of rules reached 68.66%. The performance, in terms of classification accuracy, of the proposed approach was compared with traditional classifier schemes. The accuracy of the result of compared methods is significantly lower than the accuracy of fuzzy rules obtained by a method presented in this study (paired t-test, P < 0.05).     

A multi-objective genetic algorithm approach to rule mining for affective product design

A novel multi-objective genetic algorithm (GA)-based rule-mining method for affective product design is proposed to discover a set of rules relating design attributes with customer evaluation based on survey data. The proposed method can generate approximate rules to consider the ambiguity of customer assessments. The generated rules can be used to determine the lower and upper limits of the affective effect of design patterns. For a rule-mining problem, the proposed multi-objective GA approach could simultaneously consider the accuracy, comprehensibility, and definability of approximate rules. In addition, the proposed approach can deal with categorical attributes and quantitative attributes, and determine the interval of quantitative attributes. Categorical and quantitative attributes in affective product design should be considered because they are commonly used to define the design profile of a product. In this paper, a two-stage rule-mining approach is proposed to generate rules with a simple chromosome design in the first stage of rule mining. In the second stage of rule mining, entire rule sets are refined to determine solutions considering rule interaction. A case study on mobile phones is used to demonstrate and validate the performance of the proposed rule-mining method. The method can discover rule sets with good support and coverage rates from the survey data.     

关联规则对监控下行人属性识别影响的研究

针对监控视频下的行人多属性识别问题,提出一种结合神经网络与关联规则的多分类方法。首先通过Faster-RCNN检测算法与改进的AlexNet多分类网络得到监控视频下行人各个属性的置信度,再采用关联规则Apriori算法对训练数据进行处理,进而结合神经网络分类的置信度和关联规则的处理结果,提出一种对分类置信度进行优化的算法。最后,统计关联规则优化后的某些行人属性准确率。结果表明,将神经网络与关联规则有效结合后可以提升某些属性识别的准确率。     

一种挖掘数值属性的二维优化关联规则方法

优化关联规则允许在规则中包含未初始化的属性.优化过程就是确定对这些属性进行初始化,使得某些度量最大化.最大化兴趣度因子用来发现更加有趣的规则;另一方面,允许优化规则在前提和结果中各包含一个未初始化的数值属性.对那些处理一个数值属性的算法进行直接的扩展,可以得到一个发现这种优化规则的简单算法.然而这种方法的性能很差,因此,为了改善性能,提出一种启发式方法,它发现的是近似最优的规则.在人造数据集上的实验结果表明,当优化规则包含两个数值属性时,优化兴趣度因子得到的规则比优化可信度得到的规则更有趣.在真实数据集上的实验结果表明,该算法具有近似线性的可扩展性和较好的精度.     

一种集成数据挖掘的自动视频分类方法

针对自动视频分类工作中分类预测精度低的问题，提出了一种集成数据挖掘技术的自动视频分类方法。首先进行视频分割，形成了一个视频属性数据库；然后分别使用决策树、分类关联规则等技术对视频属性数据库进行数据挖掘，提取出决策树分类规则集和分类关联规则集；最后利用一个规则集的合并裁减算法来合并这两个分类预测规则集，形成最终的具有更高精度的视频分类规则集。通过实验验证了决策树分类预测规则和分类关联规则具有分类预测的一致性；同时实验表明，使用合并后的规则集比单独使用一个规则集来预测视频具有更高的预测准确率。     

基于阈值自适应忆阻器Hopfield神经网络的关联规则挖掘算法

针对基于Hopfield神经网络的最大频繁项集挖掘（HNNMFI）算法存在的挖掘结果不准确的问题,提出基于电流阈值自适应忆阻器（TEAM）模型的Hopfield神经网络的改进关联规则挖掘算法。首先,使用TEAM模型设计实现突触,利用阈值忆阻器的忆阻值随方波电压连续变化的能力来设定和更新突触权值,自适应关联规则挖掘算法的输入。其次,改进原算法的能量函数以对齐标准能量函数,并用忆阻值表示权值,放大权值和偏置。最后,设计由最大频繁项集生成关联规则的算法。使用10组大小在30以内的随机事务集进行1000次仿真实验,实验结果表明,与HNNMFI算法相比,所提算法在关联挖掘结果准确率上提高33.9个百分点以上,说明忆阻器能够有效提高Hopfield神经网络在关联规则挖掘中的结果准确率。     

Coastline extraction from SAR images using spatial fuzzy clustering and the active contour method

Coastline extraction from synthetic aperture radar (SAR) data is difficult because of the presence of speckle noise and strong signal returns from the wind-roughened and wave-modulated sea surface. High resolution and weather change independent of SAR data lead to better monitoring of coastal sea. Therefore, SAR coastline extraction has taken up much interest. The active contour method is an efficient algorithm for the edge detection task; however, applying this method to high-resolution images is time-consuming. The current article presents an efficient approach to extracting coastlines from high-resolution SAR images. First, fuzzy clustering with spatial constraints is applied to the input SAR image. This clustering method is robust for noise and shows good performance with noisy images. Next, binarization is carried out using Otsu’s method on the fuzzification results. Third, morphological filters are used on the binary image to eliminate spurious segments after binarization. To extract the coastline, an active contour level set method is used on the initial contours and is applied to the input SAR image to refine the segmentation. Because the proposed approach is based on an active contour model, it does not require preprocessing for SAR speckle reduction. Another advantage of the proposed method is the ability to extract the coastline at full resolution of the input SAR image without degrading the resolution. The proposed approach does not require manual initialization for the level set method and the proposed initialization speeds up the level set evolution. Experimental results on low- and high-resolution SAR images showed good performance for coastline extraction. A criterion based on neighbourhood pixels for the coastline is proposed for the quantitative expression of the accuracy of the method.     

图像纹理联合关联规则挖掘研究

提出以纹理联合关联规则来表达图像纹理特征以及挖掘纹理联合关联规则的算法。在纹理关联规则定义基础上,通过图像降噪预处理和数据挖掘预处理,采用模板统计挖掘方法挖掘低维和高维图像纹理联合关联规则。实验表明联合关联规则能够较好表达图像纹理特征,可以据此进行纹理分割。     

新型决策树构造方法

决策树是一种重要的数据挖掘工具,但构造最优决策树是一个NP-完全问题。提出了一种基于关联规则挖掘的决策树构造方法。首先定义了高可信度的近似精确规则,给出了挖掘这类规则的算法;在近似精确规则的基础上产生新的属性,并讨论了新生成属性的评价方法;然后利用新生成的属性和数据本身的属性共同构造决策树;实验结果表明新的决策树构造方法具有较高的精度。     

基于模糊分类关联规则的支持向量机分类器生成方法

为提高数据库分类系统的分类精度,提出一种新的分类方法。首先,利用模糊C-均值聚类算法对数据库中的连续属性进行离散化;然后,在此基础上提出一种改进的模糊关联算法挖掘分类关联规则;最后,通过计算规则和模式之间的兼容性指标来构造特征向量,构建支持向量机的分类器模型。实验结果表明,该方法具有较高的分类识别能力和分类效率。     

Reverse Engineering the Neural Networks for Rule Extraction in Classification Problems

Artificial neural networks often achieve high classification accuracy rates, but they are considered as black boxes due to their lack of explanation capability. This paper proposes the new rule extraction algorithm RxREN to overcome this drawback. In pedagogical approach the proposed algorithm extracts the rules from trained neural networks for datasets with mixed mode attributes. The algorithm relies on reverse engineering technique to prune the insignificant input neurons and to discover the technological principles of each significant input neuron of neural network in classification. The novelty of this algorithm lies in the simplicity of the extracted rules and conditions in rule are involving both discrete and continuous mode of attributes. Experimentation using six different real datasets namely iris, wbc, hepatitis, pid, ionosphere and creditg show that the proposed algorithm is quite efficient in extracting smallest set of rules with high classification accuracy than those generated by other neural network rule extraction methods.     

规则加权的文本关联分类

近年来,基于关联规则的文本分类方法受到普遍关注。虽然在一般情况下这种方法可获得较好的分类效果。但当样本特征词分布明显不均时,分类规则在各类别的分布也出现不均,从而导致分类准确率下降。本文设计和实现的基于规则权重调整的关联规则文本分类算法可有效地解决这一问题。该算法根据误分类训练样本的数量定义规则强度。对强规则通过乘以小于1 的调整因子降低其权重,而弱规则乘以大于1的调整因子提高其权重。实验结果表明经过规则权重的调整,分类质量显著提高。     

一种基于主属性判定的关联规则挖掘约简算法

关联规则挖掘是经典的数据挖掘方法,越来越多的企业都把它看作是必不可少的战略分析工具。当前关联规则挖掘方法得到的规则过多,令用户在运用时难以理解,因此研究关联规则集的约简方法具有应用价值。研究了数据库模式中关键字包含的主属性对基于Apriori算法的关联规则挖掘产生的关联规则的影响,即部分函数依赖会导致关联规则挖掘的数据集中冗余信息的频繁出现,并产生没有实际价值的关联规则,识别并消除这样的规则就能实现规则集的约简。求全部主属性如同求所有候选关键字问题都是NP难题,因此提出了一种基于一个候选关键字进行验证的算法来判定主属性,从而完成基于主属性判定的关联规则挖掘约简算法的设计与实现,并在最后的实验中验证了该算法的有效性。      

基于属性分辨度的最大相容块规则提取算法

提出一种基于属性分辨度的不完备决策表规则提取算法, 它是一种例化方向的方法. 首先从空集开始, 逐步 选择当前最重要的条件属性对对象集分类, 从广义决策值唯一的相容块提取确定规则, 从其他的相容块提取不确定 规则; 然后设计属性必要性判断步骤去除每条规则的冗余属性; 最后通过规则约简过程来简化所获得的规则, 增强规 则的泛化能力. 实验结果表明, 所提出的算法效率更高, 并且所获得的规则简洁有效.

     

基于排序的关联分类算法

提出了一种基于排序的关联分类算法.利用基于规则的分类方法中择优方法偏爱高精度规则的思想和考虑尽可能多的规则,改进了CBA(Classification Based on Associations)只根据少数几条覆盖训练集的规则构造分类器的片面性.首先采用关联规则挖掘算法产生后件为类标号的关联规则,然后根据长度、置信度、支持度和提升度等对规则进行排序,并在排序时删除对分类结果没有影响的规则.排序后的规则加上一个默认分类便构成最终的分类器.选用20个UCI公共数据集的实验结果表明,提出的算法比CBA具有更高的平均分类精度.     

Recursive neural network rule extraction for data with mixed attributes

In this paper, we present a recursive algorithm for extracting classification rules from feedforward neural networks (NNs) that have been trained on data sets having both discrete and continuous attributes. The novelty of this algorithm lies in the conditions of the extracted rules: the rule conditions involving discrete attributes are disjoint from those involving continuous attributes. The algorithm starts by first generating rules with discrete attributes only to explain the classification process of the NN. If the accuracy of a rule with only discrete attributes is not satisfactory, the algorithm refines this rule by recursively generating more rules with discrete attributes not already present in the rule condition, or by generating a hyperplane involving only the continuous attributes. We show that for three real-life credit scoring data sets, the algorithm generates rules that are not only more accurate but also more comprehensible than those generated by other NN rule extraction methods.     

关联规则的冗余删除与聚类

关联规则挖掘常常会产生大量的规则，这使得用户分析和利用这些规则变得十分困难，尤其是数据库中属性高度相关时，问题更为突出．为了帮助用户做探索式分析，可以采用各种技术来有效地减少规则数量，如约束性关联规则挖掘、对规则进行聚类或泛化等技术．本文提出一种关联规则冗余删除算法ADRR和一种关联规则聚类算法ACAR．根据集合具有的性质，证明在挖掘到的关联规则中存在大量可以删除的冗余规则，从而提出了算法ADRR；算法ACAR采用一种新的用项目间的相关性来定义规则间距离的方法，结合DBSCAN算法的思想对关联规则进行聚类．最后将本文提出的算法加以实现，实验结果表明该算法暑有数可行的．且具较高的效率。     

利用动态产品分类树改进的关联规则推荐方法

针对关联规则过于稀疏导致的弱关联规则问题,以及关联规则推荐存在的多样性匮乏等问题,提出基于Vague理论生成动态产品分类树,在分类树内实施关联规则挖掘以解决弱关联规则问题;在此基础上进一步提出一种基于产品相似性的多样性选择算法,并在推荐结果集内实施多样性选择以解决推荐多样性问题,实验评价结果表明该方法与传统推荐方法相比,无论在推荐精度还是推荐多样性上都更为有效。