Name
Title | ||
|---|---|---|
Extracting Frequent Subsequences from a Single Long Data Sequence: A Novel Anti-Monotonic Measure and a Simple On-Line Algorithm |
Abstract | ||
|---|---|---|
In this paper, we study frequent-subsequence extraction from a single very-long data-sequence. First we propose a novel frequency measure, called the total frequency, for counting multiple occurrences of a sequential pattern in a single data sequence. The total frequency is anti-monotonic, and makes it possible to count up pattern occurrences without duplication. Moreover the total frequency has a good property for implementation based on the dynamic programming strategy. Second we give a simple on-line algorithm for a specialized subsequence extraction problem, i.e., a problem with the infinite window-length. This specialized problem is considered to be a relaxation of the general-case problem, thus this fast on-line algorithm is important from the view of practical applications. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/ICDM.2005.60 | ICDM |
Keywords | Field | DocType |
sequential pattern,total frequency,specialized subsequence extraction problem,frequent subsequences,pattern occurrence,simple on-line algorithm,frequent-subsequence extraction,specialized problem,novel anti-monotonic measure,fast on-line algorithm,single long data sequence,novel frequency measure,general-case problem,data mining | Dynamic programming,Monotonic function,Data mining,Pattern recognition,Computer science,Algorithm,Artificial intelligence,Subsequence | Conference |
ISBN | Citations | PageRank |
0-7695-2278-5 | 8 | 0.55 |
References | Authors | |
8 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Koji Iwanuma | 1 | 138 | 17.65 |
| Ryuichi Ishihara | 2 | 8 | 0.55 |
| Yo Takano | 3 | 8 | 0.55 |
| Hidetomo Nabeshima | 4 | 154 | 14.88 |