Multi-relational frequent pattern mining algorithm
一种多关系频繁模式挖掘算法*

While dealing with multi-relation, traditional data mining algorithms used the way of physical join. In order to solve this problem, this paper proposed a multi-relational frequent pattern mining algorithm. By taking advantage of tuple ID propagation approach, this algorithm could directly mine frequent pattern in multi-relation without physical join. Experiment demonstrates that, this algorithm has high efficiency.