摘要
在约束关联规则挖掘过程中,影响交互的制约因素是挖掘算法的执行时间。为了 提高挖掘过程的交互性,文章提出一种基于两阶段的约束关联规则挖掘算法。算法利用已挖 掘的关联规则,实现约束关联规则的挖掘过程。在算法实现的过程中对关联规则集存储结构 进行了优化,并扩展了类SQL查询语句。实验结果表明,由于在约束条件挖掘的过程中不需 要再对数据库进行挖掘处理,节省了大量的用户时间,因此算法是有效的。
In procedure of mining constrained association rules, the execution time is a large obstacle to realize mining algorithm. In order to degrade respon se time, a new algorithm is provided in this paper. Based on the mined associati on rules, this algorithm optimizes the storage structure of association rules, a nd extends SQL-like query statement. The experimental result also shows its effi ciency due to the constrained association rules can be got from the mined rule s et rather than from the database.
出处
《计算机工程》
CAS
CSCD
北大核心
2004年第1期71-72,84,共3页
Computer Engineering
基金
湖南省自然科学基金资助项目
关键词
关联规则
数据挖掘
约束挖掘
Association rules
Data mining
Constraint mining