摘要
发现频繁项目集是关联规则挖掘的关键问题,而发现的过程是高花费的。因此,要求对增量挖掘算法进行深入研究。这使得关联规则的更新成为数据挖掘技术中的一个重要内容。文中就关联规则的增量式更新问题进行了探讨,针对最小支持度发生变化时的增量式更新算法(IUA)的不足,提出了改进算法(AIUA),在保证算法有效的同时提高了效率。
Discovering the frequent itemsets is the key problem of association rules mining, and the process of discovery is of high expenditure： Therefore, it requests Us to pay more attention to the research of the incremental updating algorithms. This causes the updating of association rules to be an important content in data mining technology. So this article has carried on the discussion on this, IUA is an incremental updating：algorithm when the rain-support changes. This article points out its existing problems, and provides a new algorithm AIUA. In this algorithm, the efficiency is increased besides guaranteeing the validity of the algorithm.
出处
《计算机技术与发展》
2007年第1期108-110,113,共4页
Computer Technology and Development
基金
安徽省教育厅自然科学基金重点资助(2004KJ053ZD)
关键词
数据挖掘
关联规则
增量式更新
data mining
assoclatlon rules
ineremental updating
