Skip to main navigation Skip to search Skip to main content

Mining association rules: A continuous incremental updating technique

  • Beihang University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

A continuous incremental updating technique is proposed for efficient maintenance of the mining association rules when new transaction data are added to a transaction database. FP-growth algorithm can mine the complete set of frequent patterns by pattern fragment growth. To efficient maintenance of the mining association rules, we improve the FP-growth algorithm in three aspects: 1) an optimization technique for reducing the database size during the update process is discussed, and 2) the construction algorithm of a transaction tree T-tree, and 3) the candidate pattern pools are proposed based-on the structure of T-tree. Then, a continuous incremental updating algorithm, or CIU algorithm for short, is proposed. Our performance study shows that the continuous incremental updating technique is efficient and scalable for mining both long and short frequent patterns.

Original languageEnglish
Title of host publicationProceedings - 2010 International Conference on Web Information Systems and Mining, WISM 2010
Pages62-66
Number of pages5
DOIs
StatePublished - 2010
Event2010 International Conference on Web Information Systems and Mining, WISM 2010 - Sanya, China
Duration: 23 Oct 2010 → 24 Oct 2010

Publication series

NameProceedings - 2010 International Conference on Web Information Systems and Mining, WISM 2010
Volume1

Conference

Conference2010 International Conference on Web Information Systems and Mining, WISM 2010
Country/TerritoryChina
CitySanya
Period23/10/10 → 24/10/10

Keywords

  • amalgamate transactions
  • association rules
  • continuous incremental updating technique
  • data mining

Fingerprint

Dive into the research topics of 'Mining association rules: A continuous incremental updating technique'. Together they form a unique fingerprint.

Cite this