基于关联矩阵的频繁项集挖掘算法
Journal of Yunnan University of Nationalities(Natural Sciences Edition)（2012）
Abstract
根据经典Apriori性质和算法思想,提出了一种基于关联矩阵的挖掘频繁项集的算法.应用实例分析表明,该算法在挖掘过程中,只需扫描一次数据库,有效地减少了扫描数据库的次数,提高了算法的效率.
MoreTranslated text
Key words
frequent itemsets,associated matrix,Apriori algorithm
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined