The Algorithms of Updating Sequential Patterns

Simple item page
dc.creatorZheng, Qingguo
dc.creatorXu, Ke
dc.creatorMa, Shilong
dc.creatorLv, Weifeng
dc.date2002-03-27
dc.date.accessioned2026-07-07T03:18:14Z
dc.date.available2026-07-07T03:18:14Z
dc.descriptionBecause the data being mined in the temporal database will evolve with time, many researchers have focused on the incremental mining of frequent sequences in temporal database. In this paper, we propose an algorithm called IUS, using the frequent and negative border sequences in the original database for incremental sequence mining. To deal with the case where some data need to be updated from the original database, we present an algorithm called DUS to maintain sequential patterns in the updated database. We also define the negative border sequence threshold: Min_nbd_supp to control the number of sequences in the negative border.
dc.description12 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/cs/0203027
dc.identifierhttp://arxiv.org/abs/cs/0203027
dc.identifierThe Second SIAM Data mining2002: workshop HPDM
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31031
dc.subjectDatabases
dc.subjectArtificial Intelligence
dc.subjectH.2.8
dc.titleThe Algorithms of Updating Sequential Patterns
dc.typetext

Files

Collections

arXiv