时间复杂性

• The result shows that the time complexity of algorithm is linear with the increment of transaction if the average length of transaction and frequent itemsets is invariable , but it is inefficient to the increament of item average length ( including transaction length and frequent itemset length )
  结果表明：在事务平均长度和频繁数据项集一定条件下事务规模对算法的时间复杂性影响是线性的；但算法却不能很好解决数据项长度(事务和频繁数据项平均长度)增大对其性能的影响。