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. 提出了一個(gè)基于劃分的高效算法，在信息無(wú)損的前提下提高算法的效率。
