Efficient Incremental Sequence Mining for Temporal Databases: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 04:1904:19, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,350 bytes +2,350‎ Created page with "Title: Efficient Incremental Sequence Mining for Temporal Databases Abstract: This research proposes an efficient algorithm called IUS (Incrementally Updating Sequential Patterns) for mining sequential patterns in a temporal database. The algorithm uses frequent and negative border sequences from the original database to perform incremental sequence mining. It also presents an algorithm called DUS (Decreasingly Updating Sequential Patterns) to handle updates in the data..."
Retrieved from "https://simplesci.org/wiki/Efficient_Incremental_Sequence_Mining_for_Temporal_Databases"