邻接矩阵在高校图书馆借阅数据挖掘中的应用  

Application of Adjacent-Matrix in Data Mining for University Library

作　　者：唐金文[1] 张廷宪[2] 聂建国[3] 胡振渝[3] 

机构地区：[1]曲靖师范学院计算机科学与工程学院,云南曲靖655011 [2]曲靖师范学院物理与电子工程学院,云南曲靖655011 [3]曲靖师范学院图书馆,云南曲靖655011

出　　处：《现代情报》2011年第8期25-31,共7页Journal of Modern Information

摘　　要：Apriori算法是关联规则挖掘的一个经典算法,针对Apriori算法的不足,提出了基于邻接矩阵的算法,该算法首先用邻接矩阵将事务数据库表示出来,然后基于邻接矩阵生成频繁k-项集。以高校图书馆借阅历史数据的挖掘为例,详细描述了事务数据库相应的邻接矩阵生成算法、k-项集生成算法以及相应的数据结构设计,算法均采用C语言描述。The Apriori algorithm is a classical method of association rule mining,to the deficiency of Apriori algorithm,an improved Apriori algorithm based on the adjacent matrix was put forward.This algorithm converted the affair database to adjacent matrix and operated it to find out k-frequent item sets.As an instance,the lending data of university library＇s data mining of this improved algorithm was explored,which included data structure and the improved algorithm were scribed by using C programming language in detail.

关 键 词：APRIORI算法 关联规则 邻接矩阵 

分 类 号：G252.2[文化科学—图书馆学]