Incremental mining with prelarge trees

Chun Wei Lin, Tzung Pei Hong, Wen Hsiang Lu, Been Chian Chien

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

In the past, we proposed a Fast Updated FP-tree (FUFP-tree) structure to efficiently handle new transactions and to make the tree-update process become easy. In this paper, we propose the structure of prelarge trees to incrementally mine association rules based on the concept of pre-large itemsets. Due to the properties of pre-large concepts, the proposed approach does not need to rescan the original database until a number of new transactions have been inserted. Experimental results also show that the proposed approach has a good performance for incrementally handling new transactions.

Original languageEnglish
Title of host publicationNew Frontiers in Applied Artificial Intelligence - 21st International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2008, Proceedings
Pages169-178
Number of pages10
DOIs
Publication statusPublished - 2008 Aug 5
Event21st International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2008 - Wroclaw, Poland
Duration: 2008 Jun 182008 Jun 20

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5027 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other21st International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2008
CountryPoland
CityWroclaw
Period08-06-1808-06-20

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Incremental mining with prelarge trees'. Together they form a unique fingerprint.

Cite this