摘要
关联规则是数据挖掘的主要技术之一,它是描述数据库中一组数据项之间的某种潜在关系的规则。关联规则挖掘算法——Apriori算法,主要过程是对频繁项集的挖掘,而在对频繁项集的挖掘中首先要生成候选频繁项集,然后再从候选集中确定出满足最小支持度计数的频繁项集,这会耗费大量的CPU开销。使用垂直数据格式挖掘频繁项集可避免候选项目集的求解。
Association Rule is one of the key technologies of data mining. It describes the potential relations of a group of data items in database. Connection rule excavation algorithm - Apriori algorithm, The main process is to extract the frequent itemsets, however in the frequent item set＇s excavation must be first produce the candidate frequent itemsets, Then determined again from the candidate frequent itemsets satisfies the smallest support counting the frequent itemsets, This will consume the massive cpu expenses. Used the vertical data format excavation frequent itemsets to avoid the candidate itemsets solution.
出处
《微型机与应用》
2011年第18期6-7,13,共3页
Microcomputer & Its Applications
