摘要
关联规则是数据挖掘研究的一个重要课题。本文提出了一种新的算法,可以大大减少扫描数据库的次数,能够灵活的在时空两方面取得折衷,提高了效率。
Mining association rules is an important topic of data min ing research .This paper presents a new algorithm , which not only can reduce the times it scans the database , but also can reach a perfec t balance between time and space .It can improve the efficiency greatly .
出处
《燕山大学学报》
CAS
2001年第3期213-216,共4页
Journal of Yanshan University