Mining maximum frequent patterns is a key problem in data mining research.
挖掘最大频繁模式是多种数据挖掘应用中的关键问题。
Mining and updating maximum frequent patterns is a key problem in data mining research.
挖掘和更新最大频繁模式是多种数据挖掘应用中的关键问题。
At the same time, this algorithm is fast in searching for maximum frequent patterns with less space.
同时，此算法还能以较少的空间代价快速查找最大频繁模式。
This paper proposes a fast algorithm DMFP and an updating algorithm IUMFP, which are based on Prefix Tree for mining maximum frequent patterns.
因此，文章提出了一种最大频繁模式的快速挖掘算法DMFP及更新算法IUMFP。
This paper proposes a fast algorithm DMFP and an updating algorithm IUMFP, which are based on Prefix Tree for mining maximum frequent patterns.
因此，文章提出了一种最大频繁模式的快速挖掘算法DMFP及更新算法IUMFP。
应用推荐