摘要
讨论了在大数据库上挖掘关联规则的数组方法。给出了一个数组方法，它效率更高，扫描整个数据库最多两遍．
The authors proposed a data based algorithm for mining associntion rules bctweenitems in a large database. The algorithm overcomes the shortcomings of the exitingalgorithms, and reduces the number of passas of scaning database so that I/O overhead is redued significantly. Analysis and experimental results show that the algoritlim is more efficientthan other.
出处
《黑龙江商学院学报》
2000年第2期4-9,共6页
Journal of Harbin Commercial University(Natural Sciences Edition)
