邻接矩阵在高校图书馆借阅数据挖掘中的应用 |
| |
引用本文: | 唐金文,张廷宪,聂建国,胡振渝.邻接矩阵在高校图书馆借阅数据挖掘中的应用[J].现代情报,2011,31(8):25-31. |
| |
作者姓名: | 唐金文 张廷宪 聂建国 胡振渝 |
| |
作者单位: | 1. 曲靖师范学院计算机科学与工程学院,云南 曲靖655011;2. 曲靖师范学院物理与电子工程学院,云南 曲靖655011;3. 曲靖师范学院图书馆,云南 曲靖655011 |
| |
摘 要: | Apriori算法是关联规则挖掘的一个经典算法,针对Apriori算法的不足,提出了基于邻接矩阵的算法,该算法首先用邻接矩阵将事务数据库表示出来,然后基于邻接矩阵生成频繁k_项集。以高校图书馆借阅历史数据的挖掘为例,详细描述了事务数据库相应的邻接矩阵生成算法、k_项集生成算法以及相应的数据结构设计,算法均采用C语言描述。
|
关 键 词: | Apriori算法 关联规则 邻接矩阵 |
Application of Adjacent-Matrix in Data Mining for University Library |
| |
Authors: | Tang Jjinwen Zhang Tingxian Nie Jianguo Hu Zhenyu |
| |
Institution: | 1. College of Computer Science and Technology,Qujing Normal University,Qujing 655011,China;2. College of Physical and Electronic,Qujing Normal University,Qujing 655011,China;3. Library,Qujing Normal University,Qujing 655011,China |
| |
Abstract: | 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 d... |
| |
Keywords: | apriori algorithm association rules adjacent matrix |
本文献已被 CNKI 维普 万方数据 等数据库收录! |
| 点击此处可从《现代情报》浏览原始摘要信息 |
| 点击此处可从《现代情报》下载免费的PDF全文 |
|