摘要
提出了一种基于有向图的关联规则挖掘算法,采用了垂直二进制位图映射数据库,根据垂直二进制位图来生成有向图,将频繁项的二进制位串作为有向图的权值,通过分析有向图生成最大频繁项集,并给出了最大频繁项集挖掘算法的优势。
A new algorithm of mining association rules based on directed graph is proposed, vertical bitmap is used to represent transaction database, and directed graph is generated based on vertical bitmap.And frequent item binary string is used as weight of directed graph edge, then pruning algorithm of directed graph is delivered, finally maximal frequent item sets are obtained by analyzing directed graph.
出处
《重庆邮电学院学报(自然科学版)》
2005年第4期495-498,共4页
Journal of Chongqing University of Posts and Telecommunications(Natural Sciences Edition)