Recursion is one of the familiar methods in algorithm design and analysis, and through this method many efficient algorithms can be found. 摘要递归是算法设计中常用的方法之一，利用递归可以得到很多高效算法。
Further, based upon the desirable properties of closed itemset lattices, a partition-based algorithm is developed, which proves to be highly efficient without information loss. 提出了一个基于划分的高效算法，在信息无损的前提下提高算法的效率。
