Of all the incremental mining algorithms, the IUS is the most advanced at present.
在序列模式的增量式挖掘算法中，IUS算法是目前最为先进的算法。
In this paper we study such a special case: a tree network with all sources on a path and we present its polynomial-time algorithms.
本文研究了这样的特殊情形：树网络上所有起点处于同一条路上，建立了多项式时间算法。
应用推荐