摘要
详细分析了传统关联规则Apriori算法的不足,提出了一种改进的关联规则快速挖掘算法.该算法具有快速去掉冗余规则和不需查找频繁项等优点,适用于海量数据库的关联规则挖掘.针对当前高校招生录取后大量考生流失问题,使用该算法对某地区考生信息进行数理分析和仿真实验,挖掘了隐含的有用信息,为高校招生录取提供决策性的作用.
Based on analyzing the traditional association rules algorithm,an improved association rules Data Mining Algorithm is presented in this paper. The advantages of presented algorithm are fast removing redundant rules and not by the frequent items,so it is suitable for the massive data mining based on association rules. In view of the current large number of college students admitted after the loss of the candidates,some college enrollment data was mined based on the proposed algorithm. The results show that the proposed algorithm can mine useful information and play an important role in college enrolling affairs.
出处
《微电子学与计算机》
CSCD
北大核心
2010年第5期189-192,共4页
Microelectronics & Computer
基金
国家自然科学基金项目(60703035)
重庆市科委自然科学基金计划项目(CSTC2006BB2254)
重庆市教委项目(KJ061501
KJ071504)
关键词
数据挖掘
关联规则
招生录取
data mining
association rules
college enrollment
