计算机工程 ›› 2012, Vol. 38 ›› Issue (2): 75-77.doi: 10.3969/j.issn.1000-3428.2012.02.024

• 软件技术与数据库 • 上一篇    下一篇

改进关联规则算法在高校教学管理中的应用

张宗郁 1,2,张亚平 1,张静远 1,张晓君 3   

  1. (1. 天津大学计算机科学与技术学院,天津 300072;2. 西藏大学农牧学院,西藏 林芝 860000;3. 天津理工大学中环信息学院,天津 300380)
  • 收稿日期:2011-04-06 出版日期:2012-01-20 发布日期:2012-01-20
  • 作者简介:张宗郁(1975-),男,讲师、硕士研究生,主研方向:数据挖掘,网络安全;张亚平,副教授、博士;张静远,硕士研究生;张晓君,助教、硕士研究生
  • 基金项目:

    天津市应用基础及前沿技术研究计划基金资助重点项目(09JCZDJC16800)

Application of Improved Association Rule Algorithm in College Teaching Management

ZHANG Zong-yu 1,2, ZHANG Ya-ping 1, ZHANG Jing-yuan 1, ZHANG Xiao-jun 3   

  1. (1. Institute of Computer Science and Technology, Tianjin University, Tianjin 300072, China; 2. Institute of Agriculture and Animal Husbandry, Tibet University, Linzhi 860000, China;3. Zhonghuan Information College, Tianjin University of Technology, Tianjin 300380, China)
  • Received:2011-04-06 Online:2012-01-20 Published:2012-01-20

摘要: 在分析基于位向量和无向图Apriori的基础上,提出一种改进的关联规则算法VGApriori。该算法将事务数据库的多次扫描和支持度计算转化为位向量的计算,将频繁项集的挖掘转换为无向图的完全子图挖掘,进一步缩减候选项集,提高频繁项集的发现效率。该算法在高校教学管理系统应用中取得较好的效果。

关键词: 关联规则, Apriori算法, 位向量, 无向图, 候选项集

Abstract: This paper proposes an improved Apriori algorithm VGApriori, which is based on bit vector and undirected graph methods. The algorithm maps the database into a Boolean matrix by scanning the database, and the frequent itemsets can be generated by simple vector operation and undirected itemsets Graph search. The efficiency is distinctly improved in discovers frequent itemsets. This algorithm is applied in college teaching management and achieves good results.

Key words: association rule, Apriori algorithm, bit vector, undirected graph, candidate itemsets

中图分类号: