基于关联规则挖掘算法的改进研究

数据挖掘应用极大地推动了人们掌握、处理信息的能力.文章主要介绍了数据挖掘中的关联规则,关联规则中的经典算法Apriori算法,以及Apriori算法存在的不足,提出了Apriori算法的改进研究.     

基于web数据挖掘的Apriori算法及其优化算法研究

从数据挖掘中的关联规则概念入手,介绍了关联规则挖掘中的核心算法Apriori实现过程,针对出现的瓶颈又介绍了几种Apriori算法的优化方法,最后指出了末来关联规则挖掘算法的研究方向．     

基于关联规则算法的研究

本文主要介绍了数据挖掘中的关联规则，分析了关联规则中的主要算法，包括Apriori算法、FP-Growth算法以及CRApriori算法，并且阐述了各种算法的主要特点。     

基于关联规则的数据挖掘研究

本文介绍了关联规则的概念,并通过一个例子说明了关联规则挖掘的一种算法－－Apriori算法,指出了数据挖掘未来研究的重点和方向。     

基于关联挖掘技术的图书馆个性化信息服务

阐述了图书馆个性化信息服务以及关联规则数据挖掘技术,介绍了基于Apriori算法的数据挖掘实例。     

关联规则挖掘的Apriori算法综述

关联规则挖掘是数据挖掘研究领域中的一个重要任务,旨在挖掘事务数据库中有意义的关联。随着大量数据不停的收集和存储,从数据库中挖掘关联规则显得越来越有必要性,关联规则挖掘的Apriori算法是数据库挖掘的最经典算法并得到广泛应用,在介绍关联规则挖掘和Apriori算法的基础上,发现Apriori算法存在着产生候选项目集效率低和频繁扫描数据等缺点。综述了Apriori算法的主要优化方法,并指出了Apriori算法在实际中的应用领域,提出了未来Apriori算法的研究方向和应用发展趋势。     

关联规则挖掘研究

关联规则是数据挖掘中一个重要的研究内容。典型的关联规则算法是由R.Agrawal等提出的Apriori算法。本文对Apriori算法进行了分析,指出了挖掘中的关键步骤,并给出了算法改进技术。     

关联规则挖掘算法初探

本文根据Apriori算法的不足,提出了一种针对关系数据库关联规则挖掘的Apriori改进算法,用以提高数据挖掘的效率。     

关联规则的哈希修剪算法研究

关联规则是数据挖掘的一个基本方法,本文首先介绍传统的Apriori算法的过程,分析它在处理大数据集时存在的问题.提出关联规则的一种改进算法,称为哈希修剪算法.然后比较改进的算法与传统的Apriori算法在算法时间复杂度、性能上的差异.通过实验得出,哈希修剪算法在数据挖掘中能够更加有效的处理数据.     

基于关联规则算法的教务管理数据挖掘

本文首先介绍了关联规则数据挖掘的概念,分析了关联规则挖掘的核心算法Apriori,将该算法用于教务管理数据的分析处理,得出数据集中隐含的模式,以期对学校教务管理者提供决策支持。     

一种新的基于幂集的数据挖掘算法

Apriori算法是经典的关联规则挖掘算法,主要缺点是可能产生大量的候选集和需要多次扫描数据库.从幂集运算的角度提出了一种新的关联规则挖掘算法P_DM算法,实现了只需要扫描一次数据库就产生所有频繁集.实验证明这种算法在中小规模数据挖掘上效率优于Apriori算法.     

Apriori_Q:关联规则的有效求解

通过对Apriori算法的分析，提出了一种关联规则挖掘的改进算法Apriori_Q。该改进算法减少了模式匹配和对数据库访问的次数，理论分析与实验结果表明，Apriori_Q提高了关联规则生成的效率，因而更具有实用价值。     

挖掘关联规则Apriori算法的一种改进

本研究在对Apriori算法分析的基础上,提出了改进的Apriori算法。改进后的算法采用矩阵表示数据库,减少了扫描事物数据库的次数;利用向量运算来实现频繁项集的计数,同时及时地去掉不必要的数据,减少了数据运算,从而提高了算法的运行效率。     

Research on spatial association rules mining in two direction

In data mining from transaction DB, the relationships between the attributes have been focused, but the relationships between the tuples have not been taken into account. In spatial database, there are relationships between the attributes and the tuples, and most of the associations occur between the tuples, such as adjacent, intersection, overlap and other topological relationships. So the tasks of spatial data association rules mining include mining the relationships between attributes of spatial objects, which are called as vertical direction DM, and the relationships between the tuples, which are called as horizontal direction DM. This paper analyzes the storage models of spatial data, uses for reference the technologies of data mining in transaction DB, defines the spatial data association rule, including vertical direction association rule, horizontal direction association rule and twodirection association rule, discusses the measurement of spatial association rule interestingness, and puts forward the work flows of spatial association rule data mining. During twodirection spatial association rules mining, an algorithm is proposed to get nonspatial itemsets. By virtue of spatial analysis, the spatial relations were transferred into nonspatial associations and the nonspatial itemsets were gotten. Based on the nonspatial itemsets, the Apriori algorithm or other algorithms could be used to get the frequent itemsets and then the spatial association rules come into being. Using spatial DB, the spatial association rules were gotten to validate the algorithm, and the test results show that this algorithm is efficient and can mine the interesting spatial rules.     

Research on spatial association rules mining in two-direction

In data mining from transaction DB, the relationships between the attributes have been focused, but the relationships between the tuples have not been taken into account. In spatial database, there are relationships between the attributes and the tuples, and most of the associations occur between the tuples, such as adjacent, intersection, overlap and other topological relationships. So the tasks of spatial data association rules mining include mining the relationships between attributes of spatial objects, which are called as vertical direction DM, and the relationships between the tuples, which are called as horizontal direction DM. This paper analyzes the storage models of spatial data, uses for reference the technologies of data mining in transaction DB, defines the spatial data association rule, including vertical direction association rule, horizontal direction association rule and two-direction association rule, discusses the measurement of spatial association rule interestingness, and puts forward the work flows of spatial association rule data mining. During two-direction spatial association rules mining, an algorithm is proposed to get non-spatial itemsets. By virtue of spatial analysis, the spatial relations were transferred into non-spatial associations and the non-spatial itemsets were gotten. Based on the non-spatial itemsets, the Apriori algorithm or other algorithms could be used to get the frequent itemsets and then the spatial association rules come into being. Using spatial DB, the spatial association rules were gotten to validate the algorithm, and the test results show that this algorithm is efficient and can mine the interesting spatial rules.     

基于数据挖掘技术的SP企业广告策略

神经网络与关联规则是两种重要的数据挖掘技术。介绍了数据挖掘中神经网络、关联规则的常用算法,最后以某SP公司的实际群发记录为例,运用BP神经网络方法与关联规则的Apriori算法挖掘出隐藏在数据背后有用的强规则,说明了数据挖掘对SP广告宣传策略的制定具有一定的决策支持意义。     

基于定量关联规则树的分类及回归预测算法

为了解决基于Apriori的分类关联规则算法挖掘数值型数据时效率和准确率偏低的问题,提出基于定量关联规则树的分类及回归预测算法。采用改进的定量关联规则算法挖掘数值型数据生成关联规则库,并基于关联规则树结构实现分类及回归预测。研究结果表明：改进的Apriori定量关联规则挖掘算法提高了分类预测的准确率并降低了计算复杂度;而采用关联规则树结构可使分类与回归预测时间明显加快,提高了样本匹配学习的速度。