摘要
本文针对大型交易事务数据库数据间发现关联规则问题,提出了一个新的关联规则挖掘算法,BOM(BaseOn Matrix)算法。该算法不同于经典的 Apriori 算法,对于大型交易事务数据库,具有较 Apriori 算法更加优越的性能。
In this paper, the problem of discovering association rules between items in a large database of sales transactions is discussed, and a novel algorithm ,BOM （Base On Matrix）,is proposed. The Proposed algorithm is fundamentally different from the known algorithm Apriori. Empirical evaluation shows that the algorithm outperforms the known one for large databases.
出处
《计算机科学》
CSCD
北大核心
2006年第4期188-189,197,共3页
Computer Science
基金
山东省中青年科学家科研奖励基金(NO.02BS012)
关键词
大型交易事务数据库
矩阵
关联规则
Large database of sales transactions, Matrix,Association rules
