摘要： 在交易数据库和最小支持度不变条件下，充分利用在多个交易项目子集中已采掘频繁接式集，对该多个交易项目子集的并集的关联规则的采掘，提出了两种快速更新算法Ｋｚｌ－ａｒ和Ｎｚｌ－ａｒ．
关键词:
关联规则,
最小支持度,
频繁模式集,
交易项目集
Abstract: in this paper, fast updating and mining algorithms Kzl-ar and Nzl-ar of association rules, that fully use the frcquent pattern sots of the transaction rules mined in user's spedal intcrcsling transachon ilcm subscls, arc l,rcscnted in the transaction data base DB and the minimum support confidence when union of the association item subsets.
中图分类号:
张继福,刘静,谭瑛,白尚旺. 基于多交易项目子集的并集的关联规则更新采掘[J]. , 2000, 26(01): 71-73.
Zhang Jifu, Liu Jing, Tan Ying, Bai Shangwang. Updating and Mining Association Rules Based on the Union of Transaction item Subsets[J]. , 2000, 26(01): 71-73.