回归分析在关联规则挖掘中的应用研究

支持度和置信度是关联规则挖掘中的重要指标,其选取对关联规则的挖掘过程和挖掘结果都有很大影响.本文介绍了回归分析方法及其在关联规则挖掘中的应用,建立了规则条数与支持度、置信度的关系模型,并验证了该方法的正确性与有效性.     

兴趣度在增量的关联规则挖掘中的研究

一般的关联规则发现算法使用的都是支持度、置信度框架.但是在增量的数据挖掘过程中,该类算法却需要不断改变支持度、置信度,使得算法本身效率下降,并缺乏可说服性,比如Apriori算法.为了解决该类问题,使用兴趣度框架对增量的数据进行了关联规则挖掘,比较了基于支持度、置信度框架的算法(如Apriori,FUP算法)和基于兴趣度的算法之间的优缺点.试验结果表明:兴趣度能够有效地筛选关联规则,在进行增量的数据挖掘的情况下得到的关联规则总是小于等于支持度、置信度(Aprori)算法挖掘出的规则.     

对最小置信度门限的置疑

在关联规则挖掘中,通常使用最小支持度和最小置信度两个门限来衡量一条规则是不是一个强规则。本文对最小置信度这个参数的实际意义,从理论和实践上进行了分析研究和探讨,发现使用最小置信度进行限制不仅所挖掘出的规则质量较低,还有可能遗漏一些具有重要价值的规则,进一步提出提升率比置信度更能反映实际情况,在关联规则挖掘中改用最小支持度和最小提升率作为衡量准则,其结论更加准确,意义也更明确。     

直觉模糊关联规则挖掘及算法研究

针对关联规则挖掘中连续属性离散化时的"尖锐边界"问题,提出了一种用直觉模糊集合理论来改进关联规则挖掘的方法,定义了直觉模糊非支持度和非置信度的概念,阐述了"支持度-非支持度-置信度-非置信度"的关联规则挖掘度量机制.描述了直觉模糊关联规则挖掘的基本原理和算法,并给出了算法的基本步骤,最后用实例验证了此算法的有效性.     

AR-Markov模型在动态关联规则挖掘中的应用

针对规则随着时间变化的特点,为规则建立元规则对其支持度和置信度变化趋势的分析和预测模型。通过增加支持度向量和置信度向量这两种规则评价指标,给出了动态关联规则元规则的形式化定义。利用自回归Markov模型对动态关联规则的元规则进行了挖掘,并通过实例证明了该方法的有效性。     

正相关性指导下的关联规则剪枝算法

基于支持度和置信度模型的关联规则剪枝算法会挖掘出很多无趣规则。针对该问题,提出一种正相关性指导下的关联规则剪枝算法。利用全置信度和提升度构造一个正相关性评价函数,以此对频繁项集进行剪枝。实验结果表明,该算法能减少无趣关联规则数量,提升挖掘结果质量,缩短挖掘时间。     

基于各类支持度阈值独立挖掘的关联改进算法

关联分类及较多的改进算法很难同时既具有较高的整体准确率又有较好的小类分类性能。针对此问题,提出了一种基于类支持度阈值独立挖掘的关联分类改进算法—ACCS。ACCS算法的主要特点是:(1)根据训练集中各类数量大小给出每个类类支持度阈值的设定方法,并基于各类的类支持度阈值独立挖掘该类的关联分类规则,尽量使小类生成更多高置信度的规则;(2)采用类支持度对置信度相同的规则排序,提高小类规则的优先级;(3)用综合考虑置信度和提升度的新的规则度量预测未知实例。在多个数据集上的实验结果表明,相比多种关联分类改进算法,ACCS算法有更高的整体分类准确率,且在不平衡数据上也能取得较好的小类分类性能。     

由规则归纳系统中发掘感兴趣模式

文章借助粗糙集理论，提出一种面向大型数据库的规则归纳方法；然后在评价规则的置信度和支持度的基础上，引入兴趣度准则进一步对规则进行评价，并介绍了两种针对不同问题的兴趣度指标，提出兴趣模板的概念来描述令人感兴趣的规则特征以强化用户的参与作用，提高系统效率。     

关联规则技术在教学评价中的应用

主要研究了基于知识发现的教学评价系统的开发过程,介绍了系统开发工具及关联规则挖掘等主要功能子模块的设计和实现.论文应用关联规则Apriori算法,对教学评价数据样本进行数据分析,使用数据库中用户交互数据记录,利用最小支持度和最小置信度,挖掘出频繁项集,从分析的结果中发现有价值的数据模式,寻找其中存在的关系和规则,为教育教学活动发挥指导作用,为教学管理提供合理、科学的决策支持,并且提出了对系统进一步的改进建议.     

基于多维关联规则兴趣度的问卷调查规则提取

基于能同时处理多个属性间关联关系的多维关联规则算法,对大学生社交网络行为习惯的调查问卷进行研究分析,发现依靠支持度和置信度的关联规则算法有时会产生误导性的结果。针对关联规则存在的这一问题,给出了带有负向的关联规则兴趣度的解决办法,并发现兴趣度规则中减少关联规则计算量的性质,可极大提高了多维关联规则兴趣度算法在规则提取中的效率。实验结果表明,负向的关联规则置信度强于正向的关联规则置信度,引入兴趣度的多维关联规则算法的准确度更高。     

遗传算法在关联规则挖掘中的应用

数据挖掘是关联规则中一个重要的研究方向。该文对关联规则的数据挖掘和遗传算法进行了概述,提出了一种改进型遗传算法的关联规则提取算法。最后结合实例给出了用遗传算法进行关联规则的挖掘方法。     

遗传算法在关联规则挖掘中的应用

数据挖掘是关联规则中一个重要的研究方向。该文对关联规则的数据挖掘和遗传算法进行了概述,提出了一种改进型遗传算法的关联规则提取算法。最后结合实例给出了用遗传算法进行关联规则的挖掘方法。     

基于项目属性的相联规则提取

相联规则是数据库知识发现领域的重要方法之一，用于发现满足用户指定最小支持度和最小信任度阈值的规则，其中，最小支持度阈值确定了研究数据集的规模，最小信任度阈值用来衡量一个规则可靠性，在通常的支持度／信任度框架下，用户只能给出一对最小支持度和最小信任度阈值，因此，对于有数据项均采用统一标准处理，但是，实际数据库中的数据项目具有自的特点，该文旨在根据项目的属性特征，通过模糊安全评判，决定项目合理的最小支持度阈值，进而确定各个项目的支持度区间，达到在一次数据挖掘中同时发现频繁规则和稀有规则的，由于基于最小信任度的规则提取具有冗余性，文中提出规则前件和后件的重要程度对比的思想，借助主观判断去除冗余规则，从而挖掘出尽可能接近自然的完全规则。     

ETARM: an efficient top-k association rule mining algorithm

Mining association rules plays an important role in data mining and knowledge discovery since it can reveal strong associations between items in databases. Nevertheless, an important problem with traditional association rule mining methods is that they can generate a huge amount of association rules depending on how parameters are set. However, users are often only interested in finding the strongest rules, and do not want to go through a large amount of rules or wait for these rules to be generated. To address those needs, algorithms have been proposed to mine the top-k association rules in databases, where users can directly set a parameter k to obtain the k most frequent rules. However, a major issue with these techniques is that they remain very costly in terms of execution time and memory. To address this issue, this paper presents a novel algorithm named ETARM (Efficient Top-k Association Rule Miner) to efficiently find the complete set of top-k association rules. The proposed algorithm integrates two novel candidate pruning properties to more effectively reduce the search space. These properties are applied during the candidate selection process to identify items that should not be used to expand a rule based on its confidence, to reduce the number of candidates. An extensive experimental evaluation on six standard benchmark datasets show that the proposed approach outperforms the state-of-the-art TopKRules algorithm both in terms of runtime and memory usage.     

数据挖掘在教学业绩考核中的应用研究

数据挖掘是致力于数据分析和理解、揭示数据内部潜在联系的技术,关联规则是数据挖掘中最活跃的研究方法之一。高校教学管理者从诸多方面对教师教学业绩进行考核,该文针对某高校教师教学业绩考核数据集,采用关联规则中的Apriori算法,挖出数据集中某些数据项之间的关联规则,通过对关联规则的分析找出它们之间隐藏的信息,为高校教学管理者提供决策支持,同时指导教师的教学。     

数据挖掘技术

数据挖掘技术是当前数据库和人工智能领域研究的热点课题,为了使人们对该领域现状有个概略了解,在消化大量文献资料的基础上,首先对数据挖掘技术的国内外总体研究情况进行了概略介绍,包括数据挖掘技术的产生背景、应用领域、分类及主要挖掘技术;结合作者的研究工作,对关联规则的挖掘、分类规则的挖掘、离群数据的挖掘及聚类分析作了 较详细的论述;介绍了关联规则挖掘的主要研究成果,同时指出了关联规则衡量标准的不足及其改进方法,提出了分类模式的准确度评估方法;最后,描述了数据挖掘技术在科学研究、金属投资、市场营销、保险业、制造业及通信网络管理等行业的应用情况,并对数据挖掘技术的应用前景作了展望。     

Domain-driven KDD for mining functionally novel rules and linking disjoint medical hypotheses

IntroductionAn important quality of association rules is novelty. However, evaluating rule novelty is AI-hard and has been a serious challenge for most data mining systems.ObjectiveIn this paper, we introduce functional novelty, a new non-pairwise approach to evaluating rule novelty. A functionally novel rule is interesting as it suggests previously unknown relations between user hypotheses.MethodsWe developed a novel domain-driven KDD framework for discovering functionally novel association rules. Association rules were mined from cardiovascular data sets. At post-processing, domain knowledge-compliant rules were discovered by applying semantic-based filtering based on UMLS ontology. Their knowledge compliance scores were computed against medical knowledge in Pubmed literature. A cardiologist explored possible relationships between several pairs of unknown hypotheses. The functional novelty of each rule was computed based on its likelihood to mediate these relationships.ResultsHighly interesting rules were successfully discovered. For instance, common rules such as diabetes mellitus?coronary arteriosclerosis was functionally novel as it mediated a rare association between von Willebrand factor and intracardiac thrombus.ConclusionThe proposed post-mining domain-driven rule evaluation technique and measures proved to be useful for estimating candidate functionally novel rules with the results validated by a cardiologist.     

PARM—An Efficient Algorithm to Mine Association Rules From Spatial Data

Association rule mining, originally proposed for market basket data, has potential applications in many areas. Spatial data, such as remote sensed imagery (RSI) data, is one of the promising application areas. Extracting interesting patterns and rules from spatial data sets, composed of images and associated ground data, can be of importance in precision agriculture, resource discovery, and other areas. However, in most cases, the sizes of the spatial data sets are too large to be mined in a reasonable amount of time using existing algorithms. In this paper, we propose an efficient approach to derive association rules from spatial data using Peano Count Tree (P-tree) structure. P-tree structure provides a lossless and compressed representation of spatial data. Based on P-trees, an efficient association rule mining algorithm PARM with fast support calculation and significant pruning techniques is introduced to improve the efficiency of the rule mining process. The P-tree based Association Rule Mining (PARM) algorithm is implemented and compared with FP-growth and Apriori algorithms. Experimental results showed that our algorithm is superior for association rule mining on RSI spatial data.      

Simple association rules (SAR) and the SAR-based rule discovery

Association rule mining is one of the most important fields in data mining and knowledge discovery in databases. Rules explosion is a problem of concern, as conventional mining algorithms often produce too many rules for decision makers to digest. Instead, this paper concentrates on a smaller set of rules, namely, a set of simple association rules each with its consequent containing only a single attribute. Such a rule set can be used to derive all other association rules, meaning that the original rule set based on conventional algorithms can be ‘recovered’ from the simple rules without any information loss. The number of simple rules is much less than the number of all rules. Moreover, corresponding algorithms are developed such that certain forms of rules (e.g. ‘P?’ or ‘?Q’) can be generated in a more efficient manner based on simple rules.     

基于图像分割的两阶段空间关联规则挖掘算法

关联规则挖掘可以深入发现空间数据间的感兴趣知识。空间数据格式多样、数据量大,现有的算法并不适合。本文以RSI及产量图为数据源,提出了基于图像分割的两阶段空间关联规则挖掘算法,挖掘图像像素颜色值之间的空间关联规则。通过算法分析和实验,该算法是有效、可行的。