计算机科学 ›› 2008, Vol. 35 ›› Issue (7): 170-172.
• • 上一篇 下一篇
王勇 张伟
出版日期:
发布日期:
基金资助:
WANG Yong ZHANG Wei （Department of Computer and Modern Education Technology, Chongqing Education College, Chongqing 400067,China）
Online:
Published:
摘要： 传统的Apriori关联法则算法必须经过大量反复的数据库扫描才能产生候选项集，效率较低。提出一个改进的CBA（Classification Based Apriori）算法。此算法仅需扫描数据库一次，将数据库经过预处理后，再将事务数据库进行分类并保存分类结果，比较时可以不与所有事务记录进行比较，从而减少扫描数据库的次数与比较时间，且又能确保挖掘结果的完整性与正确性。
关键词: 数据挖掘 关联法则 分类
Abstract: Typical association rules algorithm contais weaknesses such as often requiring a large number of repeated passes over the database to generate the candidate item sets. In this paper,we present an improved method named CBA （Classification Based Apriori）. T
Key words: Data mining, Association rule,Classification
王勇 张伟. 一种基于分类的关联规则研究[J]. 计算机科学, 2008, 35(7): 170-172. https://doi.org/
WANG Yong ZHANG Wei （Department of Computer and Modern Education Technology, Chongqing Education College, Chongqing 400067,China）. [J]. Computer Science, 2008, 35(7): 170-172. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2008/V35/I7/170
Cited
首页