涂明, 张公让, 程业媛. 一种高效的关联规则增量式更新算法[J]. 微电子学与计算机, 2010, 27(9): 56-60.
引用本文: 涂明, 张公让, 程业媛. 一种高效的关联规则增量式更新算法[J]. 微电子学与计算机, 2010, 27(9): 56-60.
TU Ming, ZHANG Gong-rang, CHENG Ye-yuan. An Efficient Incremental Updating Algorithm for Mining Association Rules[J]. Microelectronics & Computer, 2010, 27(9): 56-60.
Citation: TU Ming, ZHANG Gong-rang, CHENG Ye-yuan. An Efficient Incremental Updating Algorithm for Mining Association Rules[J]. Microelectronics & Computer, 2010, 27(9): 56-60.

一种高效的关联规则增量式更新算法

An Efficient Incremental Updating Algorithm for Mining Association Rules

  • 摘要: 提出一种基于垂直型数据格式的算法TMFUP,用来解决数据挖掘中数据库增加而最小支持度不变化时关联规则增量式更新问题.该算法只须扫描原始数据库和新增数据库一遍.

     

    Abstract: This paper presents a algorithm TMFUP based on the vertical data format.The paper keeps the minsupport changeless when new transaction database db is added to original database DB and generates the new association rules. This algorithm only takes one-scan on both the original database and the increased database.

     

/

返回文章
返回