The stress of main memory is abated, the times of scan of database are cut down, and the algorithm executes more efficient mining of association rules in time-variant database.
该算法通过分组及时舍弃挖掘过程中生成的非频繁项目集，有效降低主存压力，减少对数据库的扫描次数，能够对时变数据库进行高效地关联规则挖掘。
And making an experiment on it, it proves that binary system sequences set is efficient and feasible as an approach of organization data based on mining of association rules.
通过实验验证，在关联规则数据挖掘中采用二进制序列集这一组织数据方法是有效且可行的。
Discovering association rules is one of the most important tasks in data mining and many efficient algorithms were proposed in literature.
关联规则挖掘是数据挖掘中重要的研究课题，已有许多有效的实现算法。
应用推荐