【作者】 程转流； 胡为成； 胡学钢；

【Author】 CHENG Zhuan-liu1,2, HU Wei-cheng2, HU Xue-gang1 (1 College of Computer Science, Hefei Technology University, Hefei 230009, China; 2 Department of Computer Science, Tongling College, Tongling 244000, China)

【机构】 合肥工业大学计算机与信息学院； 铜陵学院计算机系；

【摘要】 频繁闭合模式集可惟一确定频繁模式完全集且数据量要小几个数量级。根据分布式数据流的特点,提出了一种挖掘频繁闭合项集的算法,该算法采用K叉树形结构,以叶子节点接收各条数据流,创建DSFCI_tree结构来存贮各条数据流中的每段闭合模式,然后逐层往上合并更新,从而在根节点可得整个分布式数据流的频繁闭合模式。更多还原

【Abstract】 The set of frequent closed patterns uniquely determines the complete set of all frequent patterns, and it can be orders of magnitude smaller than the latter. According to the features of distributed data streams, a new algorithm is proposed for mining the frequent closed patterns. This algorithm uses K-children tree structure, receives each data stream by the leaf node, founds the DSFCI_tree to store each section of closed patterns in each data stream, then the cascade merges upward and renews, thus may result in the root node the frequent closed pattern in the entire distributional data streams. The experiments and analysis show that the algorithm has good performance.更多还原