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。
Mining frequent patterns in transaction databases, time series databases, and many other kinds of databases has been studied popularly in data mining research.
挖掘事务数据库、时间序列数据库中的频繁模式已经成为数据挖掘中很受关注的研究方向。
The frequent patterns of texture could be mined by the algorithm of association rules mining. The association rules could be combined to represent the texture.
采用关联规则挖掘算法对图像纹理的频繁模式进行挖掘，通过联合关联规则来表达纹理。
Frequent patterns mining involves mining transactions, sequences, trees and graphs.
频繁模式挖掘的研究对象包括事务、序列、树和图。
Frequent patterns mining is an important aspect of data mining and includes mining transaction, sequence, tree and graph.
频繁模式挖掘是数据挖掘领域的一个重要方面，研究内容一般包括事务、序列、树和图。
Frequent patterns mining is an important aspect of data mining and includes mining transaction, sequence, tree and graph.
频繁模式挖掘是数据挖掘领域的一个重要方面，研究内容一般包括事务、序列、树和图。
应用推荐