摘要
关联规则是数据挖掘研究领域的重要内容之一.在无向项集图的基础上,结合RSAA算法,提出了一种新的挖掘关联规则的算法,用以发现数据库中有价值的稀有数据.通过将该算法与RSAA算法的分析比较,证明了其在获得频繁项集的效率上具有更好的性能.
Data mining has been one of the most important topics in database research. Associating the undirected itemsets graph and RSAA algorithm, we propose a new algorithm of discovering the association rules for significant rare data in the database. Furthermore, we evaluate the performance of the proposed algorithm by comparing with RSAA algorithm.
出处
《山东师范大学学报(自然科学版)》
CAS
2005年第4期17-19,共3页
Journal of Shandong Normal University(Natural Science)
关键词
数据挖掘
无向项集图
有价值的稀有数据
关联规则
data mining
undirected itemsets graph
significant rare data
association rule