该算法应用于单维、单层、布尔关联规则，其核心是基于两阶段频集思想的递推算法。首先找出所有的频集，这些项集出现的频繁性至少和预定义的最小支持度一样。然后由频集产生强关联规则，这些规则必须满足最小支持度和最小可信度。-The algorithm is applied to one-dimensional, single-layer, Boolean association rules, its core is based on the idea of ​ ​ a two-stage recursive algorithm for frequent set. First, find all frequent sets, these items set the frequency of emergence of at least a predefined minimum support the same. Set generated by the frequency and strong association rules, these rules must satisfy minimum support and minimum confidence.