Mining with prelarge trees for record modification

Chun Wei Lin, Tzung Pei Hong, Wen Hsiang Lu

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

Abstract

In this paper, the structure of the prelarge tree is proposed to maintain association rules for record modification based on the concept of pre-large itemsets. Due to the properties of the pre-large concept, the proposed algorithm can achieve a good execution time for tree maintenance especially when each time a small number of records are modified. Experimental results show that the proposed prelarge-tree maintenance algorithm has a good performance for handling updated records.

Original languageEnglish
Title of host publication3rd International Conference on Innovative Computing Information and Control, ICICIC'08
DOIs
Publication statusPublished - 2008 Sep 30
Event3rd International Conference on Innovative Computing Information and Control, ICICIC'08 - Dalian, Liaoning, China
Duration: 2008 Jun 182008 Jun 20

Publication series

Name3rd International Conference on Innovative Computing Information and Control, ICICIC'08

Other

Other3rd International Conference on Innovative Computing Information and Control, ICICIC'08
CountryChina
CityDalian, Liaoning
Period08-06-1808-06-20

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Software
  • Control and Systems Engineering

Fingerprint Dive into the research topics of 'Mining with prelarge trees for record modification'. Together they form a unique fingerprint.

Cite this