·2,447,543篇论文数据，部分数据来源于NoteExpress
除此之外，算法对频繁模式树中每个节点增加一个位串来存储该项目的前缀项目，以避免在模式扩展的时候频繁的遍历子树。
In addition, we add a bit string to each node in the tree to store the prefix of the items. By using the structure we can avoid repeatedly traversing the sub-tree while expanding the patterns.
在模式挖掘方面，集成了目前有效的最大向前路径挖掘算法和频繁遍历路径挖掘算法，并且将孤立点分析方法引入日志挖掘中。
Efficient mining algorithm of maximum forward path and efficient mining algorithm of frequent traversal path are integrated in the mining period; Outlier analysis is introduced into the mining system.
应用推荐